{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T07:33:16Z","timestamp":1774510396124,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642290107","type":"print"},{"value":"9783642290114","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29011-4_38","type":"book-chapter","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T07:05:53Z","timestamp":1333609553000},"page":"645-662","source":"Crossref","is-referenced-by-count":63,"title":["Standard Security Does Not Imply Security against Selective-Opening"],"prefix":"10.1007","author":[{"given":"Mihir","family":"Bellare","sequence":"first","affiliation":[]},{"given":"Rafael","family":"Dowsley","sequence":"additional","affiliation":[]},{"given":"Brent","family":"Waters","sequence":"additional","affiliation":[]},{"given":"Scott","family":"Yilek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-642-11799-2_28","volume-title":"Theory of Cryptography","author":"M. Abdalla","year":"2010","unstructured":"Abdalla, M., Bellare, M., Neven, G.: Robust Encryption. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 480\u2013497. Springer, Heidelberg (2010)"},{"key":"38_CR2","unstructured":"Bellare, M., Dowsley, R., Waters, B., Yilek, S.: Standard security does not imply security against selective-opening. Cryptology ePrint Archive, Report 2011\/581 (2011), Full version of this abstract, \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"38_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":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-45708-9_11","volume-title":"Advances in Cryptology - CRYPTO 2002","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, pp. 162\u2013177. Springer, Heidelberg (2002)"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Ashby, V. (ed.) ACM CCS 1993, pp. 62\u201373. ACM Press (November 1993)","DOI":"10.1145\/168588.168596"},{"key":"38_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M. Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The Security of Triple Encryption and a Framework\u00a0for\u00a0Code-Based\u00a0Game-Playing\u00a0Proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 409\u2013426. Springer, Heidelberg (2006)"},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-19571-6_15","volume-title":"Theory of Cryptography","author":"M. Bellare","year":"2011","unstructured":"Bellare, M., Waters, B., Yilek, S.: Identity-Based Encryption Secure against Selective Opening Attack. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 235\u2013252. Springer, Heidelberg (2011)"},{"key":"38_CR8","unstructured":"Bellare, M., Yilek, S.: Encryption schemes secure under selective opening attack. Cryptology ePrint Archive, Report 2009\/101 (2009), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: 20th ACM STOC, pp. 1\u201310. ACM Press (May 1988)","DOI":"10.1145\/62212.62213"},{"key":"38_CR10","unstructured":"B\u00f6hl, F., Hofheinz, D., Kraschewski, D.: On definitions of selective opening security. Cryptology ePrint Archive, Report 2011\/678 (2011), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/BFb0052229","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"R. Canetti","year":"1997","unstructured":"Canetti, R., Dwork, C., Naor, M., Ostrovsky, R.: Deniable Encryption. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 90\u2013104. Springer, Heidelberg (1997)"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: 28th ACM STOC, pp. 639\u2013648. ACM Press (May 1996)","DOI":"10.1145\/237814.238015"},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-30576-7_9","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2005","unstructured":"Canetti, R., Halevi, S., Katz, J.: Adaptively-Secure, Non-interactive Public-Key Encryption. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 150\u2013168. Springer, Heidelberg (2005)"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: 20th ACM STOC, pp. 11\u201319. ACM Press (May 1988)","DOI":"10.1145\/62212.62214"},{"issue":"1","key":"38_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R. Cramer","year":"2003","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal on Computing\u00a033(1), 167\u2013226 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"38_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-44598-6_27","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"I.B. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.B., Nielsen, J.B.: Improved Non-committing Encryption Schemes Based on a General Complexity Assumption. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 432\u2013450. Springer, Heidelberg (2000)"},{"key":"38_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/11535218_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"Y. Dodis","year":"2005","unstructured":"Dodis, Y., Oliveira, R., Pietrzak, K.: On the Generic Insecurity of the Full Domain Hash. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 449\u2013466. Springer, Heidelberg (2005)"},{"issue":"2","key":"38_CR18","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM Journal on Computing\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"38_CR19","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.J.: Magic functions. Journal of the ACM\u00a050(6), 852\u2013921 (2003)","journal-title":"Journal of the ACM"},{"key":"38_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-642-13190-5_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S. Fehr","year":"2010","unstructured":"Fehr, S., Hofheinz, D., Kiltz, E., Wee, H.: Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 381\u2013402. Springer, Heidelberg (2010)"},{"key":"38_CR21","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM\u00a033, 792\u2013807 (1986)","journal-title":"Journal of the ACM"},{"key":"38_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0032038","volume-title":"Automata, Languages and Programming","author":"O. Goldreich","year":"1990","unstructured":"Goldreich, O., Krawczyk, H.: On the Composition of Zero-Knowledge Proof Systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 268\u2013282. Springer, Heidelberg (1990)"},{"issue":"1","key":"38_CR23","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 Journal on Computing\u00a025(1), 169\u2013192 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"38_CR24","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)","journal-title":"Journal of the ACM"},{"issue":"1","key":"38_CR25","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"},{"issue":"2","key":"38_CR26","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences\u00a028(2), 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"38_CR27","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 Journal on Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"38_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-25385-0_4","volume-title":"ASIACRYPT 2011","author":"B. Hemenway","year":"2011","unstructured":"Hemenway, B., Libert, B., Ostrovsky, R., Vergnaud, D.: Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 70\u201388. Springer, Heidelberg (2011)"},{"issue":"3","key":"38_CR29","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/s00145-010-9066-x","volume":"24","author":"D. Hofheinz","year":"2011","unstructured":"Hofheinz, D.: Possibility and impossibility results for selective decommitments. Journal of Cryptology\u00a024(3), 470\u2013516 (2011)","journal-title":"Journal of Cryptology"},{"key":"38_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-78524-8_18","volume-title":"Theory of Cryptography","author":"G. Kol","year":"2008","unstructured":"Kol, G., Naor, M.: Cryptography and Game Theory: Designing Protocols for Exchanging Information. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 320\u2013339. Springer, Heidelberg (2008)"},{"issue":"2","key":"38_CR31","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. Journal of Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"key":"38_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45708-9_8","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J.B. Nielsen","year":"2002","unstructured":"Nielsen, J.B.: Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 111\u2013126. Springer, Heidelberg (2002)"},{"key":"38_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/978-3-642-22792-9_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"A. O\u2019Neill","year":"2011","unstructured":"O\u2019Neill, A., Peikert, C., Waters, B.: Bi-Deniable Public-Key Encryption. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 525\u2013542. Springer, Heidelberg (2011)"},{"key":"38_CR34","unstructured":"Ostrovsky, R., Rao, V., Scafuro, A., Visconti, I.: Revisiting lower and upper bounds for selective decommitments. Cryptology ePrint Archive, Report 2011\/536 (2011), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"38_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-70936-7_2","volume-title":"Theory of Cryptography","author":"S. Panjwani","year":"2007","unstructured":"Panjwani, S.: Tackling Adaptive Corruptions in Multicast Encryption Protocols. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 21\u201340. Springer, Heidelberg (2007)"},{"key":"38_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"38_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C. Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A Framework for Efficient and Composable Oblivious Transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 554\u2013571. Springer, Heidelberg (2008)"},{"key":"38_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11958239_14","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"P. Rogaway","year":"2006","unstructured":"Rogaway, P.: Formalizing Human Ignorance. In: Nguy\u00ean, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 211\u2013228. Springer, Heidelberg (2006)"},{"key":"38_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-642-19571-6_33","volume-title":"Theory of Cryptography","author":"D. Xiao","year":"2011","unstructured":"Xiao, D.: (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 541\u2013558. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29011-4_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:18:43Z","timestamp":1620127123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29011-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642290107","9783642290114"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29011-4_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}