Abstract
Verifiable 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.
Research supported by NSF grant no.9121466-CCR
Chapter PDF
References
Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In 20th ACM Symposium on Theory of Computing, pages 1–10, 1988.
G.R. Blakley. Safeguarding cryptographic keys. In National Computer Conference, pages 313–317, 1979.
David Chaum, Claude Crepeau, and Ivan Damgard. Multiparty unconditionally secure protocols. In 20th ACM Symposium on Theory of Computing, pages 11–19, 1988.
Benny Chor, Shafi Goldwasser, Silvio Micali, and Baruch Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In 26th IEEE Symposium on Foundations of Computer Science, pages 383–395, 1985.
Yvo Desmedt and Yair Frankel. Shared generation of authentication and signatures. In CRYPTO’91, Lecture Notes in Computer Science, pages 457–469. Springer-Verlag, 1991.
Yvo Desmedt, Yair Frankel, and Moti Yung. Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback. In INFOCOM, pages 2045–2054, 1992.
Paul Feldman and Silvio Micali. An optimal probabilistic protocol for synchronous byzantine agreement. In 20th ACM Symposium on Theory of Computing, 1988.
Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game. In 19th ACM Symposium on Theory of Computing, pages 218–229, 1987.
Silvio Micali and Philip Rogaway. Secure computation. In CRYPTO’91, Lecture Notes in Computer Science. Springer-Verlag, 1991. Current version available from the authors.
Tal Rabin and Michael Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In 21st ACM Symposium on Theory of Computing, 1989.
Adi Shamir. How to share a secret. Communications of the ACM, 22(11):612–613, 1979.
W. Peterson and E. Weldon. Error Correcting Codes. MIT Press, second edition, 1972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gennaro, R., Micali, S. (1995). Verifiable Secret Sharing as Secure Computation. In: Guillou, L.C., Quisquater, JJ. (eds) Advances in Cryptology — EUROCRYPT ’95. EUROCRYPT 1995. Lecture Notes in Computer Science, vol 921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49264-X_14
Download citation
DOI: https://doi.org/10.1007/3-540-49264-X_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59409-3
Online ISBN: 978-3-540-49264-1
eBook Packages: Springer Book Archive