18 search results - page 3 / 4 » The Round Complexity of Verifiable Secret Sharing Revisited |
CISC
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will re...
CRYPTO
2001
Springer
13 years 10 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
CAV
2001
Springer
13 years 9 months ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
IACR
2011
12 years 5 months ago
2011
We revisit meet-in-the-middle attacks on block ciphers and recent developments in meet-in-the-middle preimage attacks on hash functions. Despite the presence of a secret key in the...
EUROCRYPT
2009
Springer
14 years 6 months ago
2009
Springer
A group key agreement (GKA) protocol allows a set of users to establish a common secret via open networks. Observing that a major goal of GKAs for most applications is to establish...