{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:01:48Z","timestamp":1778292108116,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540281146","type":"print"},{"value":"9783540318705","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11535218_8","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T18:20:34Z","timestamp":1292869234000},"page":"118-134","source":"Crossref","is-referenced-by-count":27,"title":["Unconditional Characterizations of Non-interactive Zero-Knowledge"],"prefix":"10.1007","author":[{"given":"Rafael","family":"Pass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"abhi","family":"shelat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0022-0000(91)90006-Q","volume":"42","author":"W. Aiello","year":"1991","unstructured":"Aiello, W., H\u00e5stad, J.: Statistical zero-knowledge languages can be recognized in two rounds. J. Comput. Syst. Sci.\u00a042, 327\u2013345 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-4068(74)90037-8","volume":"1","author":"R. Aumann","year":"1974","unstructured":"Aumann, R.: Subjectivity and correlation in randomized strategies. J. Math. Econ.\u00a01, 67\u201396 (1974)","journal-title":"J. Math. Econ."},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L. Babai","year":"1988","unstructured":"Babai, L., Moran, S.: Arthur-merlin games: A randomized proof system, and a hierarchy of complexity classes. J. Comput. Syst. Sci.\u00a036(2), 254\u2013276 (1988)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"8_CR4","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 J. Computing\u00a020(6), 1084\u20131118 (1991)","journal-title":"SIAM J. Computing"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In: STOC 1988, pp. 103\u2013112 (1988)","DOI":"10.1145\/62212.62222"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R. Boppana","year":"1987","unstructured":"Boppana, R., H\u00e5stad, J., Zachos, S.: Does co-NP have short interactive proofs? Inf. Process. Lett.\u00a025(2), 127\u2013132 (1987)","journal-title":"Inf. Process. Lett."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC 2002, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24638-1_13","volume-title":"Theory of Cryptography","author":"R. Cramer","year":"2004","unstructured":"Cramer, R., Damg\u00e5rd, I.: Secret-key zero-knowledge and non-interactive verifiable exponentiation. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 223\u2013237. Springer, Heidelberg (2004)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/3-540-47555-9_28","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"I. Damg\u00e5rd","year":"1993","unstructured":"Damg\u00e5rd, I.: Non-interactive circuit based proofs and non-interactive perfect zero knowledge with preprocessing. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 341\u2013355. Springer, Heidelberg (1993)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-45539-6_30","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"I. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.: Efficient concurrent zero-knowledge in the auxiliary string model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 418\u2013430. Springer, Heidelberg (2000)"},{"key":"8_CR11","unstructured":"Damg\u00e5rd, I., Fazio, N., Nicolosi, A.: Secret-key zero-knowledge protocols for NP and applications to threshold cryptography. Manuscript (2005)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-44647-8_33","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"A. Santis De","year":"2001","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 566\u2013598. Springer, Heidelberg (2001)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/BFb0055102","volume-title":"Automata, Languages and Programming","author":"A. Santis De","year":"1998","unstructured":"De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: Image density is complete for non-interactive-SZK. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 784\u2013795. Springer, Heidelberg (1998)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","first-page":"269","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"A. Santis De","year":"1988","unstructured":"De Santis, A., Micali, S., Persiano, G.: Non-interactive zero-knowledge with preprocessing. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 269\u2013282. Springer, Heidelberg (1988)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs based on a single random string. In: FOCS 1990, pp. 308\u2013317 (1990)","DOI":"10.1109\/FSCS.1990.89549"},{"key":"8_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: CCS 1998, pp. 67\u201372 (1998)","DOI":"10.1145\/288090.288108"},{"issue":"6","key":"8_CR17","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(90)90010-U","volume":"34","author":"O. Goldreich","year":"1990","unstructured":"Goldreich, O.: A note on computational indistinguishability. Inf. Process. Lett.\u00a034(6), 277\u2013281 (1990)","journal-title":"Inf. Process. Lett."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography, vol.\u00a0I (2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography, vol.\u00a0II (2004)","DOI":"10.1017\/CBO9780511721656"},{"issue":"1","key":"8_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O. Goldreich","year":"1994","unstructured":"Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. J. Crypt.\u00a07(1), 1\u201332 (1994)","journal-title":"J. Crypt."},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/3-540-48405-1_30","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"O. Goldreich","year":"1999","unstructured":"Goldreich, O., Sahai, A., Vadhan, S.: Can statistical zero knowledge be made non-interactive? or on the relationship of SZK and NISZK. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 467\u2013484. Springer, Heidelberg (1999)"},{"key":"8_CR22","unstructured":"Goldreich, O., Vadhan, S.: Comparing entropies in statistical zero-knowledge with applications to the structure of SZK. In: Computational Complexity (1998)"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: STOC 1985, pp. 291\u2013304 (1985)","DOI":"10.1145\/22145.22178"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. In: STOC 1986, pp. 59\u201368 (1986)","DOI":"10.1145\/12130.12137"},{"issue":"4","key":"8_CR25","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput.\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC 1988, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Kilian, J., Micali, S., Ostrovsky, R.: Minimum resource zero-knowledge proofs. In: FOCS 1989, pp. 474\u2013479 (1989)","DOI":"10.1109\/SFCS.1989.63521"},{"issue":"1","key":"8_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s001459900032","volume":"11","author":"J. Kilian","year":"1998","unstructured":"Kilian, J., Petrank, E.: An efficient non-interactive zero-knowledge proof system for NP with general assumptions. J. Crypt.\u00a011(1), 1\u201327 (1998)","journal-title":"J. Crypt."},{"issue":"2","key":"8_CR29","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. J. Crypt.\u00a04(2), 151\u2013158 (1991)","journal-title":"J. Crypt."},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Okamoto, T.: On relationships between statistical zero-knowledge proofs. In: STOC 1996, pp. 649\u2013658 (1996)","DOI":"10.1145\/237814.238016"},{"key":"8_CR31","unstructured":"Ostrovsky, R., Wigderson, A.: One-way fuctions are essential for non-trivial zero-knowledge. In: ISTCS, pp. 3\u201317 (1993)"},{"issue":"2","key":"8_CR32","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/636865.636868","volume":"50","author":"A. Sahai","year":"2003","unstructured":"Sahai, A., Vadhan, S.: A complete problem for statistical zero knowledge. J. ACM\u00a050(2), 196\u2013249 (2003)","journal-title":"J. ACM"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-48184-2_5","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"A. Santis De","year":"1988","unstructured":"De Santis, A., Micali, S., Persiano, G.: Non-interactive zero-knowledge proof systems. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 52\u201372. Springer, Heidelberg (1988)"},{"key":"8_CR34","unstructured":"Vadhan, S.: A Study of Statistical Zero-Knowledge Proofs. PhD thesis, MIT (1999)"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Vadhan, S.: An unconditional study of computational zero knowledge. In: FOCS 2004, pp. 176\u2013185 (2004)","DOI":"10.1109\/FOCS.2004.13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11535218_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:11:02Z","timestamp":1605643862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11535218_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281146","9783540318705"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/11535218_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}