{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:23:08Z","timestamp":1758273788559,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577669"},{"type":"electronic","value":"9783540483298"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-48329-2_7","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:25:55Z","timestamp":1186363555000},"page":"73-84","source":"Crossref","is-referenced-by-count":13,"title":["Secret Sharing and Perfect Zero Knowledge"],"prefix":"10.1007","author":[{"given":"A.","family":"De Santis","sequence":"first","affiliation":[]},{"given":"G.","family":"Di Crescenzo","sequence":"additional","affiliation":[]},{"given":"G.","family":"Persiano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"7_CR1","unstructured":"M. Bellare and M. Yung, Certifying Cryptographic Tools: The case of Trapdoor Permutations, in CRYPTO 92."},{"key":"7_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/0-387-34799-2_4","volume-title":"Advances in Cryptology \u2014 CRYPTO 88","author":"M. Ben-Or","year":"1988","unstructured":"M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, S. Micali, and P. Rogaway, Everything Provable is Provable in Zero Knowledge, in \u201cAdvances in Cryptology \u2014 CRYPTO 88\u201d, vol. 403 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag, pp. 37\u201356."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"G. R. Blackley, Safeguarding Chryptographic Keys, Proceedings AFIPS 1979 National Computer Conference, pp. 313\u2013317, June 1979.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF00196727","volume":"4","author":"J. Boyar","year":"1991","unstructured":"J. Boyar, K. Friedl, and C. Lund, Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies, Journal of Cryptology, n. 4, pp. 185\u2013206, 1991.","journal-title":"Journal of Cryptology"},{"issue":"6","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge, SIAM Journal of Computing, vol. 20, no. 6, Dec 1991, pp. 1084\u20131118.","journal-title":"SIAM Journal of Computing"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Applications, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 103\u2013112.","DOI":"10.1145\/62212.62222"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R. Boppana","year":"1987","unstructured":"R. Boppana, J. Hastad, and S. Zachos, Does co-NP has Short Interactive Proofs?, Inf. Proc. Lett., vol. 25, May 1987, pp. 127\u2013132.","journal-title":"Inf. Proc. Lett."},{"key":"7_CR8","series-title":"Lect Notes Comput Sci","first-page":"52","volume-title":"Advances in Cryptology \u2014 CRYPTO 87","author":"A. Santis De","year":"1987","unstructured":"A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof-Systems, in \u201cAdvances in Cryptology \u2014 CRYPTO 87\u201d, vol. 293 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag, pp. 52\u201372."},{"key":"7_CR9","unstructured":"A. De Santis, G. Persiano, and M. Yung, Perfect Zero-Knowledge Proofs for Graph Isomorphism Languages. manuscript."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"U. Feige, D. Lapidot, and A. Shamir, Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String, in Proceedings of 22nd Annual Symposium on the Theory of Computing, 1990, pp. 308\u2013317.","DOI":"10.1109\/FSCS.1990.89549"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"L. Fortnow, The Complexity of Perfect Zero-Knowledge, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 204\u2013209.","DOI":"10.1145\/28395.28418"},{"key":"7_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/0-387-34799-2_5","volume-title":"Advances in Cryptology-CRYPTO 88","author":"O. Goldreich","year":"1988","unstructured":"O. Goldreich and E. Kushilevitz, A Perfect Zero Knowledge Proof for a Decision Problem Equivalent to Discrete Logarithm, in \u201cAdvances in Cryptology-CRYPTO 88\u201d, Ed. S. Goldwasser, vol. 403 of \u201cLecture Notes in Computer Science\u201d, Springei-Verlag, pp. 57\u201370."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but their Validity and a Methodology of Cryptographic Design, Proceedings of 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, How to Play Any Mental Game, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM Journal on Computing, vol. 18, n. 1, February 1989.","DOI":"10.1137\/0218012"},{"key":"7_CR16","series-title":"Lect Notes Comput Sci","first-page":"40","volume-title":"Advances in Cryptology \u2014 CRYPTO 87","author":"R. Impagliazzo","year":"1987","unstructured":"R. Impagliazzo and M. Yung, Direct Minimum Knowledge Computations \u201cAdvances in Cryptology \u2014 CRYPTO 87\u201d, vol. 293 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag pp. 40\u201351."},{"key":"7_CR17","unstructured":"I. Niven and H. S. Zuckerman, An Introduction to the Theory of Numbers, John Wiley and Sons, 1960, New York."},{"issue":"11","key":"7_CR18","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret, Communication of the ACM, vol. 22, n. 11, November 1979, pp. 612\u2013613.","journal-title":"Communication of the ACM"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"G. J. Simmons, An Introduction to Shared Secret and\/or Shared Control Schemes and Their Application, Contemporary Cryptology, IEEE Press, pp. 441\u2013497, 1991.","DOI":"10.1007\/3-540-38424-3_16"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D. R. Stinson","year":"1992","unstructured":"D. R. Stinson, An Explication of Secret Sharing Schemes, Design, Codes and Cryptography, Vol. 2, pp. 357\u2013390, 1992.","journal-title":"Design, Codes and Cryptography"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"M. Tompa and H. Woll, Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information, Proc. 28th Symposium on Foundations of Computer Science, 1987, pp. 472\u2013482.","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48329-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T04:20:19Z","timestamp":1737346819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48329-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577669","9783540483298"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-48329-2_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1994]]}}}