{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:34:52Z","timestamp":1769297692536,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642195709","type":"print"},{"value":"9783642195716","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19571-6_33","type":"book-chapter","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T08:04:42Z","timestamp":1300781082000},"page":"541-558","source":"Crossref","is-referenced-by-count":8,"title":["(Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks"],"prefix":"10.1007","author":[{"given":"David","family":"Xiao","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","first-page":"106","volume-title":"Proc. 42nd FOCS","author":"B. Barak","year":"2001","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: Proc. 42nd FOCS, pp. 106\u2013115. IEEE, Los Alamitos (2001)"},{"key":"33_CR2","first-page":"629","volume-title":"Proc. STOC 1996","author":"D. Beaver","year":"1996","unstructured":"Beaver, D.: Adaptive zero knowledge and computational equivocation (extended abstract). In: Proc. STOC 1996, pp. 629\u2013638. ACM, New York (1996)"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-01001-9_1","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"M. Bellare","year":"2009","unstructured":"Bellare, M., Hofheinz, D., Yilek, S.: Possibility and impossibility results for encryption and commitment secure under selective opening. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 1\u201335. Springer, Heidelberg (2009)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"G. Brassard","year":"1987","unstructured":"Brassard, G., Cr\u00e9peau, C.: Zero-knowledge simulation of boolean circuits. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 223\u2013233. Springer, Heidelberg (1987)"},{"issue":"2","key":"33_CR5","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., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. J.\u00a0Comput. Syst. Sci.\u00a037(2), 156\u2013189 (1988)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/3-540-46885-4_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"G. Brassard","year":"1990","unstructured":"Brassard, G., Cr\u00e9peau, C., Yung, M.: Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 192\u2013195. Springer, Heidelberg (1990)"},{"issue":"1","key":"33_CR7","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, A.: Black-box concurrent zero-knowledge requires (almost) logarithmically many rounds. SIAM J. Comput.\u00a032(1), 1\u201347 (2003)","journal-title":"SIAM J. Comput."},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/3-540-48405-1_31","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"G. Crescenzo Di","year":"1999","unstructured":"Di Crescenzo, G., Ostrovsky, R.: On concurrent zero-knowledge with pre-processing (Extended abstract). In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 485\u2013502. Springer, Heidelberg (1999)"},{"key":"33_CR9","first-page":"141","volume-title":"Proc. STOC 1998","author":"G. Crescenzo Di","year":"1998","unstructured":"Di Crescenzo, G., Ishai, Y., Ostrovsky, R.: Non-interactive and non-malleable commitment. In: Proc. STOC 1998, pp. 141\u2013150. ACM, New York (1998)"},{"issue":"6","key":"33_CR10","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/950620.950623","volume":"50","author":"C. Dwork","year":"2003","unstructured":"Dwork, C., Naor, M., Reingold, O., Stockmeyer, L.: Magic functions. J. ACM\u00a050(6), 852\u2013921 (2003)","journal-title":"J. ACM"},{"key":"33_CR11","unstructured":"Fischlin, M.: Trapdoor Commitment Schemes and Their Applications. Ph.D. Thesis (Doktorarbeit), Department of Mathematics, Goethe-University, Frankfurt, Germany (2001)"},{"issue":"3","key":"33_CR12","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\u00a0NP. Journal of Cryptology\u00a09(3), 167\u2013189 (1996)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"33_CR13","doi-asserted-by":"crossref","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. of Com. 25(1), 169\u2013192 (1996); Preliminary version appeared In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443. Springer, Heidelberg (1990)","journal-title":"SIAM J. of Com."},{"issue":"3","key":"33_CR14","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","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(3), 691\u2013729 (1991); Preliminary version in FOCS 1986","journal-title":"Journal of the ACM"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Haitner, I., Hoch, J.J., Reingold, O., Segev, G.: Finding collisions in interactive protocols - a tight lower bound on the round complexity of statistically-hiding commitments. In: Proc. FOCS 2007, pp. 669\u2013679 (2007)","DOI":"10.1109\/FOCS.2007.7"},{"key":"33_CR16","first-page":"611","volume-title":"Proc. STOC 2009","author":"I. Haitner","year":"2009","unstructured":"Haitner, I., Reingold, O., Vadhan, S., Wee, H.: Inaccessible entropy. In: Proc. STOC 2009, pp. 611\u2013620. ACM, New York (2009)"},{"key":"33_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-78524-8_5","volume-title":"Theory of Cryptography","author":"J. Katz","year":"2008","unstructured":"Katz, J.: Which languages have 4-round zero-knowledge proofs? In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 73\u201388. Springer, Heidelberg (2008)"},{"issue":"2","key":"33_CR18","doi-asserted-by":"crossref","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); Preliminary version In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 128\u2013136. Springer, Heidelberg (1990)","journal-title":"Journal of Cryptology"},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-00457-5_24","volume-title":"Theory of Cryptography","author":"R. Pass","year":"2009","unstructured":"Pass, R., Wee, H.: Black-box constructions of two-party protocols from one-way functions. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 403\u2013418. Springer, Heidelberg (2009)"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-03356-8_10","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"R. Pass","year":"2009","unstructured":"Pass, R., Tseng, W.-L.D., Wikstr\u00f6m, D.: On the composition of public-coin zero-knowledge protocols. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 160\u2013176. Springer, Heidelberg (2009)"},{"key":"33_CR21","first-page":"366","volume-title":"Proc. 43rd FOCS","author":"M. Prabhakaran","year":"2002","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: Proc. 43rd FOCS, pp. 366\u2013375. IEEE, Los Alamitos (2002)"},{"key":"33_CR22","series-title":"Information Security and Cryptography","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-32939-0","volume-title":"Concurrent Zero-Knowledge - With Additional Background by Oded Goldreich","author":"A. Rosen","year":"2006","unstructured":"Rosen, A.: Concurrent Zero-Knowledge - With Additional Background by Oded Goldreich. Information Security and Cryptography. Springer, Heidelberg (2006)"},{"key":"33_CR23","unstructured":"Wee, H.: On statistically binding trapdoor commitments from one-way functions (2008) (manuscript)"},{"key":"33_CR24","unstructured":"Zhang, Z., Cao, Z., Zhu, H.: Constant-round adaptive zero knowledge proofs for NP (2009) (manuscript)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19571-6_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:48:27Z","timestamp":1606168107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19571-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642195709","9783642195716"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19571-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}