{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T17:10:09Z","timestamp":1736442609154,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"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_5","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T23:23:09Z","timestamp":1151536989000},"page":"46-57","source":"Crossref","is-referenced-by-count":5,"title":["An Efficient Compiler from \u03a3-Protocol to 2-Move Deniable Zero-Knowledge"],"prefix":"10.1007","author":[{"given":"Jun","family":"Furukawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaoru","family":"Kurosawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideki","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"An Efficient Compiler from \u03a3-Protocol to 2-move Deniable Zero-Knowledge (full version with examples and proofs). Manuscript.","key":"5_CR1"},{"doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O., Goldwasser, S., Lindell, Y.: Resettably-Sound Zero-Knowledge and its Applications, pp. 116\u2013125 (2001)","key":"5_CR2","DOI":"10.1109\/SFCS.2001.959886"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO","author":"M. Bellare","year":"2002","unstructured":"Bellare, M., Palacio, A.: GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, Springer, Heidelberg (2002)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO","author":"J.L. Camenisch","year":"2003","unstructured":"Camenisch, J.L., Shoup, V.: Practical Verifiable Encryption and Decryption of Discrete Logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 126\u2013144. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols, pp. 136\u2013145 (2001)","key":"5_CR5","DOI":"10.1109\/SFCS.2001.959888"},{"unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable Zero-Knowledge. In: Proc. of STOC 2000 (2000)","key":"5_CR6"},{"key":"5_CR7","first-page":"570","volume-title":"Black-box concurrent zero-knowledge requires Omega\u00a0(log n) rounds","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zero-knowledge requires Omega\u00a0(log n) rounds, pp. 570\u2013579. ACM Press, New York (2001)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/0-387-34805-0_20","volume-title":"Advances in Cryptology - CRYPTO","author":"D. Chaum","year":"1990","unstructured":"Chaum, D., van Antwerpen, H.: Undeniable Signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 212\u2013216. Springer, Heidelberg (1990)"},{"key":"5_CR9","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":"5_CR10","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 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":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/3-540-45539-6_30","volume-title":"Advances in Cryptology - EUROCRYPT 2000","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, pp. 419\u2013430. Springer, Heidelberg (2000)"},{"unstructured":"Vergnaud Damien: Private communication.","key":"5_CR12"},{"doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge: Proc. of STOC 30, pp. 409\u2013428 (1998)","key":"5_CR13","DOI":"10.1145\/276698.276853"},{"unstructured":"Cynthia Dwork, Moni Naor: Zaps and Their Applications. Electronic Colloquium on Computational Complexity (ECCC)(001): (2002)","key":"5_CR14"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Sahai, A.: Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, Springer, Heidelberg (1998)"},{"doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Zero Knowledge Proofs of Knowledge in Two Rounds. In: Crypto 89, pp. 526\u2013544 (1990)","key":"5_CR16","DOI":"10.1007\/0-387-34805-0_46"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Shamir","year":"1987","unstructured":"Shamir, A., Fiat, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/11535218_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"M. Fischlin","year":"2005","unstructured":"Fischlin, M.: Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 152\u2013168. Springer, Heidelberg (2005)"},{"issue":"1","key":"5_CR19","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. Comput.\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"5_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. J. Cryptology\u00a09(3), 167\u2013190 (1996)","journal-title":"J. Cryptology"},{"issue":"1","key":"5_CR21","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 J. on Computing\u00a025(1), 169\u2013192 (1996)","journal-title":"SIAM J. on Computing"},{"key":"5_CR22","first-page":"691","volume-title":"A Proof that Yields Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof System","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: A Proof that Yields Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof System, vol.\u00a038, pp. 691\u2013729. ACM, New York (1991)"},{"issue":"1","key":"5_CR23","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. Journal of Cryptology\u00a07(1), 1\u201332 (1994)","journal-title":"Journal of Cryptology"},{"doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L., Luby, M.: Pseudo-random Generation from one-way functions. In: STOC 1989, pp. 12\u201324 (1989)","key":"5_CR24","DOI":"10.1145\/73007.73009"},{"doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E.: Concurrent zero-knowledge in poly-logarithmic rounds. In: STOC (2001)","key":"5_CR25","DOI":"10.1145\/380752.380851"},{"doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E., Rackoff, C.: Lower Bounds for Zero Knowledge on the Internet. In: FOCS 1998, pp. 484\u2013492.","key":"5_CR26","DOI":"10.1109\/SFCS.1998.743499"},{"unstructured":"Kilian, J., Petrank, E., Richardson, R.: On Concurrent and Resettable Zero-Knowledge Proofs for NP.","key":"5_CR27"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/11426639_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"K. Kurosawa","year":"2005","unstructured":"Kurosawa, K., Heng, S.-H.: 3-Move Undeniable Signature Scheme. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 181\u2013197. Springer, Heidelberg (2005)"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-44987-6_23","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"S. Micali","year":"2001","unstructured":"Micali, S., Reyzin, L.: Min-round Resettable Zero-Knowledge in the Public-Key Model. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 373\u2013393. Springer, Heidelberg (2001)"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/3-540-44647-8_32","volume-title":"Advances in Cryptology - CRYPTO 2001","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, pp. 542\u2013565. Springer, Heidelberg (2001)"},{"unstructured":"Michels, M., Stadler, M.: Efficient Convertible Undeniable Signature Schemes. In: Proc. SAC 1997, pp. 231\u2013244 (1997)","key":"5_CR31"},{"key":"5_CR32","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit Commitment Using Pseudo-Randomness. Journal of Cryptology\u00a04, 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"unstructured":"W. Ogata, K. Kurosawa, S.H. Heng, The Security of the FDH Variant of Chaum\u2019s Undeniable Signature Scheme, IEEE Trans. on IT. Accepted","key":"5_CR33"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-45146-4_19","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R. Pass","year":"2003","unstructured":"Pass, R.: On Deniability in the Common Reference String and Random Oracle Model. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 316\u2013337. Springer, Heidelberg (2003)"},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"J. Kilian","year":"1999","unstructured":"Kilian, J., Richardson, R.: On the Concurrent Composition of Zero-Knowledge Proofs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, Springer, Heidelberg (1999)"},{"doi-asserted-by":"crossref","unstructured":"Sahai, A.: Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. In: FOCS 1999, pp. 543\u2013553 (1999)","key":"5_CR36","DOI":"10.1109\/SFFCS.1999.814628"},{"unstructured":"Zhao, Y.: Concurrent\/Resettable Zero-Knowledge With Concurrent Soundness in the Bare Public-Key Model and Its Applications. Cryptology ePrint Archive, Report 2003\/265","key":"5_CR37"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11787006_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T16:28:07Z","timestamp":1736440087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11787006_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359074","9783540359081"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/11787006_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}