{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:49:25Z","timestamp":1770900565218,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540648925","type":"print"},{"value":"9783540684626","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055744","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T17:12:36Z","timestamp":1154020356000},"page":"408-423","source":"Crossref","is-referenced-by-count":94,"title":["On the existence of 3-round zero-knowledge protocols"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Hada","sequence":"first","affiliation":[]},{"given":"Toshiaki","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"29_CR1","unstructured":"M. Bellare and O. Goldreich, \u201cOn Defining Proofs of Knowledge,\u201d Proceedings of Crypto'92, 1992."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare, M. Jakobsson and M. Yung, \u201cRound-Optimal Zero-Knowledge Arguments Based on any One-Way Function,\u201d Proceedings of Eurocrypt' 97, 1997.","DOI":"10.1007\/3-540-69053-0_20"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, S. Micali and R. Ostrovsky, \u201cPerfect Zero-Knowledge in Constant Rounds,\u201d Proceedings of 22nd STOC, 1990.","DOI":"10.1145\/100216.100283"},{"key":"29_CR4","unstructured":"M. Blum, \u201cHow to Prove a Theorem So No One Else Can Claim It,\u201d Proceedings of the International Congress of Mathematicians, pp.1444\u20131451, 1986."},{"issue":"No.4","key":"29_CR5","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali, \u201cHow to Generate Cryptographically Strong Sequences of Pseudo-Random Bits,\u201d SIAM Journal on Computing, Vol.13, No.4, pp.850\u2013863, 1984.","journal-title":"SIAM Journal on Computing"},{"issue":"No.2","key":"29_CR6","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum and C. Cr\u00e9peau, \u201cMinimum Disclosure Proofs of Knowledge,\u201d Journal of Computer and System Sciences, Vol. 37, No. 2, pp. 156\u2013189, 1988.","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Cr\u00e9peau and M. Yung, \u201cEverything in NP Can Be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds,\u201d Proceedings of 16th ICALP, pp.123\u2013136, 1989.","DOI":"10.1007\/BFb0035756"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"G. Brassard and C. Cr\u00e9peau, \u201cNon-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond,\u201d Proceedings of 27th FOCS, 1986.","DOI":"10.1109\/SFCS.1986.33"},{"issue":"No.6","key":"29_CR9","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman, \u201cNew Directions in Cryptography,\u201d IEEE Trans. Inform. Theory, Vol.22, No.6, pp.644\u2013654, 1976.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat, and A. Shamir, \u201cZero Knowledge Proofs of Identity,\u201d Journal of Cryptology, Vol.1, pp.77\u201394, 1988.","journal-title":"Journal of Cryptology"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"U. Feige and A. Shamir, \u201cZero Knowledge Proofs of Knowledge in Two Rounds,\u201d Proceedings of Crypto'89, pp.526\u2013544, 1989.","DOI":"10.1007\/0-387-34805-0_46"},{"issue":"No.1","key":"29_CR12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02620230","volume":"6","author":"O. Goldreich","year":"1993","unstructured":"O. Goldreich, \u201cA Uniform-Complexity Treatment of Encryption and Zero-Knowledge,\u201d Journal of Cryptology, Vol.6, No. 1, pp.21\u201353, 1993.","journal-title":"Journal of Cryptology"},{"key":"29_CR13","unstructured":"O. Goldreich, \u201cFoundations of Cryptography (Fragments of a Book \u2014 Version 2.03),\u201d February 27, 1998."},{"key":"29_CR14","unstructured":"O. Goldreich, private communication, May 1998."},{"issue":"No.3","key":"29_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich and A. Kahan, \u201cHow to Construct Constant-Round Zero-Knowlege Proof Systems for NP,\u201d Journal of Cryptology, Vol.9, No. 3, pp.167\u2013190, 1996.","journal-title":"Journal of Cryptology"},{"issue":"No.1","key":"29_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich and H. Krawczyk, \u201cOn the Composition of Zero-Knowledge Proof Systems,\u201d SIAM Journal on Computing, Vol.25, No.1, pp.169\u2013192, 1996.","journal-title":"SIAM Journal on Computing"},{"issue":"No.1","key":"29_CR17","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, \u201cProofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems,\u201d Journal of the ACM, Vol.38, No.1, pp.691\u2013729, 1991.","journal-title":"Journal of the ACM"},{"issue":"No.1","key":"29_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O. Goldreich","year":"1994","unstructured":"O. Goldreich and Y. Oren, \u201cDefinitions and Properties of Zero-Knowlege Proof Systems,\u201d Journal of Cryptology, Vol.7, No. 1, pp.1\u201332, 1994.","journal-title":"Journal of Cryptology"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, \u201cThe Knowledge Complexity of Interactive Proofs,\u201d Proceedings of 17th STOC, pp.291\u2013304, 1985.","DOI":"10.1145\/22145.22178"},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M. O. Rabin","year":"1980","unstructured":"M. O. Rabin, \u201cProbabilistic Algorithm for Testing Primality,\u201d Jounal of Number Theory, Vol 12, pp.128\u2013138, 1980.","journal-title":"Jounal of Number Theory"},{"issue":"No.1","key":"29_CR21","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/0206006","volume":"6","author":"R. Solovay","year":"1977","unstructured":"R. Solovay and V. Strassen, \u201cA Fast Monte-Carlo Test for Primality,\u201d SIAM Journal on Computing, Vol.6, No.1, pp.84\u201386, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"M. Tompa and H. Woll, \u201cRandom Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information,\u201d Proceedings of 28th FOCS, pp.472\u2013482, 1987.","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO '98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055744","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T05:09:00Z","timestamp":1555736940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055744"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648925","9783540684626"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0055744","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}