{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T00:13:52Z","timestamp":1715213632310},"reference-count":29,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2021,9,1]]},"DOI":"10.1587\/transfun.2020dmp0009","type":"journal-article","created":{"date-parts":[[2021,3,15]],"date-time":"2021-03-15T22:07:19Z","timestamp":1615846039000},"page":"1206-1218","source":"Crossref","is-referenced-by-count":0,"title":["Receiver Selective Opening CCA Secure Public Key Encryption from Various Assumptions"],"prefix":"10.1587","volume":"E104.A","author":[{"given":"Yi","family":"LU","sequence":"first","affiliation":[{"name":"Tokyo Institute of Technology"},{"name":"National Institute of Advanced Industrial Science and Technology (AIST)"}]},{"given":"Keisuke","family":"HARA","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"},{"name":"National Institute of Advanced Industrial Science and Technology (AIST)"}]},{"given":"Keisuke","family":"TANAKA","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] M. Alekhnovich, \u201cMore on average case vs approximation complexity,\u201d 44th FOCS, pp.298-307, 2003. 10.1109\/sfcs.2003.1238204"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M. Bellare, R. Dowsley, B. Waters, and S. Yilek, \u201cStandard security does not imply security against selective-opening,\u201d EUROCRYPT 2012, LNCS 7237, pp.645-662, 2012. 10.1007\/978-3-642-29011-4_38","DOI":"10.1007\/978-3-642-29011-4_38"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] M. Bellare, D. Hofheinz, and S. Yilek, \u201cPossibility and impossibility results for encryption and commitment secure under selective opening,\u201d EUROCRYPT 2009, LNCS 5479, pp.1-35, 2009. 10.1007\/978-3-642-01001-9_1","DOI":"10.1007\/978-3-642-01001-9_1"},{"key":"4","unstructured":"[4] M. Bellare and S. Yilek, \u201cEncryption schemes secure under selective opening attack,\u201d Cryptology ePrint Archive, Report 2009\/101, 20009."},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] R. Canetti, S. Halevi, and J. Katz, \u201cAdaptively-secure, non-interactive public-key encryption,\u201d TCC 2005, LNCS 3378, pp.150-168, 2005. 10.1007\/978-3-540-30576-7_9","DOI":"10.1007\/978-3-540-30576-7_9"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] G. Couteau and D. Hofheinz, \u201cDesignated-verifier pseudorandom generators, and their applications,\u201d EUROCRYPT 2019, Part II, LNCS 11477, pp.562-592, 2019. 10.1007\/978-3-030-17656-3_20","DOI":"10.1007\/978-3-030-17656-3_20"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] D. Dolev, C. Dwork, and M. Naor, \u201cNon-malleable cryptography (extended abstract),\u201d 23rd ACM STOC, pp.542-552, 1991. 10.1145\/103418.103474","DOI":"10.1145\/103418.103474"},{"key":"8","unstructured":"[8] E. Elkind and A. Sahai, \u201cA unified methodology for constructing public-key encryption schemes secure against adaptive chosen-ciphertext attack,\u201d Cryptology ePrint Archive, Report 2002\/042, 2002."},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] S. Goldwasser and S. Micali, \u201cProbabilistic Encryption,\u201d J. Comput. Syst. Sci., vol.28, no.2, pp.270-299, 1984. 10.1016\/0022-0000(84)90070-9","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] J. H\u00e5stad, R. Impagliazzo, L.A. Levin, and M. Luby, \u201cA pseudorandom generator from any one-way function,\u201d SIAM J. Comput., vol.28, no.4, pp.1364-1396, 1999. 10.1137\/s0097539793244708","DOI":"10.1137\/S0097539793244708"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] K. Hara, F. Kitagawa, T. Matsuda, G. Hanaoka, and K. Tanaka, \u201cSimulation-based receiver selective opening CCA secure PKE from standard computational assumptions,\u201d SCN'18, LNCS 11035, pp.140-159, 2018. 10.1007\/978-3-319-98113-0_8","DOI":"10.1007\/978-3-319-98113-0_8"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] K. Hara, F. Kitagawa, T. Matsuda, G. Hanaoka, and K. Tanaka, \u201cSimulation-based receiver selective opening CCA secure PKE from standard computational assumptions,\u201d Theor. Comput. Sci., vol.795, pp.570-597, 2019. 10.1016\/j.tcs.2019.08.016","DOI":"10.1016\/j.tcs.2019.08.016"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Z. Huang, J. Lai, W. Chen, M.H. Au, Z. Peng, and J. Li, \u201cSimulation-based selective opening security for receivers under chosen-ciphertext attacks,\u201d Des. Codes Cryptogr., vol.87, no.6, pp.1345-1371, 2019. 10.1007\/s10623-018-0530-1","DOI":"10.1007\/s10623-018-0530-1"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] K. Haralambiev, T. Jager, E. Kiltz, and V. Shoup, \u201cSimple and efficient public-key encryption from computational Diffie-Hellman in the standard model,\u201d PKC 2010, LNCS 6056, pp.1-18, 2010. 10.1007\/978-3-642-13013-7_1","DOI":"10.1007\/978-3-642-13013-7_1"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] C. Hazay, A. Patra, and B. Warinschi, \u201cSelective opening security for receivers,\u201d ASIACRYPT 2015, Part I, LNCS 9452, pp.443-469, 2015. 10.1007\/978-3-662-48797-6_19","DOI":"10.1007\/978-3-662-48797-6_19"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] D. Jia, X. Lu, and B. Li, \u201cReceiver selective opening security from indistinguishability obfuscation,\u201d INDOCRYPT 2016, LNCS 10095, pp.393-410, 2016. 10.1007\/978-3-319-49890-4_22","DOI":"10.1007\/978-3-319-49890-4_22"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] D. Jia, X. Lu, and B. Li, \u201cConstructions secure against receiver selective opening and chosen ciphertext attacks,\u201d CT-RSA 2017, LNCS 10159, pp.417-431, 2017. 10.1007\/978-3-319-52153-4_24","DOI":"10.1007\/978-3-319-52153-4_24"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] S. Katsumata, R. Nishimaki, S. Yamada, and T. Yamakawa, \u201cDesignated verifier\/prover and preprocessing NIZKs from Diffie-Hellman assumptions,\u201d EUROCRYPT 2019, Part II, LNCS 11477, pp.622-651, 2019. 10.1007\/978-3-030-17656-3_22","DOI":"10.1007\/978-3-030-17656-3_22"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] F. Kitagawa and T. Matsuda, \u201cCPA-to-CCA transformation for KDM security,\u201d TCC 2019, Part II, LNCS 11892, pp.118-148, 2019. 10.1007\/978-3-030-36033-7_5","DOI":"10.1007\/978-3-030-36033-7_5"},{"key":"20","unstructured":"[20] L. Lamport, \u201cConstructing digital signatures from a one-way function,\u201d Technical Report SRI-CSL-98, SRI International Computer Science Laboratory, Oct. 1979."},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] Y. Lindell, \u201cA simpler construction of cca2-secure public-key encryption under general assumptions,\u201d EUROCRYPT 2003, LNCS 2656, pp.241-254, 2003. 10.1007\/3-540-39200-9_15","DOI":"10.1007\/3-540-39200-9_15"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] A. Lombardi, W. Quach, R.D. Rothblum, D. Wichs, and D.J. Wu, \u201cNew constructions of reusable designated-verifier NIZKs,\u201d CRYPTO 2019, Part III, LNCS 11694, pp.670-700, 2019. 10.1007\/978-3-030-26954-8_22","DOI":"10.1007\/978-3-030-26954-8_22"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] Y. Lu, K. Hara, and K. Tanaka, \u201cReceiver selective opening CCA secure public key encryption from various assumptions,\u201d To appear in Provsec 2020.","DOI":"10.1007\/978-3-030-62576-4_11"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] M. Naor, \u201cBit commitment using pseudorandomness,\u201d J. Cryptol., vol.4, no.2, pp.151-158, Jan. 1991. 10.1007\/bf00196774","DOI":"10.1007\/BF00196774"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] M. Naor and M. Yung, \u201cPublic-key cryptosystems provably secure against chosen ciphertext attacks,\u201d 22nd ACM STOC, pp.427-437, 1990. 10.1145\/100216.100273","DOI":"10.1145\/100216.100273"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] C. Peikert and S. Shiehian, \u201cNoninteractive zero knowledge for NP from (plain) learning with errors,\u201d CRYPTO 2019, Part I, LNCS 11692, pp.89-114, 2019. 10.1007\/978-3-030-26948-7_4","DOI":"10.1007\/978-3-030-26948-7_4"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] W. Quach, R.D. Rothblum, and D. Wichs, \u201cReusable designated-verifier NIZKs for all NP from CDH,\u201d EUROCRYPT 2019, Part II, LNCS 11477, pp.593-621, 2019. 10.1007\/978-3-030-17656-3_21","DOI":"10.1007\/978-3-030-17656-3_21"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] O. Regev, \u201cOn lattices, learning with errors, random linear codes, and cryptography,\u201d 37th ACM STOC, pp.84-93, 2005. 10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] Y. Yu and J. Zhang, \u201cCryptography with auxiliary input and trapdoor from constant-noise LPN,\u201d CRYPTO 2016, Part I, LNCS 9814, pp.214-243, 2016. 10.1007\/978-3-662-53018-4_9","DOI":"10.1007\/978-3-662-53018-4_9"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/9\/E104.A_2020DMP0009\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T04:39:47Z","timestamp":1715143187000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/9\/E104.A_2020DMP0009\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,1]]},"references-count":29,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2020dmp0009","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,1]]},"article-number":"2020DMP0009"}}