{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:18Z","timestamp":1725455418587},"publisher-location":"Berlin\/Heidelberg","reference-count":17,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016291","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"639-650","source":"Crossref","is-referenced-by-count":1,"title":["Proofs that Release Minimum Knowledge"],"prefix":"10.1007","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvio","family":"Micali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"62_CR1","unstructured":"Aho, A.V., J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publ. Co., 1974."},{"key":"62_CR2","doi-asserted-by":"crossref","unstructured":"Chor, B., S. Goldwasser, S. Micali, and B. Awerbuch, \u201dVerifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults\u201d, Proc. 26th FOCS, 1985, pp. 383\u2013395.","DOI":"10.1109\/SFCS.1985.64"},{"key":"62_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., \u201dTrading Group Theory for Randomness\u201d, Proc. 17th STOC, 1985, pp. 421\u2013429.","DOI":"10.1145\/22145.22192"},{"key":"62_CR4","unstructured":"Ben-Or, M., private communication, 1986."},{"key":"62_CR5","unstructured":"Blum, M., \u201dCoin Flipping by Phone\u201d, IEE\u00c9 Spring COMPCOM, pp. 133\u2013137, February 1982."},{"key":"62_CR6","unstructured":"Boppana, R., and J. Hastad, in preparation, 1986."},{"key":"62_CR7","doi-asserted-by":"crossref","unstructured":"Cook, S.A., \u201dThe Complexity of Theorem Proving Procedures\u201d, 3rd STOC, pp. 151\u2013158, 1971.","DOI":"10.1145\/800157.805047"},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Galil, Z., S. Haber, and M. Yung, \u201dA Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems\u201d, Proc. 26th FOCS, 1985, pp. 360\u2013371.","DOI":"10.1109\/SFCS.1985.1"},{"key":"62_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979."},{"key":"62_CR10","unstructured":"Goldreich, O., \u201dA Zero-Knowledge Proof that a Two-Prime Moduli Is Not a Blum Integer\u201d, unpublished manuscript, 1985."},{"issue":"2","key":"62_CR11","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., and S. Micali, \u201dProbabilistic Encryption\u201d, JCSS, Vol. 28, No. 2, 1984, pp. 270\u2013299.","journal-title":"JCSS"},{"key":"62_CR12","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., S. Micali, and C. Rackoff, \u201dKnowledge Complexity of Interactive Proofs\u201d, Proc. 17th STOC, 1985, pp. 291\u2013304.","DOI":"10.1145\/22145.22178"},{"key":"62_CR13","unstructured":"Goldwasser, S., and M. Sipser, \u201dArthur Merlin Games versus Interactive Proof Systems\u201d, to appear in the 18th STOC, 1986."},{"key":"62_CR14","doi-asserted-by":"crossref","unstructured":"Karp, R.M., \u201dReducibility among Combinatorial Problems\u201d, Complexity of Computer Computations, R.E. Miller and J.W. Thatcher (eds.), Plenum Press, pp. 85\u2013103, 1972.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"62_CR15","unstructured":"Levin, L.A., \u201dUniversal Search Problems\u201d, Problemy Peredaci Informacii 9, pp. 115\u2013116, 1973. Translated in problems of Information Transmission 9, pp. 265\u2013266."},{"key":"62_CR16","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A., \u201dHow to Share a Secret\u201d, CACM, Vol. 22, 1979, pp. 612\u2013613.","journal-title":"CACM"},{"key":"62_CR17","doi-asserted-by":"crossref","unstructured":"Yao, A.C., \u201dTheory and Applications of Trapdoor Functions\u201d, Proc. of the 23rd IEEE Symp. on Foundation of Computer Science, 1982, pp. 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016291.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:36:05Z","timestamp":1607549765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016291"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0016291","relation":{},"subject":[]}}