{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T03:49:48Z","timestamp":1727063388482},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642193781"},{"type":"electronic","value":"9783642193798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19379-8_13","type":"book-chapter","created":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T17:29:44Z","timestamp":1299000584000},"page":"210-227","source":"Crossref","is-referenced-by-count":15,"title":["Chosen Ciphertext Secure Encryption under Factoring Assumption Revisited"],"prefix":"10.1007","author":[{"given":"Qixiang","family":"Mei","sequence":"first","affiliation":[]},{"given":"Bao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xianhui","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Dingding","family":"Jia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","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":"13_CR2","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 probabilistic public key encryption scheme which hides all partial information. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 289\u2013299. Springer, Heidelberg (1985)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-24676-3_13","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Halevi, S., Katz, J.: Chosen-Ciphertext Security from Identity-Based Encryption. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 207\u2013222. Springer, Heidelberg (2004)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-11799-2_10","volume-title":"Theory of Cryptography","author":"R. Cramer","year":"2010","unstructured":"Cramer, R., Hofheinz, D., Kiltz, E.: A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 146\u2013164. Springer, Heidelberg (2010)"},{"key":"13_CR5","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":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 13\u201325. Springer, Heidelberg (1998)"},{"key":"13_CR7","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":"13_CR8","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":"13_CR9","first-page":"542","volume-title":"Proceedings of the 23rd ACM Symposium on Theory of Computing","author":"D. Dolev","year":"1991","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. In: Proceedings of the 23rd ACM Symposium on Theory of Computing, pp. 542\u2013552. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022, 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGama","year":"1985","unstructured":"ElGama, T.: A public key cryptosystem and a signature scheme based on discrete loga- rithms. IEEE Transactions on Information Theory\u00a031(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR12","first-page":"25","volume-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing","author":"O. Goldreich","year":"1989","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 25\u201332. ACM Press, New York (1989)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-30576-7_4","volume-title":"Theory of Cryptography","author":"J. Groth","year":"2005","unstructured":"Groth, J.: Cryptography in subgroups of \n                    $Z_n^*$\n                  . In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 50\u201365. Springer, Heidelberg (2005)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13013-7_1","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"K. Haralambiev","year":"2010","unstructured":"Haralambiev, K., Jager, T., Kiltz, E., Shoup, V.: Simple and efficient public-key encryption from computational Diffie-Hellman in the standard model. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 1\u201318. Springer, Heidelberg (2010)"},{"key":"13_CR15","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":"Advances in Cryptology - 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, vol.\u00a05350, pp. 308\u2013325. Springer, Heidelberg (2008)"},{"key":"13_CR16","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":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-01001-9_18","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"D. Hofheinz","year":"2009","unstructured":"Hofheinz, D., Kiltz, E.: Practical Chosen Ciphertext Secure Encryption from Factoring. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 313\u2013332. Springer, Heidelberg (2009)"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-642-03356-8_37","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"D. Hofheinz","year":"2009","unstructured":"Hofheinz, D., Kiltz, E.: The group of signed quadratic residues and applications. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 637\u2013653. Springer, Heidelberg (2009)"},{"key":"13_CR19","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":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.: A New Paradigm of Hybrid Encryption Scheme. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 426\u2013442. Springer, Heidelberg (2004)"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-39200-9_15","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"A. Yehuda Lindell","year":"2003","unstructured":"Yehuda Lindell, A.: Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 241\u2013254. Springer, Heidelberg (2003)"},{"issue":"2","key":"13_CR22","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02351718","volume":"1","author":"K. McCurley","year":"1988","unstructured":"McCurley, K.: A Key Distribution System Equivalent to Factoring. Journal of Cryptology\u00a01(2), 95\u2013105 (1988)","journal-title":"Journal of Cryptology"},{"issue":"5","key":"13_CR23","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":"13_CR24","first-page":"187","volume-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing 2008","author":"C. Peikert","year":"2008","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing 2008, pp. 187\u2013196. ACM, New York (2008)"},{"key":"13_CR25","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":"13_CR26","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":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-00457-5_25","volume-title":"Theory of Cryptography","author":"A. Rosen","year":"2009","unstructured":"Rosen, A., Segev, G.: Chosen-Ciphertext Security via Correlated Products. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 419\u2013436. Springer, Heidelberg (2009)"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45539-6_19","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"V. Shoup","year":"2000","unstructured":"Shoup, V.: Using Hash Functions as a Hedge against Chosen Ciphertext Attack. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 275\u2013288. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19379-8_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T13:17:34Z","timestamp":1619788654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19379-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642193781","9783642193798"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19379-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}