{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T07:33:17Z","timestamp":1774510397126,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":47,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642010002","type":"print"},{"value":"9783642010019","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-01001-9_1","type":"book-chapter","created":{"date-parts":[[2009,4,15]],"date-time":"2009-04-15T12:38:25Z","timestamp":1239799105000},"page":"1-35","source":"Crossref","is-referenced-by-count":181,"title":["Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening"],"prefix":"10.1007","author":[{"given":"Mihir","family":"Bellare","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Hofheinz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Yilek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","first-page":"106","volume-title":"42nd Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001","author":"B. Barak","year":"2001","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: 42nd Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001, pp. 106\u2013115. IEEE Computer Society, Los Alamitos (2001)"},{"key":"1_CR2","first-page":"194","volume-title":"17th Annual IEEE Conference on Computational Complexity, Proceedings of CoCo 2002","author":"B. Barak","year":"2002","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. In: 17th Annual IEEE Conference on Computational Complexity, Proceedings of CoCo 2002, pp. 194\u2013203. IEEE Computer Society, Los Alamitos (2002)"},{"key":"1_CR3","first-page":"345","volume-title":"47th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2006","author":"B. Barak","year":"2006","unstructured":"Barak, B., Prabhakaran, M., Sahai, A.: Concurrent non-malleable zero-knowledge. In: 47th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2006, pp. 345\u2013354. IEEE Computer Society, Los Alamitos (2006)"},{"key":"1_CR4","first-page":"62","volume-title":"1st ACM Conference on Computer and Communications Security, Proceedings of CCS 1993","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: 1st ACM Conference on Computer and Communications Security, Proceedings of CCS 1993, pp. 62\u201373. ACM Press, New York (1993)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption\u2014how to encrypt with RSA. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"key":"1_CR6","first-page":"172","volume-title":"14th ACM Conference on Computer and Communications Security, Proceedings of CCS 2007","author":"M. Bellare","year":"2007","unstructured":"Bellare, M., Rogaway, P.: Robust computational secrete sharing and a unified account of classical secret-sharing goals. In: 14th ACM Conference on Computer and Communications Security, Proceedings of CCS 2007, pp. 172\u2013184. ACM Press, New York (2007)"},{"key":"1_CR7","unstructured":"Bellare, M., Yilek, S.: Encryption schemes secure under selective opening attack. IACR ePrint Archive (2009)"},{"key":"1_CR8","first-page":"1","volume-title":"20th ACM Symposium on Theory of Computing, Proceedings of STOC 1988","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: 20th ACM Symposium on Theory of Computing, Proceedings of STOC 1988, pp. 1\u201310. ACM, New York (1988)"},{"key":"1_CR9","unstructured":"Blum, M.: Coin flipping by telephone. In: Gersho, A. (ed.) Advances in Cryptology, A report on CRYPTO 1981, number 82-04 in ECE Report, pp. 11\u201315. University of California, Electrical and Computer Engineering (1982)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-85174-5_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A. Boldyreva","year":"2008","unstructured":"Boldyreva, A., Fehr, S., O\u2019Neill, A.: On notions of security for deterministic encryption, and efficient constructions without random oracles. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 335\u2013359. Springer, Heidelberg (2008)"},{"key":"1_CR11","first-page":"136","volume-title":"42nd Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001, pp. 136\u2013145. IEEE Computer Society, Los Alamitos (2001)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1145\/237814.238015","volume-title":"Twenty-Eighth Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1995","author":"R. Canetti","year":"1996","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: Twenty-Eighth Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1995, pp. 639\u2013648. ACM Press, New York (1996)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"1_CR15","first-page":"570","volume-title":"33rd Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Concurrent zero-knowledge requires \n                    \n                      \n                    \n                    $\\tilde\\Omega(\\log n)$\n                   rounds. In: 33rd Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2001, pp. 570\u2013579. ACM Press, New York (2001)"},{"key":"1_CR16","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":"1_CR17","first-page":"11","volume-title":"20th ACM Symposium on Theory of Computing, Proceedings of STOC 1988","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: 20th ACM Symposium on Theory of Computing, Proceedings of STOC 1988, pp. 11\u201319. ACM Press, New York (1988)"},{"key":"1_CR18","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. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Improved non-committing encryption schemes based on general complexity assumptions. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 432\u2013450. Springer, Heidelberg (2000)"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-48329-2_22","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"I.B. Damg\u00e5rd","year":"1994","unstructured":"Damg\u00e5rd, I.B., Pedersen, T.P., Pfitzmann, B.: On the existence of statistically hiding bit commitment schemes and fail-stop sigantures. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 250\u2013265. Springer, Heidelberg (1994)"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1145\/103418.103474","volume-title":"Twenty-Third Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1991","author":"D. Dolev","year":"1991","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. In: Twenty-Third Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1991, pp. 542\u2013552. ACM Press, New York (1991) (Extended abstract)"},{"issue":"6","key":"1_CR22","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. Journal of the ACM\u00a050(6), 852\u2013921 (2003)","journal-title":"Journal of the ACM"},{"issue":"6","key":"1_CR23","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1145\/1039488.1039489","volume":"51","author":"C. Dwork","year":"2004","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. Journal of the ACM\u00a051(6), 851\u2013898 (2004)","journal-title":"Journal of the ACM"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/11787006_4","volume-title":"Automata, Languages and Programming","author":"R. Gennaro","year":"2006","unstructured":"Gennaro, R., Micali, S.: Independent zero-knowledge sets. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 34\u201345. Springer, Heidelberg (2006)"},{"key":"1_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography (Basic Tools)","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography (Basic Tools), vol.\u00a01. Cambridge University Press, Cambridge (2001)"},{"issue":"1","key":"1_CR26","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"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences\u00a028(2) (1984)","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/978-3-642-00457-5_13","volume-title":"TCC 2009","author":"I. Haitner","year":"2009","unstructured":"Haitner, I., Holenstein, T.: On the (im)possibility of key dependent encryption. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 202\u2013219. Springer, Heidelberg (2009)"},{"key":"1_CR29","first-page":"1","volume-title":"39th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2007","author":"I. Haitner","year":"2007","unstructured":"Haitner, I., Reingold, O.: Statistically-hiding commitment from any one-way function. In: 39th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2007, pp. 1\u201310. ACM Press, New York (2007)"},{"key":"1_CR30","first-page":"669","volume-title":"48th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2007","author":"I. Haitner","year":"2007","unstructured":"Haitner, I., Hoch, J.J., Reingold, O., Segev, G.: Finding collisions in interactive protocols \u2013 a tight lower bound on the round complexity of statistically-hiding commitments. In: 48th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2007, pp. 669\u2013679. IEEE Computer Society, Los Alamitos (2007)"},{"key":"1_CR31","unstructured":"Hofheinz, D.: Possibility and impossibility results for selective decommitments. IACR ePrint Archive (April 2008)"},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/73007.73012","volume-title":"Twenty-First Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1989","author":"R. Impagliazzo","year":"1989","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Twenty-First Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1989, pp. 44\u201361. ACM Press, New York (1989) (Extended abstract)"},{"key":"1_CR33","first-page":"560","volume-title":"33rd Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2001","author":"J. Kilian","year":"2001","unstructured":"Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in poly-logarithmic rounds. In: 33rd Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2001, pp. 560\u2013569. ACM Press, New York (2001)"},{"key":"1_CR34","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":"1_CR35","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(2), 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"key":"1_CR36","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: Twelfth Annual Symposium on Discrete Algorithms, Proceedings of SODA 2001, pp. 448\u2013457. ACM\/SIAM (2001)"},{"key":"1_CR37","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/73007.73011","volume-title":"Twenty-First Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1989","author":"M. Naor","year":"1989","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Twenty-First Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1989, pp. 33\u201343. ACM Press, New York (1989)"},{"key":"1_CR38","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":"1_CR39","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":"1_CR40","first-page":"187","volume-title":"Fotieth Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2008","author":"C. Peikert","year":"2008","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Fotieth Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2008, pp. 187\u2013196. ACM Press, New York (2008)"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"1_CR42","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1109\/SFCS.2002.1181961","volume-title":"43rd Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2002","author":"M. Prabhakaran","year":"2002","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round complexity. In: 43rd Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2002, pp. 366\u2013375. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"1_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"Theory of Cryptography","author":"O. Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.P.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 1\u201320. Springer, Heidelberg (2004)"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-48910-X_29","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Richardson","year":"1999","unstructured":"Richardson, R., Kilian, J.: On the concurrent composition of zero-knowledge proofs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 415\u2013431. Springer, Heidelberg (1999)"},{"key":"1_CR45","unstructured":"Rosen, A., Segev, G.: Efficient lossy trapdoor functions based on the composite residuosity assumption. IACR ePrint Archive (March 2008)"},{"key":"1_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D.R. Simon","year":"1998","unstructured":"Simon, D.R.: Findings collisions on a one-way street: Can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 334\u2013345. Springer, Heidelberg (1998)"},{"key":"1_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-540-70936-7_23","volume-title":"Theory of Cryptography","author":"H.M. Wee","year":"2007","unstructured":"Wee, H.M.: One-way permutations, interactive hashing and statistically hiding commitments. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 419\u2013433. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - EUROCRYPT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01001-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T15:00:45Z","timestamp":1551970845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01001-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642010002","9783642010019"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01001-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}