{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:40:44Z","timestamp":1725543644191},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359074"},{"type":"electronic","value":"9783540359081"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11787006_3","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T23:23:09Z","timestamp":1151536989000},"page":"22-33","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Zero Knowledge on the Internet"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Visconti","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof-Systems. In: proc. of (STOC 1985)., pp. 291\u2013304 (1985)","DOI":"10.1145\/22145.22178"},{"key":"3_CR2","first-page":"409","volume-title":"proc. of STOC","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent Zero-Knowledge. In: proc. of STOC, pp. 409\u2013418. ACM, New York (1998)"},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/380752.380852","volume-title":"proc. of STOC","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-Box Concurrent Zero-Knowledge Requires \u03c9(logn) Rounds. In: proc. of STOC, pp. 570\u2013579. ACM Press, New York (2001)"},{"key":"3_CR4","first-page":"140","volume-title":"proc. of Eurocrypt","author":"D. Micciancio","year":"2003","unstructured":"Micciancio, D., Petrank, E.: Simulatable Commitments and Efficient Concurrent Zero-Knowledge. In: EUROCRYPT 2001, vol.\u00a02045, pp. 140\u2013159. Springer-Verlag, Heidelberg (2003)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent Zero-Knowledge with Logarithmic Round Complexity. In: proc. of FOCS 2002, pp. 366\u2013375 (2002)","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO","author":"G. Crescenzo Di","year":"1999","unstructured":"Di Crescenzo, G., Ostrovsky, R.: On Concurrent Zero-Knowledge with Pre-processing (Extended Abstract). In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, Springer, Heidelberg (1999)"},{"key":"3_CR7","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.: Non-Interactive Zero-Knowledge. SIAM J. on Computing\u00a020, 1084\u20131118 (1991)","journal-title":"SIAM J. on Computing"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT","author":"I.B. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.B.: Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, Springer, Heidelberg (2000)"},{"key":"3_CR9","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":"3_CR10","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/335305.335334","volume-title":"proc. of STOC","author":"R. Canetti","year":"2000","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable Zero-Knowledge. In: proc. of STOC, pp. 235\u2013244. ACM Press, New York (2000)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO","author":"S. Micali","year":"2001","unstructured":"Micali, S., Reyzin, L.: Soundness in the Public-Key Model. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, Springer, Heidelberg (2001)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/978-3-540-28628-8_15","volume-title":"Advances in Cryptology \u2013 CRYPTO","author":"G. Crescenzo Di","year":"2004","unstructured":"Di Crescenzo, G., Persiano, G., Visconti, I.: Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 237\u2013253. Springer, Heidelberg (2004)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Pass, R.: Simulation in Quasi-Polynomial Time and Its Applications to Protocol Composition. In: proc. of Eurocrypt 2003. LNCS, vol.\u00a02045, pp. 160\u2013176 (2003)","DOI":"10.1007\/3-540-39200-9_10"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"J. Brassard","year":"1988","unstructured":"Brassard, J., Chaum, D., Crep\u00e9au, C.: Minimum Disclosure Proofs of Knowledge. Journal of Computer and System Science\u00a037, 156\u2013189 (1988)","journal-title":"Journal of Computer and System Science"},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/1060590.1060670","volume-title":"proc. of STOC","author":"R. Pass","year":"2005","unstructured":"Pass, R., Rosen, A.: New and Improved Constructions of Non-Malleable Cryptographic Protocols. In: proc. of STOC, pp. 533\u2013542. ACM Press, New York (2005)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/11523468_66","volume-title":"Automata, Languages and Programming","author":"G. Crescenzo Di","year":"2005","unstructured":"Di Crescenzo, G., Visconti, I.: Concurrent Zero Knowledge in the Public-Key Model. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 816\u2013827. Springer, Heidelberg (2005)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/11523468_25","volume-title":"Automata, Languages and Programming","author":"D. Catalano","year":"2005","unstructured":"Catalano, D., Visconti, I.: Hybrid Trapdoor Commitments and Their Applications. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 298\u2013310. Springer, Heidelberg (2005)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology - CRYPTO","author":"R.J.F. Cramer","year":"1994","unstructured":"Cramer, R.J.F., Schoenmakers, B., Damg\u00e5rd, I.B.: Proof of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 174\u2013187. Springer, Heidelberg (1994)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: On Monotone Formula Closure of SZK. In: Proc. of FOCS, pp. 454\u2013465 (1994)","DOI":"10.1109\/SFCS.1994.365745"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient Signature Generation for Smart Cards. Journal of Cryptology\u00a04, 239\u2013252 (1991)","journal-title":"Journal of Cryptology"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","first-page":"526","volume-title":"Advances in Cryptology - CRYPTO","author":"A. Shamir","year":"1990","unstructured":"Shamir, A., Feige, U.: Zero Knowledge Proofs of Knowledge in Two Rounds. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 526\u2013544. Springer, Heidelberg (1990)"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/0-387-34805-0_3","volume-title":"Advances in Cryptology - CRYPTO","author":"I.B. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 17\u201327. Springer, Heidelberg (1990)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11787006_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T21:26:29Z","timestamp":1683494789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11787006_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359074","9783540359081"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11787006_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}