{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T03:47:59Z","timestamp":1727063279456},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642010002"},{"type":"electronic","value":"9783642010019"}],"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_18","type":"book-chapter","created":{"date-parts":[[2009,4,15]],"date-time":"2009-04-15T08:38:25Z","timestamp":1239784705000},"page":"313-332","source":"Crossref","is-referenced-by-count":81,"title":["Practical Chosen Ciphertext Secure Encryption from Factoring"],"prefix":"10.1007","author":[{"given":"Dennis","family":"Hofheinz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eike","family":"Kiltz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"Alexi, W., Chor, B., Goldreich, O., Schnorr, C.-P.: RSA and Rabin functions: Certain parts are as hard as the whole. SIAM Journal on Computing\u00a017(2), 194\u2013209 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR2","first-page":"62","volume-title":"ACM CCS 1993","author":"M. Bellare","year":"1993","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, New York (1993)"},{"key":"18_CR3","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. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0055716","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"D. Bleichenbacher","year":"1998","unstructured":"Bleichenbacher, D.: Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 1\u201312. Springer, Heidelberg (1998)"},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM Journal on Computing\u00a015(2), 364\u2013383 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-39568-7_23","volume-title":"Advances in Cryptology","author":"M. Blum","year":"1985","unstructured":"Blum, M., Goldwasser, S.: An efficient probabilistic public-key encryption scheme which hides all partial information. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 289\u2013302. Springer, Heidelberg (1985)"},{"issue":"4","key":"18_CR7","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudorandom bits. SIAM Journal on Computing\u00a013(4), 850\u2013864 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Efficient selective-ID secure identity-based encryption without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 223\u2013238. Springer, Heidelberg (2004)"},{"issue":"5","key":"18_CR9","first-page":"915","volume":"36","author":"D. Boneh","year":"2006","unstructured":"Boneh, D., Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. SIAM Journal on Computing\u00a036(5), 915\u2013942 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR10","first-page":"320","volume-title":"ACM CCS 2005","author":"X. Boyen","year":"2005","unstructured":"Boyen, X., Mei, Q., Waters, B.: Direct chosen ciphertext security from identity-based techniques. In: ACM CCS 2005, pp. 320\u2013329. ACM Press, New York (2005)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO 2003","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)"},{"issue":"4","key":"18_CR12","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. Journal of the ACM\u00a051(4), 557\u2013594 (2004)","journal-title":"Journal of the ACM"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-78967-3_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"D.M. Cash","year":"2008","unstructured":"Cash, D.M., Kiltz, E., Shoup, V.: The twin diffie-hellman problem and applications. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 127\u2013145. Springer, Heidelberg (2008)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R. Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 45\u201364. Springer, Heidelberg (2002)"},{"issue":"1","key":"18_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":"18_CR16","first-page":"542","volume-title":"23rd ACM STOC","author":"D. Dolev","year":"1991","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. In: 23rd ACM STOC, pp. 542\u2013552. ACM Press, New York (1991)"},{"issue":"2","key":"18_CR17","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":"2","key":"18_CR18","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s001459910008","volume":"13","author":"R. Fischlin","year":"2000","unstructured":"Fischlin, R., Schnorr, C.-P.: Stronger security proofs for RSA and Rabin bits. Journal of Cryptology\u00a013(2), 221\u2013244 (2000)","journal-title":"Journal of Cryptology"},{"issue":"2","key":"18_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/1151414.1151418","volume":"9","author":"R. Gennaro","year":"2006","unstructured":"Gennaro, R., Lindell, Y.: A framework for password-based authenticated key exchange. ACM Transactions on Information and System Security\u00a09(2), 181\u2013234 (2006)","journal-title":"ACM Transactions on Information and System Security"},{"key":"18_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"18_CR21","first-page":"25","volume-title":"21st ACM STOC","author":"O. Goldreich","year":"1989","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: 21st ACM STOC, pp. 25\u201332. ACM Press, New York (1989)"},{"issue":"2","key":"18_CR22","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"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-540-89255-7_19","volume-title":"ASIACRYPT 2008","author":"G. Hanaoka","year":"2008","unstructured":"Hanaoka, G., Kurosawa, K.: Efficient chosen ciphertext secure public key encryption under the computational Diffie-Hellman assumption. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, pp. 308\u2013325. Springer, Heidelberg (2008)"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-540-74143-5_31","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"D. Hofheinz","year":"2007","unstructured":"Hofheinz, D., Kiltz, E.: Secure hybrid encryption from weakened key encapsulation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 553\u2013571. Springer, Heidelberg (2007)"},{"key":"18_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/11681878_30","volume-title":"Theory of Cryptography","author":"E. Kiltz","year":"2006","unstructured":"Kiltz, E.: Chosen-ciphertext security from tag-based encryption. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 581\u2013600. Springer, Heidelberg (2006)"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-71677-8_19","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"E. Kiltz","year":"2007","unstructured":"Kiltz, E.: Chosen-ciphertext secure key-encapsulation based on gap hashed diffie-hellman. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 282\u2013297. Springer, Heidelberg (2007)"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","volume-title":"EUROCRYPT 2009","author":"E. Kiltz","year":"2009","unstructured":"Kiltz, E., Pietrzak, K., Stam, M., Yung, M.: A new randomness extraction paradigm for hybrid encryption. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS. Springer, Heidelberg (2009)"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-28628-8_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"K. Kurosawa","year":"2004","unstructured":"Kurosawa, K., Desmedt, Y.G.: A new paradigm of hybrid encryption scheme. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 426\u2013442. Springer, Heidelberg (2004)"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-36178-2_2","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"S. Lucks","year":"2002","unstructured":"Lucks, S.: A variant of the cramer-shoup cryptosystem for groups of unknown order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 27\u201345. Springer, Heidelberg (2002)"},{"issue":"5","key":"18_CR30","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1137\/S0097539701389257","volume":"31","author":"M. Naor","year":"2002","unstructured":"Naor, M., Reingold, O., Rosen, A.: Pseudo-random functions and factoring. SIAM Journal on Computing\u00a031(5), 1383\u20131404 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR31","volume-title":"22nd ACM STOC","author":"M. Naor","year":"1990","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: 22nd ACM STOC. ACM Press, New York (1990)"},{"key":"18_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/11935230_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"P. Paillier","year":"2006","unstructured":"Paillier, P., Villar, J.L.: Trading one-wayness against chosen-ciphertext security in factoring-based encryption. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 252\u2013266. Springer, Heidelberg (2006)"},{"key":"18_CR33","first-page":"187","volume-title":"40th ACM STOC","author":"C. Peikert","year":"2008","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 187\u2013196. ACM Press, New York (2008)"},{"key":"18_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-540-30564-4_13","volume-title":"Selected Areas in Cryptography","author":"D.H. Phan","year":"2004","unstructured":"Phan, D.H., Pointcheval, D.: About the security of ciphers (Semantic security and pseudo-random permutations). In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol.\u00a03357, pp. 182\u2013197. Springer, Heidelberg (2004)"},{"key":"18_CR35","unstructured":"Rabin, M.O.: Digital signatures and public key functions as intractable as factorization. Technical Report MIT\/LCS\/TR-212, Massachusetts Institute of Technology (January 1979)"},{"key":"18_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"C. Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D.R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 433\u2013444. Springer, Heidelberg (1992)"},{"key":"18_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-45450-0_11","volume-title":"Information Security and Privacy","author":"L. Reyzin","year":"2002","unstructured":"Reyzin, L., Reyzin, N.: Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying. In: Batten, L.M., Seberry, J. (eds.) ACISP 2002. LNCS, vol.\u00a02384, pp. 144\u2013154. Springer, Heidelberg (2002)"},{"issue":"6","key":"18_CR38","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TIT.1980.1056264","volume":"26","author":"H.C. Williams","year":"1980","unstructured":"Williams, H.C.: A modification of the RSA public-key encryption procedure. IEEE Transactions on Information Theory\u00a026(6), 726\u2013729 (1980)","journal-title":"IEEE Transactions on Information Theory"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T06:19:56Z","timestamp":1551939596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01001-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642010002","9783642010019"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01001-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}