{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:12:34Z","timestamp":1725570754058},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642173721"},{"type":"electronic","value":"9783642173738"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17373-8_21","type":"book-chapter","created":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T15:22:55Z","timestamp":1291303375000},"page":"359-376","source":"Crossref","is-referenced-by-count":2,"title":["Optimistic Concurrent Zero Knowledge"],"prefix":"10.1007","author":[{"given":"Alon","family":"Rosen","sequence":"first","affiliation":[]},{"given":"Abhi","family":"Shelat","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BFb0054156","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"N. Asokan","year":"1998","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 591\u2013606. Springer, Heidelberg (1998)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: Proc. 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 106\u2013115 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"21_CR3","unstructured":"Blum, M.: How to prove a theorem so no one can claim it. In: Proc. of The International Congress of Mathematicians, pp. 1444\u20131451 (1986)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Security and composition of cryptographic protocols: A tutorial. Cryptology ePrint Archive, Report 2006\/465 (2006)","DOI":"10.1145\/1165555.1165570"},{"key":"21_CR5","first-page":"235","volume-title":"Proc. 32nd Annual ACM Symposium on Theory of Computing (STOC)","author":"R. Canetti","year":"2000","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zeroknowledge. In: Proc. 32nd Annual ACM Symposium on Theory of Computing (STOC), pp. 235\u2013244. ACM Press, New York (2000)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/3-540-45682-1_25","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"T. Cohen","year":"2001","unstructured":"Cohen, T., Kilian, J., Petrank, E.: Responsive round complexity and concurrent zero-knowledge. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 422\u2013441. Springer, Heidelberg (2001)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zeroknowledge requires omega(log n) rounds. In: STOC 2001, pp. 570\u2013579 (2001)","DOI":"10.1145\/380752.380852"},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539701392949","volume":"32","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zero-knowledge requires (almost) logarithmically many rounds. SIAM J. Comput.\u00a032(1), 1\u201347 (2002)","journal-title":"SIAM J. Comput."},{"key":"21_CR9","unstructured":"Damgard, I.: Concurrent zero-knowledge is easy in practice. Available online at Theory of Cryptography Library (June 1999)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero knowledge. In: Proc. 30th Annual ACM Symposium on Theory of Computing, STOC (1998)","DOI":"10.1145\/276698.276853"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Damg\u00e4ard, I., Pedersen, T., Pfitzmann, B.: On the existence of statistically hiding bit commitment schemes and fail-stop signatures. In: Crypto 1993, pp. 250\u2013265 (1993)","DOI":"10.1007\/3-540-48329-2_22"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","first-page":"105","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Sahai, A.: Concurrrent zero-knowledge: Reducing the need for timing constraints. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 105\u2013120. Springer, Heidelberg (1998)"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Concurrent zero-knowledge with timing, revisited. In: STOC 2002, pp. 332\u2013340 (2002)","DOI":"10.1145\/509907.509959"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in polylogarithm rounds. In: Proc. 33rd Annual ACM Symposium on Theory of Computing (STOC), pp. 560\u2013569 (2001)","DOI":"10.1145\/380752.380851"},{"key":"21_CR15","first-page":"484","volume-title":"FOCS 1998","author":"J. Kilian","year":"1998","unstructured":"Kilian, J., Petrank, E., Rackoff, C.: Lower bounds for zero knowledge on the internet. In: FOCS 1998, pp. 484\u2013492. IEEE, Los Alamitos (1998)"},{"key":"21_CR16","unstructured":"Lamport, L.: Fast paxos. Technical Report MSR-TR-2005-112, Microsoft Research (July 2005)"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/3-540-39200-9_9","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"D. Micciancio","year":"2003","unstructured":"Micciancio, D., Petrank, E.: Simulatable commitments and efficient concurrent zero-knowledge. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 140\u2013159. Springer, Heidelberg (2003)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: STOC 1989, pp. 33\u201343 (1989)","DOI":"10.1145\/73007.73011"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-39200-9_10","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Pass","year":"2003","unstructured":"Pass, R.: Simulation in quasi-polynomial time and its application to protocol composition. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 160\u2013176. Springer, Heidelberg (2003)"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-540-78967-3_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"O. Pandey","year":"2008","unstructured":"Pandey, O., Pass, R., Sahai, A., Tseng, W.-L.D., Venkitasubramaniam, M.: Precise concurrent zero knowledge. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 397\u2013414. Springer, Heidelberg (2008)"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero-knowledge with logarithmic round complexity. In: FOCS 2002, pp. 366\u2013375 (2002)","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Sahai, A.: New notions of security: achieving universal composability without trusted setup. In: Symposium on Theory of Computing (STOC), pp. 242\u2013251 (2004)","DOI":"10.1145\/1007352.1007394"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1007\/978-3-642-11799-2_31","volume-title":"TCC 2010","author":"R. Pass","year":"2010","unstructured":"Pass, R., Tseng, W.-L.D., Venkitasubramaniam, M.: Eye for an eye: Efficient concurrent zero-knowledge in the timing model. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 518\u2013534. Springer, Heidelberg (2010)"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/11523468_19","volume-title":"Automata, Languages and Programming","author":"G. Persiano","year":"2005","unstructured":"Persiano, G., Visconti, I.: Single-prover concurrent zero knowledge in almost constant rounds. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 228\u2013240. Springer, Heidelberg (2005)"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-540-78524-8_30","volume-title":"Theory of Cryptography","author":"R. Pass","year":"2008","unstructured":"Pass, R., Venkitasubramaniam, M.: On constant-round concurrent zero-knowledge. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 553\u2013570. Springer, Heidelberg (2008)"},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","first-page":"311","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Richardson","year":"1999","unstructured":"Richardson, R., Kilian, J.: On the concurrent composition of zero-knowledge proofs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 311\u2013326. Springer, Heidelberg (1999)"},{"key":"21_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-44598-6_28","volume-title":"CRYPTO 2000","author":"A. Rosen","year":"2000","unstructured":"Rosen, A.: A note on the round complexity of concurrent zero-knowledge. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 451\u2013468. Springer, Heidelberg (2000)"},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-540-24638-1_11","volume-title":"Theory of Cryptography","author":"A. Rosen","year":"2004","unstructured":"Rosen, A.: A note on constant round zero knowledge proofs for np. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 191\u2013202. Springer, Heidelberg (2004)"},{"key":"21_CR29","series-title":"Series on Information Security and Cryptography","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-32939-0","volume-title":"Concurrent Zero-Knowledge","author":"A. Rosen","year":"2006","unstructured":"Rosen, A.: Concurrent Zero-Knowledge. Series on Information Security and Cryptography. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17373-8_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:52:50Z","timestamp":1606186370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17373-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642173721","9783642173738"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17373-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}