{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T22:10:22Z","timestamp":1736287822372,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327318"},{"type":"electronic","value":"9783540327325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11681878_1","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T07:41:35Z","timestamp":1141112495000},"page":"1-20","source":"Crossref","is-referenced-by-count":20,"title":["Concurrent Zero Knowledge Without Complexity Assumptions"],"prefix":"10.1007","author":[{"given":"Daniele","family":"Micciancio","sequence":"first","affiliation":[]},{"given":"Shien Jin","family":"Ong","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]},{"given":"Salil","family":"Vadhan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Micciancio, D., Ong, S.J., Sahai, A., Vadhan, S.: Concurrent zero knowledge without complexity assumptions. Technical Report 05-093, Electronic Colloquium on Computational Complexity (2005), http:\/\/eccc.uni-trier.de\/eccc-reports\/2005\/TR05-093\/"},{"issue":"1","key":"1_CR2","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 on Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"1_CR3","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 Journal on Computing\u00a025(1), 169\u2013192 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: Proc. 30th STOC, pp. 409\u2013418 (1998)","DOI":"10.1145\/276698.276853"},{"issue":"1","key":"1_CR5","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM\u00a038(1), 691\u2013729 (1991)","journal-title":"Journal of the ACM"},{"key":"1_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of cryptography, vol.\u00a01. Cambridge University Press, Cambridge, UK (2001)"},{"key":"1_CR7","unstructured":"Goldreich, O.: Zero-knowledge twenty years after its invention (2002), http:\/\/www.wisdom.weizmann.ac.il\/~oded\/zk-tut02.html"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proc. 27th FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attack. In: Proc. 22nd STOC, pp. 427\u2013437 (1990)","DOI":"10.1145\/100216.100273"},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2001","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM Journal on Computing\u00a030(2), 391\u2013437 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosenciphertext security. In: Proc. 40th FOCS, pp. 543\u2013553 (1999)","DOI":"10.1109\/SFFCS.1999.814628"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. Journal of Cryptology\u00a01(2), 77\u201394 (1988)","journal-title":"Journal of Cryptology"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 13\u201325. Springer, Heidelberg (1998)"},{"key":"1_CR14","unstructured":"Elkind, E., Sahai, A.: A unified methodology for constructing public-key encryption schemes secure against adaptive chosen-ciphertext attack. Cryptology ePrint Archive, Report 2002\/042 (2002), http:\/\/eprint.iacr.org\/"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R. Cramer","year":"2004","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal on Computing\u00a033(1), 167\u2013226 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Micciancio, D., Rabin, T.: An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products. In: Proc. of the 5th ACM Conference on Computer and Communications Security, pp. 67\u201372 (1998)","DOI":"10.1145\/288090.288108"},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jcss.1999.1664","volume":"60","author":"T. Okamoto","year":"2000","unstructured":"Okamoto, T.: On relationships between statistical zero-knowledge proofs. Journal of Computer and System Sciences\u00a060(1), 47\u2013108 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Sahai, A., Vadhan, S.: Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge. In: Proc. 30th STOC, pp. 399\u2013408 (1998)","DOI":"10.1145\/276698.276852"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Vadhan, S.: An unconditional study of computational zero knowledge. In: Proc. 45th STOC, pp. 176\u2013185 (2004)","DOI":"10.1109\/FOCS.2004.13"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R.: One-way functions, hard on average problems, and statistical zeroknowledge proofs. In: Proceedings of the Sixth Annual Structure in Complexity Theory Conference (1991)","DOI":"10.1109\/SCT.1991.160253"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Wigderson, A.: One-way functions are essential for non-trivial zeroknowledge. In: Second Israel Symposium on Theory of Computing Systems, pp. 3\u201317 (1993)","DOI":"10.1109\/ISTCS.1993.253489"},{"key":"1_CR22","unstructured":"Feige, U.: Alternative models for zero knowledge interactive proofs. PhD thesis, Weizmann Institute of Science, Israel (1990)"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-48910-X_29","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. 415\u2013431. Springer, Heidelberg (1999)"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E., Rackoff, C.: Lower bounds for zero knowledge on the Internet. In: Proc. 39th FOCS, pp. 484\u2013492 (1998)","DOI":"10.1109\/SFCS.1998.743499"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in poly-logarithm rounds. In: Proc. 33rd STOC, pp. 560\u2013569 (2001)","DOI":"10.1145\/380752.380851"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-44598-6_28","volume-title":"Advances in Cryptology - 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)"},{"issue":"1","key":"1_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539701392949","volume":"32","author":"R. Canetti","year":"2003","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, R.: Black-box concurrent zeroknowledge requires (almost) logarithmically many rounds. SIAM Journal on Computing\u00a032(1), 1\u201347 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: Proc. 43rd FOCS, pp. 366\u2013375 (2002)","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: Proc. 42nd FOCS, pp. 106\u2013115 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-44968-X_42","volume-title":"Computing and Combinatorics","author":"G. Crescenzo Di","year":"2000","unstructured":"Di Crescenzo, G.: Removing complexity assumptions from concurrent zero-knowledge proofs. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol.\u00a01858, pp. 426\u2013435. Springer, Heidelberg (2000)"},{"key":"1_CR31","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)"},{"issue":"2","key":"1_CR32","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., Crepeau, C.: Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences\u00a037(2), 156\u2013189 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Sahai, A., Vadhan, S.: A complete problem for statistical zero knowledge. Journal of the ACM\u00a050(2) (2003)","DOI":"10.1145\/636865.636868"},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-45146-4_17","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"D. Micciancio","year":"2003","unstructured":"Micciancio, D., Vadhan, S.: Statistical zero-knowledge proofs with efficient provers: Lattice problems and more. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 282\u2013298. Springer, Heidelberg (2003)"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micali, S., Ostrovsky, R.: Perfect zero-knowledge in constant rounds. In: Proc. 22nd STOC, pp. 482\u2013493 (1990)","DOI":"10.1145\/100216.100283"},{"issue":"1","key":"1_CR36","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s001459900018","volume":"10","author":"T. Itoh","year":"1997","unstructured":"Itoh, T., Ohta, Y., Shizuya, H.: A language-dependent cryptographic primitive. Journal of Cryptology\u00a010(1), 37\u201349 (1997)","journal-title":"Journal of Cryptology"},{"key":"1_CR37","unstructured":"Rosen, A.: The Round-Complexity of Black-Box Concurrent Zero-Knowledge. PhD thesis, Weizmann Institute of Science, Israel (2003)"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/11426639_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M. Chase","year":"2005","unstructured":"Chase, M., Healy, A., Lysyanskaya, A., Malkin, T., Reyzin, L.: Mercurial commitments with applications to zero-knowledge sets. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 422\u2013439. Springer, Heidelberg (2005)"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M.O., Kilian, J.: Zero-knowledge sets. In: Proc. 44th FOCS, pp. 80\u201391 (2003)","DOI":"10.1109\/SFCS.2003.1238183"},{"issue":"2","key":"1_CR40","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. Journal of Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"issue":"4","key":"1_CR41","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. Hastad","year":"1999","unstructured":"Hastad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal on Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"1_CR42","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1006\/jcss.1999.1686","volume":"60","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O., Goldwasser, S.: On the limits of nonapproximability of lattice problems. Journal of Computer and System Sciences\u00a060(3), 540\u2013563 (2000)","journal-title":"Journal of Computer and System Sciences"},{"issue":"6","key":"1_CR43","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"Blum, M., De Santis, A., Micali, S., Persiano, G.: Noninteractive zero-knowledge. SIAM Journal on Computing\u00a020(6), 1084\u20131118 (1991)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"Aharonov, D., Regev, O.: Lattice problems in NP \u2229 coNP. In: Proc. 45th FOCS, pp. 362\u2013371 (2004)","DOI":"10.1109\/FOCS.2004.35"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11681878_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T21:55:01Z","timestamp":1736286901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11681878_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327318","9783540327325"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/11681878_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}