{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:49:28Z","timestamp":1770900568309,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540226680","type":"print"},{"value":"9783540286288","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28628-8_17","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T20:54:02Z","timestamp":1285016042000},"page":"273-289","source":"Crossref","is-referenced-by-count":145,"title":["The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols"],"prefix":"10.1007","author":[{"given":"Mihir","family":"Bellare","sequence":"first","affiliation":[]},{"given":"Adriana","family":"Palacio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"Proceedings of the 42nd Symposium on Foundations of Computer Science","author":"B. Barak","year":"2001","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: Proceedings of the 42nd Symposium on Foundations of Computer Science, IEEE, Los Alamitos (2001)"},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00145-002-0116-x","volume":"15","author":"M. Bellare","year":"2002","unstructured":"Bellare, M.: A note on negligible functions. Journal of Cryptology\u00a015(4), 271\u2013284 (2002)","journal-title":"Journal of Cryptology"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/0-387-34805-0_48","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"M. Bellare","year":"1990","unstructured":"Bellare, M., Micali, S.: Non-interactive oblivious transfer and applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 547\u2013557. Springer, Heidelberg (1990)"},{"key":"17_CR4","unstructured":"Bellare, M., Palacio, A.: The Knowledge-of-Exponent assumptions and 3-round zero-knowledge protocols. Full version of the current paper, available via, \n                    \n                      http:\/\/www-cse.ucsd.edu\/users\/mihir"},{"key":"17_CR5","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444\u20131451 (1986)"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. J. Computer and System Sciences\u00a037(2), 156\u2013189 (1988)","journal-title":"J. Computer and System Sciences"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/3-540-46766-1_36","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"I. Damg\u00e5rd","year":"1992","unstructured":"Damg\u00e5rd, I.: Towards practical public-key cryptosystems provably-secure against chosen-ciphertext attacks. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 445\u2013456. Springer, Heidelberg (1992)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Krawczyk, H.: On the Composition of Zero Knowledge Proof Systems. SIAM J. on Computing\u00a025(1), 169\u2013192 (1996)","journal-title":"SIAM J. on Computing"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal of Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal of Computing"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/BFb0055744","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"S. Hada","year":"1998","unstructured":"Hada, S., Tanaka, T.: On the existence of 3-round zero-knowledge protocols. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, p. 408. Springer, Heidelberg (1998) [Preliminary version of [12].]"},{"key":"17_CR12","unstructured":"Hada, S., Tanaka, T.: On the existence of 3-round zero-knowledge protocols. Cryptology ePrint Archive: Report 1999\/009 (March 1999), \n                    \n                      http:\/\/eprint.iacr.org\/1999\/009\/\n                    \n                    \n                   [Final version of [11].]"},{"key":"17_CR13","unstructured":"Lepinski, M.: On the existence of 3-round zero-knowledge proofs. SM Thesis, MIT (June 2002), \n                    \n                      http:\/\/theory.lcs.mit.edu\/~cis\/theses\/lepinski-masters.ps"},{"key":"17_CR14","unstructured":"Lepinski, M., Micali, S.: On the existence of 3-round zero-knowledge proof systems. MIT LCS Technical Memo. 616 (April 2001), \n                    \n                      http:\/\/www.lcs.mit.edu\/publications\/pubs\/pdf\/MIT-LCS-TM-616.pdf"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-45146-4_6","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"M. Naor","year":"2003","unstructured":"Naor, M.: On cryptographic assumptions and challenges. Invited paper and talk. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 96\u2013109. Springer, Heidelberg (2003)"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/3-540-48071-4_17","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"K. Sakurai","year":"1993","unstructured":"Sakurai, K., Itoh, T.: On the discrepancy between serial and parallel of zeroknowledge protocols. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 246\u2013259. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28628-8_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:27:41Z","timestamp":1620012461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28628-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226680","9783540286288"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28628-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}