{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T18:40:05Z","timestamp":1747161605168,"version":"3.40.5"},"reference-count":82,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,11,11]],"date-time":"2014-11-11T00:00:00Z","timestamp":1415664000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s00145-014-9191-z","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T12:17:09Z","timestamp":1415967429000},"page":"156-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Concurrent Knowledge Extraction in Public-Key Models"],"prefix":"10.1007","volume":"29","author":[{"given":"Andrew Chi-Chih","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunlei","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,11]]},"reference":[{"key":"9191_CR1","doi-asserted-by":"crossref","unstructured":"B. Barak. How to Go Beyond the Black-Box Simulation Barrier. In IEEE Symposium on Foundations of Computer Science, pages 106\u2013115, 2001.","DOI":"10.1109\/SFCS.2001.959885"},{"key":"9191_CR2","doi-asserted-by":"crossref","unstructured":"B. Barak, R. Canetti, J. B. Nielsen and R. Pass. UniversallyComposable Protocols with Relaxed Set-Up Assumptions. In IEEESymposium on Foundations of Computer Science, pages 186\u2013195, 2004.","DOI":"10.1109\/FOCS.2004.71"},{"key":"9191_CR3","doi-asserted-by":"crossref","unstructured":"B. Barak and O. Goldreich. Universal Arguments and Their Applications. In IEEE Conference on Computational Complexity, pages 194\u2013203, 2002.","DOI":"10.1109\/CCC.2002.1004355"},{"key":"9191_CR4","doi-asserted-by":"crossref","unstructured":"B. Barak, O. Goldreich, S. Goldwasser and Y. Lindell. Resettably-Sound Zero-Knowledge and Its Applications. In IEEE Symposium on Foundations of Computer Science, pages 116\u2013125, 2001.","DOI":"10.1109\/SFCS.2001.959886"},{"key":"9191_CR5","doi-asserted-by":"crossref","unstructured":"B. Barak and Y. Lindell. Strict Polynomial-Time in Simulation andExtraction. SIAM Journal on Computing, 33(4): 783\u2013818, 2004.","DOI":"10.1137\/S0097539703427975"},{"key":"9191_CR6","doi-asserted-by":"crossref","unstructured":"B. Barak, Y. Lindell and S, Vadhan. Lower Bounds for Non-Black-Box Zero-Knowledge. Journal of Computer and System Sciences, 72(2): 321\u2013391, 2006.","DOI":"10.1016\/j.jcss.2005.06.010"},{"key":"9191_CR7","doi-asserted-by":"crossref","unstructured":"B. Barak, M. Prabhakaran, and A. Sahai. Concurrent Non-Malleable Zero-Knowledge. FOCS 2006: 345\u2013354.","DOI":"10.1109\/FOCS.2006.21"},{"key":"9191_CR8","doi-asserted-by":"crossref","unstructured":"M. Bellare and O. Goldreich. On Defining Proofs of Knowledge In E. F. Brickell (Ed.): Advances in Cryptology-Proceedings of CRYPTO 1992, LNCS 740, pages 390\u2013420, Springer-Verlag, 1992.","DOI":"10.1007\/3-540-48071-4_28"},{"key":"9191_CR9","doi-asserted-by":"crossref","unstructured":"M. Bellare and O. Goldreich. On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge. Electronic Colloquium on Computational Complexity, 13(136), 2006. A slightly refined version also appears in [47], pages 114\u2013123, 2011.","DOI":"10.1007\/978-3-642-22670-0_14"},{"key":"9191_CR10","doi-asserted-by":"crossref","unstructured":"M. Bellare, R. Impagliazzo and M. Naor. Does Parallel RepetitionLower the Error in Computationally Sound Protocols? In IEEESymposium on Foundations of Computer Science, pages 374\u2013383, 1997.","DOI":"10.1109\/SFCS.1997.646126"},{"key":"9191_CR11","unstructured":"M. Blum. Coin Flipping by Telephone. In proc. IEEE Spring COMPCOM, pages 133\u2013137, 1982."},{"key":"9191_CR12","unstructured":"M. Blum. How to Prove a Theorem so No One Else can Claim It. InProceedings of the International Congress of Mathematicians,Berkeley, California, USA, 1986, pp. 1444\u20131451."},{"key":"9191_CR13","doi-asserted-by":"crossref","unstructured":"D. Boneh and R. Venkatesan. Breaking RSA may not be equivalent to factoring. Eurocrypt 1998: 59\u201371.","DOI":"10.1007\/BFb0054117"},{"key":"9191_CR14","doi-asserted-by":"crossref","unstructured":"G. Brassard, D. Chaum and C. Crepeau. Minimum Disclosure Proofsof Knowledge. Journal of Computer Systems and Science, 37(2):156\u2013189, 1988.","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"9191_CR15","doi-asserted-by":"crossref","unstructured":"R. Canetti, O. Goldreich, S. Goldwasser and S. Micali. Resettable Zero-Knowledge. In ACM Symposium on Theory of Computing, pp. 235\u2013244, 2000. Available from: http:\/\/www.wisdom.weizmann.ac.il\/~oded\/","DOI":"10.1145\/335305.335334"},{"key":"9191_CR16","doi-asserted-by":"crossref","unstructured":"R. Canetti, J. Kilian, E. Petrank and A. Rosen. Black-BoxConcurrent Zero-Knowledge Requires (Almost) Logarithmically ManyRounds. In SIAM Journal on Computing, 32(1): 1\u201347, 2002.","DOI":"10.1137\/S0097539701392949"},{"key":"9191_CR17","doi-asserted-by":"crossref","unstructured":"C. Cho, R. Ostrovsky, A. Scafuro and I. Visconti. Simultaneously Resettable Arguments of Knowledge. TCC 2012: 530\u2013547.","DOI":"10.1007\/978-3-642-28914-9_30"},{"key":"9191_CR18","doi-asserted-by":"crossref","unstructured":"K. M. Chung, R. Ostrovsky, R. Pass, M. Venkitasubramaniam and I. Visconti. 4-Round Resettably-Sound Zero Knowledge. TCC 2014: 192\u2013216.","DOI":"10.1007\/978-3-642-54242-8_9"},{"key":"9191_CR19","unstructured":"R. Cramer. Modular Design of Secure, yet Practical Cryptographic Protocols, PhD Thesis, University of Amsterdam, 1996."},{"key":"9191_CR20","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damgard and B. Schoenmakers. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In Y. Desmedt (Ed.): Advances in Cryptology-Proceedings of CRYPTO 1994, LNCS 893, pages 174\u2013187. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-48658-5_19"},{"key":"9191_CR21","doi-asserted-by":"crossref","unstructured":"I. Damgard. Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In B. Preneel (Ed.): Advances in Cryptology-Proceedings of Eurocrypt 2000, LNCS 1807, pages 418\u2013430. Springer-Verlag, 2000.","DOI":"10.1007\/3-540-45539-6_30"},{"key":"9191_CR22","unstructured":"I. Damgard. Lecture Notes on Cryptographic Protocol Theory. BRICS, Aarhus University, 2003. Available from: http:\/\/www.daimi.au.dk\/~ivan\/CPT.html"},{"key":"9191_CR23","doi-asserted-by":"crossref","unstructured":"I. Damgard, T. Pedersen and B. Pfitzmann. On the Existence of Statistically-Hiding Bit Commitment and Fail-Stop Signatures. In CRYPTO 1993: 250\u2013265.","DOI":"10.1007\/3-540-48329-2_22"},{"key":"9191_CR24","doi-asserted-by":"crossref","unstructured":"Y. Deng and D. Lin. Resettable Zero Knowledge in the Bare Public Key Model under Standard Assumption. Inscrypt 2007, pages 123\u2013137.","DOI":"10.1007\/978-3-540-79499-8_11"},{"key":"9191_CR25","doi-asserted-by":"crossref","unstructured":"Y. Deng, D. Feng, V. Goyal, D. Lin, A. Sahai and M. Yung. Resettable Cryptography in Constant Rounds: the Case of Zero Knowledge. Asiacrypt 2011, pages 390\u2013406. Available also from Cryptology ePrint Archive, Report No. 2011\/408.","DOI":"10.1007\/978-3-642-25385-0_21"},{"key":"9191_CR26","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo and R. Ostrovsky. On Concurrent Zero-Knowledge with Pre-Processing. In M. J. Wiener (Ed.): Advances in Cryptology-Proceedings of CRYPTO 1999, LNCS 1666, pages 485\u2013502. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48405-1_31"},{"key":"9191_CR27","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo, G. Persiano and I. Visconti. Constant-Round Resettable Zero-Knowledge with Concurrent Soundness in the Bare Public Key Model. In M. Franklin (Ed.): Advances in Cryptology-Proceedings of CRYPTO 2004, LNCS 3152, pages 237\u2013253. Springer-Verlag, 2004.","DOI":"10.1007\/978-3-540-28628-8_15"},{"key":"9191_CR28","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo and I. Visconti. Concurrent Zero-Knowledge in the Public Key Model. In L. Caires et al. (Ed.): ICALP 2005, LNCS 3580, pages 816\u2013827. Springer-Verlag, 2005.","DOI":"10.1007\/11523468_66"},{"key":"9191_CR29","unstructured":"G. Di Crescenzo and I. Visconti. Personal communications, 2004."},{"key":"9191_CR30","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo and I. Visconti. On Defining Proofs of Knowledge in the Bare Public Key Model. In Italian Conference on Theoretical Computer Science (ICTCS), 2007.","DOI":"10.1142\/9789812770998_0020"},{"key":"9191_CR31","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork and M. Naor. Non-Malleable Cryptography. SIAM Journal on Computing, 30(2): 391\u2013437, 2000. Preliminary version in ACM Symposium on Theory of Computing, pages 542\u2013552, 1991.","DOI":"10.1137\/S0097539795291562"},{"key":"9191_CR32","doi-asserted-by":"crossref","unstructured":"C. Dwork, M. Naor and A. Sahai. Concurrent Zero-Knowledge. In ACM Symposium on Theory of Computing, pages 409\u2013418, 1998.","DOI":"10.1145\/276698.276853"},{"key":"9191_CR33","unstructured":"C. Dwork and A. Sahai. Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. In H. Krawczyk (Ed.): Advances in Cryptology-Proceedings of CRYPTO 1998, LNCS 1462, pages 442\u2013457. Springer-Verlag, 1998."},{"key":"9191_CR34","doi-asserted-by":"crossref","unstructured":"T. El Gamal. A Public Key Cryptosystem and Signature Scheme Basedon Discrete Logarithms. IEEE Transactions on InformationTheory, 31: 469\u2013472, 1985.","DOI":"10.1109\/TIT.1985.1057074"},{"key":"9191_CR35","unstructured":"U. Feige. Alternative Models for Zero-Knowledge Interactive Proofs. Ph.D Thesis, Weizmann Institute of Science, 1990."},{"key":"9191_CR36","doi-asserted-by":"crossref","unstructured":"U. Feige and Shamir. Zero-Knowledge Proofs of Knowledge in Two Rounds. In G. Brassard (Ed.): Advances in Cryptology-Proceedings of CRYPTO 1989, LNCS 435, pages 526\u2013544. Springer-Verlag, 1989.","DOI":"10.1007\/0-387-34805-0_46"},{"key":"9191_CR37","doi-asserted-by":"crossref","unstructured":"U. Feige and A. Shamir. Witness Indistinguishability and WitnessHiding Protocols. In ACM Symposium on the Theory ofComputing, pages 416\u2013426, 1990.","DOI":"10.1145\/100216.100272"},{"key":"9191_CR38","doi-asserted-by":"crossref","unstructured":"O. Goldreich. Foundation of Cryptography-Basic Tools. Cambridge University Press, 2001.","DOI":"10.1017\/CBO9780511546891"},{"key":"9191_CR39","unstructured":"O. Goldreich. Foundations of Cryptography-Basic Applications. Cambridge University Press, 2002."},{"key":"9191_CR40","unstructured":"O. Goldreich. Studies in Complexity and Cryptography. LNCS 6650, Springer-Verlag, 2011."},{"key":"9191_CR41","unstructured":"O. Goldreich. Strong Proofs of Knowledge. Pages 55\u201359 in [47]."},{"key":"9191_CR42","doi-asserted-by":"crossref","unstructured":"O. Goldreich and A. Kahan. How to Construct Constant-Round Zero-Knowledge Proof Systems for $$\\cal NP$$ NP . Journal of Cryptology, 9(2): 167\u2013189, 1996.","DOI":"10.1007\/s001459900010"},{"issue":"1","key":"9191_CR43","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O Goldreich","year":"1996","unstructured":"O. Goldreich and H. Krawczyk. On the Composition of Zero-Knowledge Proof Systems. SIMA Journal on Computing, 25(1): 169\u2013192, 1996.","journal-title":"SIMA Journal on Computing"},{"key":"9191_CR44","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design. In IEEE Symposium on Foundations of Computer Science, pages 174\u2013187, 1986.","DOI":"10.1109\/SFCS.1986.47"},{"key":"9191_CR45","unstructured":"O. Goldreich, S. Micali and A. Wigderson. How to Prove all $$\\cal NP$$ NP -Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design. In A. M. Odlyzko (Ed.): Advances in Cryptology-Proceedings of CRYPTO 1986, LNCS 263, pages 104\u2013110, Springer-Verlag, 1986."},{"key":"9191_CR46","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson. How to Play any Mental Game-A Completeness Theorem for Protocols with Honest Majority. In ACM Symposium on Theory of Computing, pages 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"9191_CR47","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing But Their Validity or All languages in $$\\cal NP$$ NP Have Zero-Knowledge Proof Systems. Journal of the Association for Computing Machinery, 38(1): 691\u2013729, 1991. Preliminary version appears in [51, 52].","DOI":"10.1145\/116825.116852"},{"key":"9191_CR48","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof-Systems In ACM Symposium on Theory of Computing, pages 291\u2013304, 1985.","DOI":"10.1145\/22145.22178"},{"issue":"2","key":"9191_CR49","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali and R. L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks. SIAM Journal on Computing, 17(2): 281\u2013308, 1988.","journal-title":"SIAM Journal on Computing"},{"key":"9191_CR50","doi-asserted-by":"crossref","unstructured":"V. Goyal, A. Jain, R. Ostrovsky, S. Richelson and I. Visconti. Concurrent Zero Knowledge in the Bounded Player Model. TCC 2013: 60\u201379.","DOI":"10.1007\/978-3-642-36594-2_4"},{"key":"9191_CR51","doi-asserted-by":"crossref","unstructured":"V. Goyal, A. Jain, R. Ostrovsky, S. Richelson and I. Visconti. Constant-Round Concurrent Zero Knowledge in the Bounded Player Model. Asiacrypt 2013: 21\u201340.","DOI":"10.1007\/978-3-642-42033-7_2"},{"key":"9191_CR52","doi-asserted-by":"crossref","unstructured":"L. Guillou and J. J. Quisquater. A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing both Transmission and Memory. In C. G. Gnther (Ed.): Advances in Cryptology-Proceedings of Eurocrypt 1988, LNCS 330, pages 123\u2013128, Springer-Verlag, 1988.","DOI":"10.1007\/3-540-45961-8_11"},{"issue":"4","key":"9191_CR53","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J Hastad","year":"1999","unstructured":"J. Hastad, R. Impagliazzo, L. A. Levin and M. Luby. Construction of a Pseudorandom Generator from Any One-Way Function SIAM Journal on Computing, 28(4): 1364\u20131396, 1999.","journal-title":"SIAM Journal on Computing"},{"key":"9191_CR54","doi-asserted-by":"crossref","unstructured":"H. Hastad, R. Pass, D. Wikstrom and K. Pietrzak. An Efficient Parallel Repetition Theorem. In TCC 2010, pages 1\u201318, 2010.","DOI":"10.1007\/978-3-642-11799-2_1"},{"key":"9191_CR55","doi-asserted-by":"crossref","unstructured":"I. Haitner and O. Reingold. Statistically-Hiding Commitment from Any One-Way Function. STOC 2007: 1\u201310.","DOI":"10.1145\/1250790.1250792"},{"key":"9191_CR56","doi-asserted-by":"crossref","unstructured":"I. Haitner, O. Horvitz, J. Katz, C. Koo, R. Morselli and R. Shaltiel. Reducing Complexity Assumptions for Statistically-Hiding Commitments. In Eurocrypt 2005: 58\u201377.","DOI":"10.1007\/11426639_4"},{"key":"9191_CR57","doi-asserted-by":"crossref","unstructured":"S. Halevi and S. Micali. Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing. In CRYPTO 1996: 201\u2013215.","DOI":"10.1007\/3-540-68697-5_16"},{"key":"9191_CR58","doi-asserted-by":"crossref","unstructured":"J. Kilian and E. Petrank. Concurrent and resettable zero-knowledge in polyloalgorithm rounds. In STOC, pages 560\u2013569, 2001.","DOI":"10.1145\/380752.380851"},{"key":"9191_CR59","doi-asserted-by":"crossref","unstructured":"D. Lapidot and A. Shamir. Publicly-Verifiable Non-Interactive Zero-Knowledge Proofs. In A.J. Menezes and S. A. Vanstone (Ed.): Advances in Cryptology-Proceedings of CRYPTO 1990, LNCS 537, pages 353\u2013365.","DOI":"10.1007\/3-540-38424-3_26"},{"key":"9191_CR60","doi-asserted-by":"crossref","unstructured":"H. Lin and R. Pass. Constant-Round Non-Malleable Commitments from Any One-Way Function. STOC 2011: 705\u2013714.","DOI":"10.1145\/1993636.1993730"},{"key":"9191_CR61","doi-asserted-by":"crossref","unstructured":"Y. Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. Journal of Cryptology, 16(3): 143\u2013184, 2003. Preliminary version appeared in CRYPTO 2001.","DOI":"10.1007\/s00145-002-0143-7"},{"key":"9191_CR62","unstructured":"Y. Lindell. Constant-Round Zero-Knowledge Proof of Knowledge. ECCC Report No. 2011\/003."},{"key":"9191_CR63","doi-asserted-by":"crossref","unstructured":"D. Micciancio and E. Petrank. Simulatable Commitments and Efficient Concurrent Zero-Knowledge. In E. Biham (Ed.): Advances in Cryptology-Proceedings of Eurocrypt 2003, LNCS 2656, pages 140\u2013159. Springer-Verlag, 2003.","DOI":"10.1007\/3-540-39200-9_9"},{"key":"9191_CR64","doi-asserted-by":"crossref","unstructured":"S. Micali and L. Reyzin. Soundness in the Public Key Model. In J. Kilian (Ed.): Advances in Cryptology-Proceedings of CRYPTO 2001, LNCS 2139, pages 542\u2013565. Springer-Verlag, 2001.","DOI":"10.1007\/3-540-44647-8_32"},{"issue":"2","key":"9191_CR65","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"M. Naor. Bit Commitment Using Pseudorandomness. Journal of Cryptology, 4(2): 151\u2013158, 1991.","journal-title":"Journal of Cryptology"},{"issue":"2","key":"9191_CR66","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M Naor","year":"1998","unstructured":"M. Naor, R. Ostrovsky, R. Venkatesan and M. Yung. Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation. Journal of Cryptology, 11(2): 87\u2013108, 1998.","journal-title":"Journal of Cryptology"},{"key":"9191_CR67","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung. Public Key Cryptosystems Provably Secure Against Chosen Ciphertext Attacks. In ACM Symposium on Theory of Computing, pages 427\u2013437, 1990.","DOI":"10.1145\/100216.100273"},{"key":"9191_CR68","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky, G. Persiano and I. Visconti. Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public Key Model. ICALP(2) 2008, LNCS 5126, pages 548\u2013559, 2008. Full version available from ECCC Report No. 2006\/095.","DOI":"10.1007\/978-3-540-70583-3_45"},{"key":"9191_CR69","unstructured":"R. Pass, W.-L. Dustin Tseng, and M. Venkitasubramaniam: Concurrent Zero Knowledge, Revisited. Journal of Cryptology, 27(1): 45\u201366, 2014."},{"key":"9191_CR70","doi-asserted-by":"crossref","unstructured":"R. Pass and A. Rosen. Concurrent Non-Malleable Commitments. SIAM Journal on Computing, 37(6): 1891\u20131925 (2008). Preliminary version appears in In IEEE Symposium on Foundations of Computer Science, pages 563\u2013572, 2005.","DOI":"10.1109\/SFCS.2005.27"},{"key":"9191_CR71","doi-asserted-by":"crossref","unstructured":"R. Pass and M. Venkitasubramaniam. An Efficient Parallel Repetition Theorem for Arthur-Merlin Games. In ACM Symposium on Theory of Computing, pages 420\u2013429, 2007.","DOI":"10.1145\/1250790.1250853"},{"key":"9191_CR72","doi-asserted-by":"crossref","unstructured":"M. Prabhakaran, A. Rosen and A. Sahai. Concurrent zero knowledge with logarithmic round-complexity. In FOCS, pages 366\u2013375, 2002.","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"9191_CR73","doi-asserted-by":"crossref","unstructured":"R. Richardson and J. Kilian. On the concurrent composition of zero-knowledge proofs. In Eurocrypt, pages 415\u2013432, 1999.","DOI":"10.1007\/3-540-48910-X_29"},{"key":"9191_CR74","doi-asserted-by":"crossref","unstructured":"P. Rogaway. Formalizing Human Ignorance: Collision-Resistant Hashing without the Keys. Vietcrypt 2006, LNCS 4341, pages 221\u2013228.","DOI":"10.1007\/11958239_14"},{"key":"9191_CR75","doi-asserted-by":"crossref","unstructured":"A. Scafuro and I. Visconti. On Round-Optimal Zero Knowledge in the Bare Public Key Model. Eurocrypt 2012, LNCS 7237, pages 153\u2013171.","DOI":"10.1007\/978-3-642-29011-4_11"},{"issue":"3","key":"9191_CR76","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/BF00196725","volume":"4","author":"C Schnorr","year":"1991","unstructured":"C. Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology, 4(3): 24, 1991.","journal-title":"Journal of Cryptology"},{"key":"9191_CR77","doi-asserted-by":"crossref","unstructured":"I. Visconti. Efficient Zero Knowledge on the Internet. ICALP 2006, LNCS 4052, pages 22\u201333, Springer-Verlag.","DOI":"10.1007\/11787006_3"},{"key":"9191_CR78","doi-asserted-by":"crossref","unstructured":"A. C. Yao. How to Generate and Exchange Secrets. In IEEE Symposium on Foundations of Computer Science, pages 162\u2013167, 1986.","DOI":"10.1109\/SFCS.1986.25"},{"key":"9191_CR79","doi-asserted-by":"crossref","unstructured":"A. Yao, M. Yung and Y. Zhao. Concurrent Knowledge Extraction in the Public Key Model. ICALP 2010, Part I, LNCS 6198, pages 702\u2013714, 2010. Preliminary version appears in Electronic Colloquium on Computational Complexity (ECCC), Report No. 2007\/002.","DOI":"10.1007\/978-3-642-14165-2_59"},{"key":"9191_CR80","doi-asserted-by":"crossref","unstructured":"M. Yung and Y. Zhao. Generic and practical resettable zero-knowledge in the bare public key model. In M. Naor (Ed.): Advances in Cryptology-Proceedings of Eurocrypt 2007, LNCS 4515, pages 116\u2013134, Springer-Verlag, 2007. Preliminary version appears in ECCC Report No. 2005\/048.","DOI":"10.1007\/978-3-540-72540-4_8"},{"key":"9191_CR81","doi-asserted-by":"crossref","unstructured":"M. Yung and Y. Zhao. Interactive Zero-Knowledge with Restricted Random Oracles. In S. Halevi and T. Rabin (Ed.): Theory of Cryptography (TCC) 2006, LNCS 3876, pages 21\u201340, Springer-Verlag, 2006.","DOI":"10.1007\/11681878_2"},{"key":"9191_CR82","unstructured":"Y. Zhao. Concurrent\/Resettable Zero-Knowledge With Concurrent Soundness in the Bare Public Key Model and Its Applications. Cryptology ePrint Archive, Report 2003\/265."}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-014-9191-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-014-9191-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-014-9191-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-014-9191-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T17:59:39Z","timestamp":1747159179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-014-9191-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,11]]},"references-count":82,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9191"],"URL":"https:\/\/doi.org\/10.1007\/s00145-014-9191-z","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2014,11,11]]},"assertion":[{"value":"28 September 2011","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2014","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}