{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T00:00:48Z","timestamp":1775692848054,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T00:00:00Z","timestamp":1322784000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s00145-011-9114-1","type":"journal-article","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T20:33:28Z","timestamp":1322858008000},"page":"80-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":273,"title":["Secure Integration of Asymmetric and Symmetric Encryption Schemes"],"prefix":"10.1007","volume":"26","author":[{"given":"Eiichiro","family":"Fujisaki","sequence":"first","affiliation":[]},{"given":"Tatsuaki","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,2]]},"reference":[{"key":"9114_CR1","volume-title":"IEEE P1363a","author":"M. Abdalla","year":"2001","unstructured":"M. Abdalla, M. Bellare, P. Rogaway, DHIES: An encryption scheme based on the Diffie\u2013Hellman problem, in IEEE P1363a, September 2001 (2001). ANSI X9.63EC, and SECG"},{"key":"9114_CR2","unstructured":"M. Abdalla, M. Bellare, P. Rogaway, DHAES: An encryption scheme based on the Diffie\u2013Hellman problem. Submission to IEEE P1363, November 1998. \n                    http:\/\/grouper.ieee.org\/groups\/1363\/StudyGroup\/"},{"issue":"1","key":"9114_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00145-007-9010-x","volume":"21","author":"M. Abe","year":"2008","unstructured":"M. Abe, R. Gennaro, K. Kurosawa, Tag-KEM\/DEM: A new framework for hybrid encryption. J.\u00a0Cryptol.\n                  21(1), 97\u2013130 (2008)","journal-title":"J.\u00a0Cryptol."},{"key":"9114_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-30539-2_4","volume-title":"Advances in Cryptology\u2014Asiacrypt 2004","author":"M. Bellare","year":"2004","unstructured":"M. Bellare, A. Palacio, Towards plaintext-aware public-key encryption without random oracles, in Advances in Cryptology\u2014Asiacrypt 2004, ed. by P.J. Lee. Lecture Notes in Computer Science, vol.\u00a03329 (Springer, Berlin, 2004), pp.\u00a048\u201362"},{"key":"9114_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"First ACM Conference on Computer and Communication Security","author":"M. Bellare","year":"1993","unstructured":"M. Bellare, P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, in First ACM Conference on Computer and Communication Security (ACM, New York, 1993), pp.\u00a062\u201373"},{"key":"9114_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201994","author":"M. Bellare","year":"1995","unstructured":"M. Bellare, P. Rogaway, Optimal asymmetric encryption, in Advances in Cryptology\u2014EUROCRYPT\u201994, ed. by A.D. Santis. Lecture Notes in Computer Science, vol.\u00a0950 (Springer, Berlin, 1995), pp.\u00a092\u2013111"},{"key":"9114_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology\u2014CRYPTO\u201998","author":"M. Bellare","year":"1998","unstructured":"M. Bellare, A. Desai, D. Pointcheval, P. Rogaway, Relations among notions of security for public-key encryption schemes, in Advances in Cryptology\u2014CRYPTO\u201998, ed. by H.\u00a0Krawczyk. Lecture Notes in Computer Science, vol.\u00a01462 (Springer, Berlin, 1998), pp.\u00a026\u201345"},{"issue":"5","key":"9114_CR8","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1137\/S009753970544713X","volume":"36","author":"D. Boneh","year":"2007","unstructured":"D. Boneh, R. Canetti, S. Halevi, J. Katz, Chosen-ciphertext security from identity-based encryption. SIAM J. Comput.\n                  36(5), 1301\u20131328 (2007)","journal-title":"SIAM J. Comput."},{"key":"9114_CR9","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\u2014EUROCRYPT 2004","author":"R. Canetti","year":"2004","unstructured":"R. Canetti, S. Halevi, J. Katz, Chosen-ciphertext security from identity based encryption, in Advances in Cryptology\u2014EUROCRYPT 2004, ed. by C. Cachin, J. Camenisch. Lecture Notes in Computer Science, vol.\u00a03027 (Springer, Berlin, 2004), pp.\u00a0207\u2013222"},{"key":"9114_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-3-540-78967-3_8","volume-title":"EUROCRYPT","author":"D. Cash","year":"2008","unstructured":"D. Cash, E. Kiltz, V. Shoup, The twin Diffie\u2013Hellman problem and applications, in EUROCRYPT, ed. by N.P. Smart. Lecture Notes in Computer Science, vol.\u00a04965 (Springer, Berlin, 2008), pp.\u00a0127\u2013145"},{"key":"9114_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology\u2014CRYPTO\u201998","author":"R. Cramer","year":"1998","unstructured":"R. Cramer, V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, in Advances in Cryptology\u2014CRYPTO\u201998, ed. by H. Krawczyk. Lecture Notes in Computer Science, vol.\u00a01462 (Springer, Berlin, 1998), pp.\u00a013\u201325"},{"key":"9114_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201902","author":"R. Cramer","year":"2002","unstructured":"R. Cramer, V. Shoup, Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption, in Advances in Cryptology\u2014EUROCRYPT\u201902. Lecture Notes in Computer Science (Springer, Berlin, 2002), pp.\u00a045\u201364"},{"issue":"1","key":"9114_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R. Cramer","year":"2004","unstructured":"R. Cramer, V. Shoup, Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J. Comput.\n                  33(1), 167\u2013226 (2004). Early version in CRYPTO\u201998","journal-title":"SIAM J. Comput."},{"key":"9114_CR14","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\u2014TCC 2010","author":"R. Cramer","year":"2010","unstructured":"R. Cramer, D. Hofheinz, E. Kiltz, A\u00a0twist on the Naor\u2013Yung paradigm and its application to efficient cca-secure encryption from hard search problems, in Theory of Cryptography\u2014TCC 2010. Lecture Notes in Computer Science, vol.\u00a05978 (Springer, Berlin, 2010), pp.\u00a0146\u2013164"},{"key":"9114_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/3-540-46766-1_36","volume-title":"Advances in Cryptology\u2014CRYPTO\u201991","author":"I. Damg\u00e5rd","year":"1992","unstructured":"I. Damg\u00e5rd, Towards practical public key systems secure against chosen ciphertext attacks, in Advances in Cryptology\u2014CRYPTO\u201991, ed. by J. Feigenbaum. Lecture Notes in Computer Science, vol.\u00a0576 (Springer, Berlin, 1992), pp.\u00a0445\u2013456"},{"issue":"2","key":"9114_CR16","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"D. Dolev, C. Dwork, M. Naor, Non-malleable cryptography. SIAM J. Comput.\n                  30(2), 391\u2013437 (2000) (Presented in STOC\u201991)","journal-title":"SIAM J. Comput."},{"key":"9114_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/3-540-44750-4_23","volume-title":"Advances in Cryptology\u2014CRYPTO\u201995","author":"Y. Frankel","year":"1995","unstructured":"Y. Frankel, M. Yung, Cryptoanalysis of the immunized LL public key systems, in Advances in Cryptology\u2014CRYPTO\u201995, ed. by D. Coppersmith. Lecture Notes in Computer Science, vol.\u00a0963 (Springer, Berlin, 1995), pp.\u00a0287\u2013296"},{"key":"9114_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology\u2014CRYPTO\u201999","author":"E. Fujisaki","year":"1999","unstructured":"E. Fujisaki, T. Okamoto, Secure integration of asymmetric and symmetric encryption schemes, in Advances in Cryptology\u2014CRYPTO\u201999, ed. by M.\u00a0Wiener. Lecture Notes in Computer Science, vol.\u00a01666 (Springer, Berlin, 1999), pp.\u00a0537\u2013554"},{"issue":"1","key":"9114_CR19","first-page":"24","volume":"E83-A","author":"E. Fujisaki","year":"2000","unstructured":"E. Fujisaki, T. Okamoto, How to enhance the security of public-key encryption at minimum cost. IEICE Trans. Fundam. Electron. Commun. Comput. Sci.\n                  E83-A(1), 24\u201332 (2000). Early Version in PKC\u201999","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"9114_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/3-540-44647-8_16","volume-title":"Advances in Cryptology\u2014CRYPTO2001","author":"E. Fujisaki","year":"2001","unstructured":"E. Fujisaki, T. Okamoto, D. Pointcheval, J. Stern, RSA-OAEP is secure under the RSA assumption, in Advances in Cryptology\u2014CRYPTO2001, ed. by J. Kilian. Lecture Notes in Computer Science, vol.\u00a02139 (Springer, Berlin, 2001), pp.\u00a0260\u2013274"},{"key":"9114_CR21","unstructured":"D. Galindo, S. Martin, P. Morillo, J. Villar, Fujisaki-Okamoto IND-CCA hybrid encryption revisited. Technical report, IACR, May 2003. \n                    http:\/\/eprint.iacr.org\/2003\/107"},{"issue":"1","key":"9114_CR22","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF02620230","volume":"6","author":"O. Goldreich","year":"1993","unstructured":"O. Goldreich, A uniform-complexity treatment of encryption and zero-knowledge. J.\u00a0Cryptol.\n                  6(1), 21\u201353 (1993)","journal-title":"J.\u00a0Cryptol."},{"key":"9114_CR23","first-page":"25","volume-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC\u201989)","author":"O. Goldreich","year":"1989","unstructured":"O. Goldreich, L. Levin, A\u00a0hard-core predicate for all one-way functions, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC\u201989) (1989), pp.\u00a025\u201332"},{"key":"9114_CR24","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser, S. Micali, Probabilistic encryption. J.\u00a0Comput. Syst. Sci.\n                  28, 270\u2013299 (1984)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9114_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/978-3-540-74143-5_31","volume-title":"CRYPTO","author":"D. Hofheinz","year":"2007","unstructured":"D. Hofheinz, E. Kiltz, Secure hybrid encryption from weakened key encapsulation, in CRYPTO, ed. by A. Menezes. Lecture Notes in Computer Science, vol.\u00a04622 (Springer, Berlin, 2007), pp.\u00a0553\u2013571"},{"key":"9114_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-3-642-01001-9_18","volume-title":"EUROCRYPT","author":"D. Hofheinz","year":"2009","unstructured":"D. Hofheinz, E. Kiltz, Practical chosen ciphertext secure encryption from factoring, in EUROCRYPT, ed. by A. Joux. Lecture Notes in Computer Science, vol.\u00a05479 (Springer, Berlin, 2009), pp.\u00a0313\u2013332"},{"key":"9114_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/3-540-45353-9_16","volume-title":"CT\u2014RSA\u20192001","author":"M. Joye","year":"2001","unstructured":"M. Joye, J. Quisquater, M. Yung, On the power of misbehaving adversaries and security analysis of the original epoc, in CT\u2014RSA\u20192001. Lecture Notes in Computer Science, vol.\u00a02020 (Springer, Berlin, 2001), pp.\u00a0208\u2013222"},{"issue":"1","key":"9114_CR28","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s001450010015","volume":"14","author":"J. Kilian","year":"2001","unstructured":"J. Kilian, P. Rogaway, How to protect DES against exhaustive key search (an analysis of DESX). J.\u00a0Cryptol.\n                  14(1), 17\u201335 (2001). Early version in CRYPTO\u201996","journal-title":"J.\u00a0Cryptol."},{"key":"9114_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-642-01001-9_34","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2009","author":"E. Kiltz","year":"2009","unstructured":"E. Kiltz, K. Pietrzak, M. Stam, M. Yung, A\u00a0new randomness extraction paradigm for hybrid encryption, in Advances in Cryptology\u2014EUROCRYPT 2009, ed. by A. Joux. Lecture Notes in Computer Science, vol.\u00a05479 (Springer, Berlin, 2009), pp.\u00a0590\u2013609"},{"key":"9114_CR30","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\u2014CRYPTO 2004","author":"K. Kurosawa","year":"2004","unstructured":"K. Kurosawa, Y. Desmedt, A\u00a0new paradigm of hybrid encryption scheme, in Advances in Cryptology\u2014CRYPTO 2004, ed. by M.\u00a0Franklin. Lecture Notes in Computer Science, vol.\u00a03152 (Springer, Berlin, 2004), pp.\u00a0426\u2013442"},{"key":"9114_CR31","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology\u2014CRYPTO\u201993","author":"C. Lim","year":"1993","unstructured":"C. Lim, P. Lee, Another method for attaining security against adaptively chosen ciphertext attacks, in Advances in Cryptology\u2014CRYPTO\u201993, ed. by D.\u00a0Stinson. Lecture Notes in Computer Science, vol.\u00a0773 (Springer, Berlin, 1993)"},{"key":"9114_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-39200-9_15","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201903","author":"Y. Lindell","year":"2003","unstructured":"Y. Lindell, A simpler construction of cca2-secure public-key encryption under general assumptions, in Advances in Cryptology\u2014EUROCRYPT\u201903, ed. by E.\u00a0Biham. Lecture Notes in Computer Science, vol.\u00a02656 (Springer, Berlin, 2003), pp.\u00a0241\u2013254"},{"key":"9114_CR33","first-page":"427","volume-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC\u201990)","author":"M. Naor","year":"1990","unstructured":"M. Naor, M. Yung, Public-key cryptosystems provably secure against chosen ciphertext attacks, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC\u201990) (1990), pp.\u00a0427\u2013437"},{"key":"9114_CR34","series-title":"Lecture Notes in Computer Science","first-page":"159","volume-title":"CT\u2014RSA\u20192001","author":"T. Okamoto","year":"2001","unstructured":"T. Okamoto, D. Pointcheval, REACT: Rapid enhanced-security asymmetric cryptosystem transform, in CT\u2014RSA\u20192001. Lecture Notes in Computer Science, vol.\u00a02020 (Springer, Berlin, 2001), pp.\u00a0159\u2013175"},{"key":"9114_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201998","author":"T. Okamoto","year":"1998","unstructured":"T. Okamoto, S. Uchiyama, A new public-key cryptosystem as secure as factoring, in Advances in Cryptology\u2014EUROCRYPT\u201998, ed. by K. Nyberg. Lecture Notes in Computer Science, vol.\u00a01403 (Springer, Berlin, 1998), pp.\u00a0308\u2013318"},{"key":"9114_CR36","unstructured":"T. Okamoto, S. Uchiyama, E. Fujisaki, EPOC: Efficient probabilistic public-key encryption. Submission to IEEE P1363. \n                    http:\/\/info.isl.ntt.co.jp\/epoc"},{"key":"9114_CR37","volume-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC\u201908)","author":"C. Peikert","year":"2008","unstructured":"C. Peikert, B. Waters, Lossy trapdoor functions and their applications, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC\u201908) (2008)"},{"key":"9114_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-30539-2_5","volume-title":"Advances in Cryptology\u2014Asiacrypt 2004","author":"D.H. Phan","year":"2004","unstructured":"D.H. Phan, D. Pointcheval, OAEP 3-round: A generic and secure asymmetric encryption padding, in Advances in Cryptology\u2014Asiacrypt 2004, ed. by P.J. Lee. Lecture Notes in Computer Science, vol.\u00a03329 (Springer, Berlin, 2004), pp.\u00a063\u201378"},{"key":"9114_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-540-46588-1_10","volume-title":"3rd International Workshop on Practice and Theory in Public Key Cryptography\u2014PKC\u201900","author":"D. Pointcheval","year":"2000","unstructured":"D. Pointcheval, Chosen-ciphertext security for any one-way cryptosystem, in 3rd International Workshop on Practice and Theory in Public Key Cryptography\u2014PKC\u201900, ed. by H. Imai, Y. Zheng. Lecture Notes in Computer Science, vol.\u00a01751 (Springer, Berlin, 2000), pp.\u00a0129\u2013146"},{"key":"9114_CR40","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\u2014CRYPTO\u201991","author":"C. Rackoff","year":"1992","unstructured":"C. Rackoff, D. Simon, Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack, in Advances in Cryptology\u2014CRYPTO\u201991, ed. by J. Feigenbaum. Lecture Notes in Computer Science, vol.\u00a0576 (Springer, Berlin, 1992), pp.\u00a0433\u2013444"},{"key":"9114_CR41","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\u2014TCC 2009","author":"A. Rosen","year":"2009","unstructured":"A. Rosen, G. Segev, Chosen-ciphertext security via correlated products, in Theory of Cryptography\u2014TCC 2009, ed. by O. Reingold. Lecture Notes in Computer Science, vol.\u00a05444 (Springer, Berlin, 2009), pp.\u00a0419\u2013436"},{"key":"9114_CR42","first-page":"543","volume-title":"Proceedings of the 40th IEEE Annual Symposium on Foundations of Computer Science (FOCS\u201999)","author":"A. Sahai","year":"1999","unstructured":"A. Sahai, Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security, in Proceedings of the 40th IEEE Annual Symposium on Foundations of Computer Science (FOCS\u201999) (1999), pp.\u00a0543\u2013553"},{"key":"9114_CR43","series-title":"Lecture Notes in Computer Science","first-page":"359","volume-title":"ICISC\u201902","author":"K. Sakurai","year":"2001","unstructured":"K. Sakurai, T. Takagi, A\u00a0reject timing attack on an ind-cca2 public-key cryptosystem, in ICISC\u201902. Lecture Notes in Computer Science, vol. 2587 (Springer, Berlin, 2001), pp.\u00a0359\u2013373"},{"key":"9114_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/3-540-44647-8_15","volume-title":"Advances in Cryptology\u2014CRYPTO2001","author":"V. Shoup","year":"2001","unstructured":"V. Shoup, OAEP Reconsidered, in Advances in Cryptology\u2014CRYPTO2001, ed. by J. Kilian. Lecture Notes in Computer Science, vol.\u00a02139 (Springer, Berlin, 2001), pp.\u00a0239\u2013259"},{"key":"9114_CR45","unstructured":"V. Shoup, A proposal for an ISO standard for public key encryption. Technical report, Cryptology ePrint Archive, Report 2001\/112, December 2001"},{"key":"9114_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/978-3-642-14623-7_17","volume-title":"CRYPTO","author":"H. Wee","year":"2010","unstructured":"H. Wee, Efficient chosen-ciphertext security via extractable hash proofs, in CRYPTO, ed. by T. Rabin. Lecture Notes in Computer Science, vol.\u00a06223 (Springer, Berlin, 2010), pp.\u00a0314\u2013332"},{"key":"9114_CR47","doi-asserted-by":"crossref","unstructured":"Y. Zheng, J. Seberry, Immunizing public key cryptosystems against chosen ciphertext attacks. J.\u00a0Sel. Areas Commun. 11(5) (1993)","DOI":"10.1109\/49.223871"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-011-9114-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-011-9114-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-011-9114-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-011-9114-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:07:43Z","timestamp":1586333263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-011-9114-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,2]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9114"],"URL":"https:\/\/doi.org\/10.1007\/s00145-011-9114-1","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,2]]},"assertion":[{"value":"20 April 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2011","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}