{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T11:04:58Z","timestamp":1777287898701,"version":"3.51.4"},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540528261","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032038","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"268-282","source":"Crossref","is-referenced-by-count":43,"title":["On the composition of zero-knowledge proof systems"],"prefix":"10.1007","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L., \u201cTrading Group Theory for Randomness\u201d, Proc. 17th STOC, 1985, pp. 421\u2013429.","DOI":"10.1145\/22145.22192"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micali S. and Ostrovsky R., \"Perfect Zero-Knowledge in Constant Rounds\", to appear in Proc. 22nd STOC, 1990.","DOI":"10.1145\/100216.100283"},{"issue":"2","key":"22_CR3","first-page":"156","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., D. Chaum, and C. Cr\u00e9pau, \"Minimum Disclosure Proofs of knowledge\", JCSS, Vol. 37, No. 2, 1988, pp. 156\u2013189.","journal-title":"JCSS"},{"key":"22_CR4","unstructured":"Feige, U., M.Sc. Thesis, Weizmann Institute, 1987."},{"key":"22_CR5","unstructured":"Feige, U., and A. Shamir, \"Zero knowledge proofs of knowledge in two rounds\", Proceedings of Crypto89, 1989."},{"key":"22_CR6","series-title":"Technical Report","volume-title":"Sparse Pseudorandom Distributions","author":"G. O","year":"1989","unstructured":"Goldreich, O., and Krawczyk, H., \"Sparse Pseudorandom Distributions\", Crypto89. Extended version: Technical Report 553, Computer Science Dept., Technion, Haifa, 1989."},{"key":"22_CR7","unstructured":"Goldreich, O., and Kahan, A., \"Using Claw-Free Permutations to Construct Constant-Round Zero-Knowledge Proofs for NP\", in preparation, 1989."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O., S. Micali, and A. Wigderson, \"Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design\", Proc. 27th FOCS, 1986, pp. 174\u2013187. Submitted to J. of the ACM.","DOI":"10.1109\/SFCS.1986.47"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich, O., S. Micali, and A. Wigderson, \"How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority\", Proc. 19th STOC, 1987, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"issue":"2","key":"22_CR10","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., and S. Micali, \"Probabilistic Encryption\", JCSS, Vol. 28, No. 2, 1984, pp. 270\u2013299.","journal-title":"JCSS"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., S. Micali, and C. Rackoff, \"Knowledge Complexity of Interactive Proofs\", Proc. 17th STOC, 1985, pp. 291\u2013304.","DOI":"10.1145\/22145.22178"},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., S. Micali, and C. Rackoff, \"The Knowledge Complexity of Interactive Proof Systems\", SIAM Jour. on Computing, Vol. 18, 1989, pp. 186\u2013208.","journal-title":"SIAM Jour. on Computing"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., and M. Sipser, \u201cPrivate Coins vs. Public Coins in Interactive Proof Systems\u201d, Proc. 18th STOC, 1986, pp. 59\u201368.","DOI":"10.1145\/12130.12137"},{"issue":"1","key":"22_CR14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1214\/aop\/1176996762","volume":"2","author":"A. Joffe","year":"1974","unstructured":"A. Joffe, \"On a Set of Almost Deterministic k-Independent Random Variables\", the Annals of Probability, 1974, Vol. 2, No. 1, pp. 161\u2013162.","journal-title":"the Annals of Probability"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Oren, Y., \u201cOn the Cunning Power of Cheating Verifiers: Some Observations About Zero-Knowledge Proofs\u201d, Proc. of the 28th IEEE Symp. on Foundation of Computer Science, 1987, pp. 462\u2013471.","DOI":"10.1109\/SFCS.1987.43"},{"key":"22_CR16","unstructured":"Simon, D., M.Sc. Thesis, University of Toronto, 1989."},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Tompa, M., and H. Woll, \u201cRandom Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information\u201d, Proc. of the 28th IEEE Symp. on Foundation of Computer Science, 1987, pp. 472\u2013482.","DOI":"10.1109\/SFCS.1987.49"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Yao, A.C., \u201cHow to Generate and Exchange Secrets\u201d, Proc. 27th FOCS, pp. 162\u2013167, 1986.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:45:24Z","timestamp":1586612724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0032038","relation":{},"subject":[]}}