{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:09Z","timestamp":1725489129967},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551881"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46766-1_8","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T15:03:27Z","timestamp":1186844607000},"page":"114-128","source":"Crossref","is-referenced-by-count":0,"title":["On Verification in Secret Sharing"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"D. Beaver, and S. Goldwasser, Multiparty Computation with Faulty Majority, Proc. 30th Symp. on Foundations of Comp. Science, pp. 468\u2013473, 1989.","DOI":"10.1109\/SFCS.1989.63520"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. 20th Symp. on Theory of Computing, pp. 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau, and I. Damgard, Multiparty Unconditionally Secure Protocols, Proc. 20th Symp. on Theory of Computing, 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults, Proc. 26 Symp. on Foundations of Computing, pp. 383\u2013395, 1985.","DOI":"10.1109\/SFCS.1985.64"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"B. Chor, and M. Rabin, Achieving Independence in Logarithmic Number of Rounds, Proc. 6th Annual ACM Symp. on Principles of Distributed Computing, pp. 260\u2013268 (1987).","DOI":"10.1145\/41840.41862"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"C. Dwork, Strong Verifiable Secret Sharing, to appear, Proc. 4th International Workshop on Distributed Algorithms (1990), Springer Verlag.","DOI":"10.1007\/3-540-54099-7_15"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork, O. Waarts, and M. Yung, Perfectly Secure Message Transmission, Proc. 31st Annual Symposium on Foundations of Computer Science, pp. 36\u201345 (1990).","DOI":"10.1109\/FSCS.1990.89522"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"P. Feldman, and S. Micali, Optimal Algorithms for Byzantine Agreement, Proc. 20th Symp. on Theory of Computing, pp. 148\u2013161, 1988.","DOI":"10.1145\/62212.62225"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, How to Play Any Mental Game, Proc. 19th Symp. on Theory of Computing, pp. 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, Proc. 17th Annual ACM Symposium on Theory of Computing (1985), pp. 291\u2013304.","DOI":"10.1145\/22145.22178"},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/79147.79161","volume":"37","author":"J. Halpern","year":"1990","unstructured":"J. Halpern and Y. Moses, Knowledge and Common Knowledge in a Distributed Environment, JACM 37(3), pp. 549\u2013587, 1990.","journal-title":"JACM"},{"issue":"9","key":"8_CR12","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R. McEliece","year":"1981","unstructured":"R. McEliece and D. Sarwate, On Sharing Secrets and Reed-Solomon Codes, CACM 24(9), pp. 583\u2013584, 1981.","journal-title":"CACM"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"T. Rabin, and M. Ben-Or, Verifiable Secret Sharing and Multiparty Protocols with Honest Majority, Proc. 21st Symp. on Theory of Computing, pp. 73\u201385, 1989.","DOI":"10.1145\/73007.73014"},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to Share a Secret, CACM 22, pp. 612\u2013613, 1979.","journal-title":"CACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46766-1_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:37Z","timestamp":1605647617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46766-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540551881"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-46766-1_8","relation":{},"subject":[]}}