{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T01:39:12Z","timestamp":1649209152653},"reference-count":27,"publisher":"Oxford University Press (OUP)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1093\/comjnl\/bxv040","type":"journal-article","created":{"date-parts":[[2015,6,9]],"date-time":"2015-06-09T03:16:31Z","timestamp":1433819791000},"page":"2738-2746","source":"Crossref","is-referenced-by-count":0,"title":["Public-Key Encryption Schemes with Bounded CCA Security and Optimal Ciphertext Length Based on the CDH and HDH Assumptions"],"prefix":"10.1093","volume":"58","author":[{"given":"Mayana","family":"Pereira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Dowsley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anderson C.A.","family":"Nascimento","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goichiro","family":"Hanaoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2015,6,8]]},"reference":[{"key":"2015092807580531000_58.10.2738.1","doi-asserted-by":"crossref","unstructured":"Cramer R. , Hanaoka G. , Hofheinz D. , Imai H. , Kiltz E. , Pass R. , Shelat A. , Vaikuntanathan V. (2007) Bounded CCA2-Secure Encryption. In Kurosawa K. (ed.), Advances in Cryptology \u2013 ASIACRYPT 2007, Kuching, Malaysia, December 2\u20136, Lecture Notes in Computer Science, Vol. 4833, pp. 502\u2013518. Springer, Berlin, Germany.","DOI":"10.1007\/978-3-540-76900-2_31"},{"key":"2015092807580531000_58.10.2738.2","doi-asserted-by":"crossref","unstructured":"Rackoff C. , Simon D.R. (1992) Non-Interactive Zero-knowledge Proof of Knowledge and Chosen Ciphertext Attack. In Feigenbaum J. (ed.), Advances in Cryptology \u2013 CRYPTO\u201991, Santa Barbara, CA, USA, August 11\u201315, Lecture Notes in Computer Science, Vol. 576, pp. 433\u2013444. Springer, Berlin, Germany.","DOI":"10.1007\/3-540-46766-1_35"},{"key":"2015092807580531000_58.10.2738.3","doi-asserted-by":"crossref","unstructured":"Cramer R. , Shoup V. (1998) A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack. In Krawczyk H. (ed.), Advances in Cryptology \u2013 CRYPTO\u201998, Santa Barbara, CA, USA, August 23\u201327, Lecture Notes in Computer Science, Vol. 1462, pp. 13\u201325. Springer, Berlin, Germany.","DOI":"10.1007\/BFb0055717"},{"key":"2015092807580531000_58.10.2738.4","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 L R. (ed.), Advances in Cryptology \u2013 EUROCRYPT 2002, Amsterdam, The Netherlands, April 28\u2013May 2, Lecture Notes in Computer Science, Vol. 2332, pp. 45\u201364. Springer, Berlin, Germany.","DOI":"10.1007\/3-540-46035-7_4"},{"key":"2015092807580531000_58.10.2738.5","doi-asserted-by":"crossref","unstructured":"Peikert C. , Waters B. (2008) Lossy Trapdoor Functions and their Applications. In Ladner R.E. , Dwork C. (eds.), 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17\u201320, pp. 187\u2013196. ACM Press.","DOI":"10.1145\/1374376.1374406"},{"key":"2015092807580531000_58.10.2738.6","doi-asserted-by":"crossref","unstructured":"Cramer R. , Hofheinz D. , Kiltz E. (2010) A Twist on the Naor\u2013Yung Paradigm and its Application to Efficient CCA-secure Encryption from Hard Search Problems. In Micciancio D. (ed.), TCC 2010: 7th Theory of Cryptography Conference, Zurich, Switzerland, February 9\u201311, Lecture Notes in Computer Science, Vol. 5978, pp. 146\u2013164. Springer, Berlin, Germany.","DOI":"10.1007\/978-3-642-11799-2_10"},{"key":"2015092807580531000_58.10.2738.7","doi-asserted-by":"crossref","unstructured":"Haralambiev K. , Jager T. , Kiltz E. , Shoup V. (2010) Simple and Efficient Public-Key Encryption from Computational Diffie\u2013Hellman in the Standard Model. In Nguyen P.Q. , Pointcheval D. (eds), PKC 2010: 13th Int. Conf. Theory and Practice of Public Key Cryptography, Paris, France, May 26\u201328, Lecture Notes in Computer Science, Vol. 6056, pp. 1\u201318. Springer, Berlin, Germany.","DOI":"10.1007\/978-3-642-13013-7_1"},{"key":"2015092807580531000_58.10.2738.8","doi-asserted-by":"crossref","unstructured":"Hofheinz D. , Kiltz E. (2009) Practical Chosen Ciphertext Secure Encryption from Factoring. In Joux A. (ed.), Advances in Cryptology \u2013 EUROCRYPT 2009, Cologne, Germany, April 26\u201330, Lecture Notes in Computer Science, Vol. 5479, pp. 313\u2013332. Springer, Berlin, Germany.","DOI":"10.1007\/978-3-642-01001-9_18"},{"key":"2015092807580531000_58.10.2738.9","doi-asserted-by":"crossref","unstructured":"Dowsley R. , M\u00fcller-Quade J. , Nascimento A.C.A. (2009) A CCA2 Secure Public Key Encryption Scheme based on the McEliece Assumptions in the Standard Model. In Fischlin M. (ed.), Topics in Cryptology \u2013 CT-RSA, San Francisco, CA, USA, April 20\u201324, Lecture Notes in Computer Science, Vol. 5473, pp. 240\u2013251. Springer, Berlin, Germany.","DOI":"10.1007\/978-3-642-00862-7_16"},{"key":"2015092807580531000_58.10.2738.10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2203582"},{"key":"2015092807580531000_58.10.2738.11","doi-asserted-by":"crossref","unstructured":"Peikert C. (2009) Public-Key Cryptosystems from the Worst-case Shortest Vector Problem: Extended Abstract. In Mitzenmacher M. (ed.), 41st Annual ACM Symposium on Theory of Computing, Bethesda, MD, USA, May 31\u2013June 2, pp. 333\u2013342. ACM Press.","DOI":"10.1145\/1536414.1536461"},{"key":"2015092807580531000_58.10.2738.12","doi-asserted-by":"crossref","unstructured":"Dolev D. , Dwork C. , Naor M. (1991) Non-Malleable Cryptography. 23rd Annual ACM Symposium on Theory of Computing, New Orleans, LA, USA, May 6\u20138, pp. 542\u2013552. ACM Press.","DOI":"10.1145\/103418.103474"},{"key":"2015092807580531000_58.10.2738.13","doi-asserted-by":"crossref","unstructured":"Naor M. , Yung M. (1990) Public-Key Cryptosystems Provably Secure Against Chosen Ciphertext Attacks. 22nd Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 14\u201316, pp. 427\u2013437. ACM Press.","DOI":"10.1145\/100216.100273"},{"key":"2015092807580531000_58.10.2738.14","doi-asserted-by":"crossref","unstructured":"Sahai A. (1999) Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. 40th Annual Symposium on Foundations of Computer Science, New York, NY, USA, October 17\u201319, pp. 543\u2013553. IEEE Computer Society Press.","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"2015092807580531000_58.10.2738.15","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0345-x"},{"key":"2015092807580531000_58.10.2738.16","doi-asserted-by":"crossref","unstructured":"Boneh D. , Franklin M.K. (2001) Identity-based Encryption from the Weil Pairing. In Kilian J. (ed.), Advances in Cryptology \u2013 CRYPTO 2001, Santa Barbara, CA, USA, August 19\u201323, Lecture Notes in Computer Science, Vol. 2139, pp. 213\u2013229. Springer, Berlin, Germany.","DOI":"10.1007\/3-540-44647-8_13"},{"key":"2015092807580531000_58.10.2738.17","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970544713X"},{"key":"2015092807580531000_58.10.2738.18","doi-asserted-by":"crossref","unstructured":"Hanaoka G. , Kurosawa K. (2008) Efficient Chosen Ciphertext Secure Public Key Encryption Under the Computational Diffie\u2013Hellman Assumption. In Pieprzyk J. (ed.), Advances in Cryptology \u2013 ASIACRYPT 2008, Melbourne, Australia, December 7\u201311, Lecture Notes in Computer Science, Vol. 5350, pp. 308\u2013325. Springer, Berlin, Germany.","DOI":"10.1007\/978-3-540-89255-7_19"},{"key":"2015092807580531000_58.10.2738.19","doi-asserted-by":"crossref","unstructured":"Pereira M. , Dowsley R. , Hanaoka G. , Nascimento A.C.A. (2010) Public Key Encryption Schemes with Bounded CCA Security and Optimal Ciphertext Length Based on the CDH Assumption. In Burmester M. , Tsudik G. , Magliveras S.S. , Ilic I. (eds), ISC 2010: 13th Int. Conf. Information Security, Boca Raton, FL, USA, October 25\u201328, Lecture Notes in Computer Science, Vol. 6531, pp. 299\u2013306. Springer, Berlin, Germany.","DOI":"10.1007\/978-3-642-18178-8_26"},{"key":"2015092807580531000_58.10.2738.20","unstructured":"Shoup V. (2004) Sequences of Games: A Tool for Taming Complexity in Security Proofs. Cryptology ePrint Archive, Report 2004\/332. http:\/\/eprint.iacr.org ."},{"key":"2015092807580531000_58.10.2738.21","doi-asserted-by":"crossref","unstructured":"Rosen A. , Segev G. (2009) Chosen-ciphertext Security Via Correlated Products. In Reingold O. , (ed.), TCC 2009: 6th Theory of Cryptography Conference, March 15\u201317, Lecture Notes in Computer Science, Vol. 5444, pp. 419\u2013436. Springer, Berlin, Germany.","DOI":"10.1007\/978-3-642-00457-5_25"},{"key":"2015092807580531000_58.10.2738.22","doi-asserted-by":"crossref","unstructured":"Hofheinz D. , Kiltz E. (2007) Secure Hybrid Encryption from Weakened Key Encapsulation. In Menezes A. , (ed.), Advances in Cryptology \u2013 CRYPTO 2007, Santa Barbara, CA, USA, August 19\u201323, Lecture Notes in Computer Science, Vol. 4622, pp. 553\u2013 571. Springer, Berlin, Germany.","DOI":"10.1007\/978-3-540-74143-5_31"},{"key":"2015092807580531000_58.10.2738.23","unstructured":"Hanaoka G. , Imai H. (2006) A Generic Construction of CCA-secure Cryptosystems Without nizkp for a Bounded Number of Decryption Queries. Cryptology ePrint Archive, Report 2006\/408. http:\/\/eprint.iacr.org (accessed September 15, 2014)."},{"key":"2015092807580531000_58.10.2738.24","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-009-9041-6"},{"key":"2015092807580531000_58.10.2738.25","doi-asserted-by":"crossref","unstructured":"Goldreich O. , Levin L.A. (1989) A Hard-Core Predicate for all One-way Functions. 21st Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 15\u201317, pp. 25\u201332. ACM Press.","DOI":"10.1145\/73007.73010"},{"key":"2015092807580531000_58.10.2738.26","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403773"},{"key":"2015092807580531000_58.10.2738.27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2010.07.002"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/58\/10\/2738\/5096573\/bxv040.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T11:30:49Z","timestamp":1566819049000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxv040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,8]]},"references-count":27,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2015,9,28]]},"published-print":{"date-parts":[[2015,10]]}},"alternative-id":["10.1093\/comjnl\/bxv040"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxv040","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,8]]}}}