{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:33:48Z","timestamp":1780068828438,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642023835","type":"print"},{"value":"9783642023842","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02384-2_18","type":"book-chapter","created":{"date-parts":[[2009,6,18]],"date-time":"2009-06-18T04:37:08Z","timestamp":1245299828000},"page":"287-304","source":"Crossref","is-referenced-by-count":8,"title":["Co-sound Zero-Knowledge with Public Keys"],"prefix":"10.1007","author":[{"given":"Carmine","family":"Ventre","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ivan","family":"Visconti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","first-page":"235","volume-title":"32nd ACM Symposium on Theory of Computing (STOC 2000)","author":"R. Canetti","year":"2000","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable Zero-Knowledge. In: 32nd ACM Symposium on Theory of Computing (STOC 2000), pp. 235\u2013244. ACM, New York (2000)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11681878_3","volume-title":"Theory of Cryptography","author":"I. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Fazio, N., Nicolosi, A.: Non-interactive zero-knowledge from homomorphic encryption. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 41\u201359. Springer, Heidelberg (2006)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-28628-8_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","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":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11761679_21","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J. Groth","year":"2006","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Perfect non-interactive zero knowledge for NP. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 339\u2013358. Springer, Heidelberg (2006)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-76900-2_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"J. Groth","year":"2007","unstructured":"Groth, J., Lu, S.: A non-interactive shuffle with pairing based verifiability. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 51\u201367. Springer, Heidelberg (2007)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-70936-7_7","volume-title":"Theory of Cryptography","author":"M. Abe","year":"2007","unstructured":"Abe, M., Fehr, S.: Perfect nizk with adaptive soundness. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 118\u2013136. Springer, Heidelberg (2007)"},{"issue":"6","key":"18_CR7","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 J. on Computing\u00a018(6), 186\u2013208 (1989)","journal-title":"SIAM J. on Computing"},{"key":"18_CR8","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 \u201994","author":"R. Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs 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":"18_CR9","unstructured":"Blum, M.: How to Prove a Theorem So No One Else Can Claim It. In: Proceedings of the International Congress of Mathematicians, pp. 1444\u20131451 (1986)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 26\u201345. Springer, Heidelberg (1998)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"18_CR12","first-page":"116","volume-title":"Proceeding of the 42nd Symposium on Foundations of Computer Science, (FOCS 2001), 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA","author":"B. Barak","year":"2001","unstructured":"Barak, B., Goldreich, O., Goldwasser, S., Lindell, Y.: Resettably-Sound Zero-Znowledge and its Applications. In: Proceeding of the 42nd Symposium on Foundations of Computer Science (FOCS 2001), 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, pp. 116\u2013125. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"18_CR13","first-page":"106","volume-title":"Proceeding of the 42nd Symposium on Foundations of Computer Science, (FOCS 2001), 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA","author":"B. Barak","year":"2001","unstructured":"Barak, B.: How to Go Beyond the Black-Box Simulation Barrier. In: Proceeding of the 42nd Symposium on Foundations of Computer Science (FOCS 2001), 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, pp. 106\u2013115. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-79499-8_11","volume-title":"Information Security and Cryptology","author":"Y. Deng","year":"2008","unstructured":"Deng, Y., Lin, D.: Resettable zero knowledge arguments with concurrent soundness in the bare public-key model under standard assumptions. In: Pei, D., Yung, M., Lin, D., Wu, C. (eds.) INSCRYPT 2007. LNCS, vol.\u00a04990, pp. 123\u2013137. Springer, Heidelberg (2008)"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: Concurrent non-malleable commitments. In: Proc. of FOCS, pp. 563\u2013572 (2005)","DOI":"10.1109\/SFCS.2005.27"},{"key":"18_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":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11787006_3","volume-title":"Automata, Languages and Programming","author":"I. Visconti","year":"2006","unstructured":"Visconti, I.: Efficient zero knowledge on the internet. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 22\u201333. Springer, Heidelberg (2006)"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-540-70583-3_45","volume-title":"Automata, Languages and Programming","author":"R. Ostrovsky","year":"2008","unstructured":"Ostrovsky, R., Persiano, G., Visconti, I.: Constant-round concurrent non-malleable zero knowledge in the bare public-key model. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 548\u2013559. Springer, Heidelberg (2008)"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Barak, B., Canetti, R., Nielsen, J., Pass, R.: Universally Composable Protocols with Relaxed Set-up Assumptions. In: 44th IEEE Symposium on Foundations of Computer Science (FOCS 2004), pp. 394\u2013403 (2004)","DOI":"10.1109\/FOCS.2004.71"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11818175_6","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J. Groth","year":"2006","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Non-interactive ZAPs and New Techniques for NIZK. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 97\u2013111. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02384-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T21:40:39Z","timestamp":1552081239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02384-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642023835","9783642023842"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02384-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}