Verifiable Secret Sharing as Secure Computation
1995; Springer Science+Business Media; Linguagem: Inglês
10.1007/3-540-49264-x_14
ISSN1611-3349
AutoresRosario Gennaro, Silvio Micali,
Tópico(s)Coding theory and cryptography
ResumoVerifiable Secret Sharing is a fundamental primitive for secure cryp- tographic design. We present a stronger notion of verifiable secret sharing and exhibit a protocol implementing it. We show that our new notion is preferable to the old ones whenever verifiable secret sharing is used as a tool within larger protocols, rather than being a goal in itself. Indeed our definition, and so our protocol satisfying it, provably guarantees reducibility. Applications of this new notion in the field of secure multiparty computation are also provided.
Referência(s)