{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:50:39Z","timestamp":1760079039600},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2004,9,21]],"date-time":"2004-09-21T00:00:00Z","timestamp":1095724800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Inf Secur"],"published-print":{"date-parts":[[2005,10]]},"DOI":"10.1007\/s10207-004-0042-z","type":"journal-article","created":{"date-parts":[[2004,9,20]],"date-time":"2004-09-20T11:18:15Z","timestamp":1095679095000},"page":"228-241","source":"Crossref","is-referenced-by-count":5,"title":["Fujisaki\u2013Okamoto hybrid encryption revisited"],"prefix":"10.1007","volume":"4","author":[{"given":"David","family":"Galindo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebasti\u00e0","family":"Mart\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paz","family":"Morillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge L.","family":"Villar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2004,9,21]]},"reference":[{"key":"42_CRBDPR98","doi-asserted-by":"crossref","unstructured":"Bellare M, Desai A, Pointcheval D, Rogaway P (1998) Relations among notions of security for public-key encryption schemes. In: Krawczyk H (ed) Advances in Cryptology \u2013 CRYPTO 1998. Lecture notes in computer science, vol 1462. Springer, Berlin Heidelberg New York, pp 26\u201345","DOI":"10.1007\/BFb0055718"},{"key":"42_CRBR93","doi-asserted-by":"crossref","unstructured":"Bellare M, Rogaway P (1993) Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM conference on computer and communications security. ACM Press, New York, pp 62\u201373","DOI":"10.1145\/168588.168596"},{"key":"42_CRBBP04","doi-asserted-by":"crossref","unstructured":"Bellare M, Boldyreva A, Palacio A (2004) An uninstantiable Random-Oracle-Model scheme for a hybrid-encryption problem. In: Cachin C, Camenisch J (eds) Advances in Cryptology \u2013 EUROCRYPT 2004. Lecture notes in computer science, vol 3027. Springer, Berlin Heidelberg New York, pp 449\u2013461","DOI":"10.1007\/978-3-540-24676-3_11"},{"key":"42_CRCGH98","doi-asserted-by":"crossref","unstructured":"Canetti R, Goldreich O, Halevi S (1998) The random oracle methodology, revisited. In: Proceedings of the 32nd annual ACM symposium on theory of computing. ACM Press, New York, pp 209\u2013218","DOI":"10.1145\/276698.276741"},{"key":"42_CRCGHN01","doi-asserted-by":"crossref","unstructured":"Catalano D, Gennaro R, Howgrave-Graham N, Nguyen PQ (2001) Paillier\u2019s cryptosystem revisited. In: Proceedings of the 8th ACM conference on computer and communications security. ACM Press, New York, pp 206\u2013214","DOI":"10.1145\/501983.502012"},{"key":"42_CRGEM02","doi-asserted-by":"crossref","unstructured":"Coron J, Handschuh H, Joye M, Paillier P, Pointcheval D, Tymen C (2002) GEM: a generic chosen-ciphertext secure encryption method. In: Preneel B (ed) Topics in Cryptology \u2013 CT-RSA 2002. Lecture notes in computer science, vol 2271. Springer, Berlin Heidelberg New York, pp 263\u2013276","DOI":"10.1007\/3-540-45760-7_18"},{"key":"42_CROEM02","doi-asserted-by":"crossref","unstructured":"Coron J, Handschuh H, Joye M, Paillier P, Pointcheval D, Tymen C (2002) Optimal chosen-ciphertext secure encryption of arbitrary-length messages. In: Naccache D, Paillier P (eds) Public key cryptography, PKC 2002. Lecture notes in computer science, vol 2274. Springer, Berlin Heidelberg New York, pp 17\u201333","DOI":"10.1007\/3-540-45664-3_2"},{"key":"42_CRCS02","doi-asserted-by":"crossref","unstructured":"Cramer R, Shoup V (2002) Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen LR (ed) Advances in Cryptology \u2013 EUROCRYPT 2002. Lecture notes in computer science, vol 2332. Springer, Berlin Heidelberg New York, pp 45\u201364","DOI":"10.1007\/3-540-46035-7_4"},{"key":"42_CRDen02","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1049\/el:20020288","volume":"38","author":"Dent","year":"2002","unstructured":"Dent AW (2002) An implementation attack against the EPOC-2 public-key cryptosystem. Electron Lett 38(9):412\u2013413","journal-title":"Electron Lett"},{"key":"42_CREPOC","unstructured":"EPOC, Efficient probabilistic public-key encryption. http:\/\/info.isl.ntt.co.jp\/epoc\/"},{"key":"42_CRFO99","doi-asserted-by":"crossref","unstructured":"Fujisaki E, Okamoto T (1999) Secure integration of asymmetric and symmetric encryption schemes. In: Wiener MJ (ed) Advances in Cryptology \u2013 CRYPTO 1999. Lecture notes in computer science, vol 1666. Springer, Berlin Heidelberg New York, pp 537\u2013554","DOI":"10.1007\/3-540-48405-1_34"},{"key":"42_CRFO01","unstructured":"Fujisaki E, Okamoto T (2001) A chosen-cipher secure encryption scheme tightly as secure as factoring. IEICE Trans Fundament E84-A(1):179\u2013187"},{"key":"42_CRGM84","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"Golwasser","year":"1984","unstructured":"Golwasser S, Micali S (1984) Probabilistic encryption. J Comput Sys Sci 28:270\u2013299","journal-title":"J Comput Sys Sci"},{"key":"42_CRGT03","doi-asserted-by":"crossref","unstructured":"Goldwasser S, Tauman Y (2003) On the (in)security of the Fiat-Shamir paradigm. In: Proceedings of the 44th symposium on foundations of computer science (FOCS 2003). IEEE Press, New York, pp 102\u2013115","DOI":"10.1109\/SFCS.2003.1238185"},{"key":"42_CRJQY01","doi-asserted-by":"crossref","unstructured":"Joye M, Quisquater J J, Yung M (2001) On the power of misbehaving adversaries and security analysis of the original EPOC. In: Naccache D (ed) Topics in Cryptology \u2013 CT-RSA 2001. Lecture notes in computer science, vol 2020. Springer, Berlin Heidelberg New York, pp 208\u2013222","DOI":"10.1007\/3-540-45353-9_16"},{"key":"42_CRMen93","doi-asserted-by":"crossref","unstructured":"Menezes A (1993) Elliptic curve public-key cryptosystems. The Kluwer international series in engineering and computer science (SECS 234). Kluwer, Dordrecht","DOI":"10.1007\/978-1-4615-3198-2"},{"key":"42_CRNY90","doi-asserted-by":"crossref","unstructured":"Naor M, Yung M (1990) Public-key cryptosystems provably secure against chosen ciphertext attacks. In: Proceedings of the 32nd annual ACM symposium on theory of computing. ACM Press, New York, pp 427\u2013437","DOI":"10.1145\/100216.100273"},{"key":"42_CROP01a","doi-asserted-by":"crossref","unstructured":"Okamoto T, Pointcheval D (2001) The gap-problems: a new class of problems for the security of cryptographic schemes. In: Kim K (ed) Public Key Cryptography, PKC 2001. Lecture notes in computer science, vol 1992. Springer, Berlin Heidelberg New York, pp 104\u2013118","DOI":"10.1007\/3-540-44586-2_8"},{"key":"42_CROP01b","doi-asserted-by":"crossref","unstructured":"Okamoto T, Pointcheval D (2001) REACT: Rapid enhanced-security asymmetric cryptosystem transform. In: Naccache D (ed) Topics in Cryptology \u2013 CT-RSA 2001. Lecture notes in computer science, vol 2020. Springer, Berlin Heidelberg New York, pp 159\u2013175","DOI":"10.1007\/3-540-45353-9_13"},{"key":"42_CROU98","doi-asserted-by":"crossref","unstructured":"Okamoto T, Uchiyama S (1998) A New Public-Key Cryptosystem as Secure as Factoring. In: Nyberg K (ed) Advances in Cryptology \u2013 EUROCRYPT 1998. Lecture notes in computer science, vol 1403. Springer, Berlin Heidelberg New York, pp 308\u2013318","DOI":"10.1007\/BFb0054135"},{"key":"42_CRPSEC","unstructured":"PSEC, Provably Secure Encryption Scheme. http:\/\/info.isl.ntt.co.jp\/psec\/"},{"key":"42_CRPoi00","doi-asserted-by":"crossref","unstructured":"Pointcheval D (2000) Chosen-ciphertext security for any one-way cryptosystem. In: Imai H, Zheng Y (eds): Public Key Cryptography, PKC 2000. Lecture notes in computer science, vol 1751. Springer, Berlin Heidelberg New York, pp 129\u2013146","DOI":"10.1007\/978-3-540-46588-1_10"},{"key":"42_CRRS92","doi-asserted-by":"crossref","unstructured":"Rackoff C, Simon DR (1992) Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum J (ed) Advances in Cryptology \u2013 CRYPTO 1991. Lecture notes in computer science, vol 576. Springer, Berlin Heidelberg New York, pp 433\u2013444","DOI":"10.1007\/3-540-46766-1_35"},{"key":"42_CRST02","doi-asserted-by":"crossref","unstructured":"Sakurai K, Takagi T (2002) A reject timing attack on an IND-CCA2 public-key cryptosystem. In: Joong Lee P, Hoon Lim C (eds) Information Security and Cryptology \u2013 ICISC 2002. Lecture notes in computer science, vol 2587. Springer, Berlin Heidelberg New York, pp 359\u2013373","DOI":"10.1007\/3-540-36552-4_25"},{"key":"42_CRSho01","doi-asserted-by":"crossref","unstructured":"Shoup V (2001) OAEP Reconsidered. In: Kilian J (ed) Advances in Cryptology \u2013 CRYPTO 2001. Lecture notes in computer science, vol 2139. Springer, Berlin Heidelberg New York, pp 239\u2013259","DOI":"10.1007\/3-540-44647-8_15"},{"key":"42_CRSte03","doi-asserted-by":"crossref","unstructured":"Stern J (2003) Why provable security matters? In: Biham E (ed) Advances in Cryptology \u2013 EUROCRYPT 2003. Lecture notes in computer science, vol 2656. Springer, Berlin Heidelberg New York, pp 449\u2013461","DOI":"10.1007\/3-540-39200-9_28"},{"key":"42_CRWSI03","doi-asserted-by":"crossref","unstructured":"Watanabe Y, Shikata J, Imai H (2002) Equivalence between semantic security and indistinguishability against chosen ciphertext attacks. In: Biham E (ed) Advances in Cryptology \u2013 EUROCRYPT 2003. Lecture notes in computer science, vol 2567. Springer, Berlin Heidelberg New York, pp 71\u201384","DOI":"10.1007\/3-540-36288-6_6"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-004-0042-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-004-0042-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-004-0042-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,14]],"date-time":"2024-01-14T11:16:05Z","timestamp":1705230965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-004-0042-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9,21]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,10]]}},"alternative-id":["42"],"URL":"https:\/\/doi.org\/10.1007\/s10207-004-0042-z","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,9,21]]}}}