{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:20:47Z","timestamp":1725488447860},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594093"},{"type":"electronic","value":"9783540492641"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-49264-x_14","type":"book-chapter","created":{"date-parts":[[2007,8,7]],"date-time":"2007-08-07T06:52:09Z","timestamp":1186469529000},"page":"168-182","source":"Crossref","is-referenced-by-count":15,"title":["Verifiable Secret Sharing as Secure Computation"],"prefix":"10.1007","author":[{"given":"Rosario","family":"Gennaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvio","family":"Micali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"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\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"G.R. Blakley. Safeguarding cryptographic keys. In National Computer Conference, pages 313\u2013317, 1979.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"David Chaum, Claude Crepeau, and Ivan Damgard. Multiparty unconditionally secure protocols. In 20th ACM Symposium on Theory of Computing, pages 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013395, 1985.","DOI":"10.1109\/SFCS.1985.64"},{"key":"14_CR5","series-title":"Lect Notes Comput Sci","first-page":"457","volume-title":"CRYPTO\u201991","author":"Y. Desmedt","year":"1991","unstructured":"Yvo Desmedt and Yair Frankel. Shared generation of authentication and signatures. In CRYPTO\u201991, Lecture Notes in Computer Science, pages 457\u2013469. Springer-Verlag, 1991."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Yvo Desmedt, Yair Frankel, and Moti Yung. Multi-receiver\/multi-sender network security: efficient authenticated multicast\/feedback. In INFOCOM, pages 2045\u20132054, 1992.","DOI":"10.1109\/INFCOM.1992.263476"},{"key":"14_CR7","unstructured":"Paul Feldman and Silvio Micali. An optimal probabilistic protocol for synchronous byzantine agreement. In 20th ACM Symposium on Theory of Computing, 1988."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game. In 19th ACM Symposium on Theory of Computing, pages 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"14_CR9","series-title":"Lect Notes Comput Sci","volume-title":"CRYPTO\u201991","author":"S. Micali","year":"1991","unstructured":"Silvio Micali and Philip Rogaway. Secure computation. In CRYPTO\u201991, Lecture Notes in Computer Science. Springer-Verlag, 1991. Current version available from the authors."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Tal Rabin and Michael Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In 21st ACM Symposium on Theory of Computing, 1989.","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"14_CR11","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Adi Shamir. How to share a secret. Communications of the ACM, 22(11):612\u2013613, 1979.","journal-title":"Communications of the ACM"},{"key":"14_CR12","unstructured":"W. Peterson and E. Weldon. Error Correcting Codes. MIT Press, second edition, 1972."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201995"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49264-X_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T17:32:11Z","timestamp":1587835931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49264-X_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594093","9783540492641"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-49264-x_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1995]]}}}