Sciweavers

13 search results - page 3 / 3
» Ideal Multipartite Secret Sharing Schemes
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 9 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
13 years 10 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
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...
Ronald Cramer, Ivan Damgård, Serge Fehr
PERCOM
2006
ACM
14 years 5 months ago
Multi-channel Protocols for Group Key Agreement in Arbitrary Topologies
We consider group key agreement (GKA) protocols, used by a group of peers to establish a shared secret key for multicast communications. There has been much previous work to impro...
Ford-Long Wong, Frank Stajano