{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T23:56:22Z","timestamp":1772927782637,"version":"3.50.1"},"reference-count":24,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2026,3,1]]},"DOI":"10.1587\/transfun.2025cip0019","type":"journal-article","created":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T22:08:25Z","timestamp":1758233305000},"page":"216-231","source":"Crossref","is-referenced-by-count":0,"title":["On the Implications from Updatable Encryption to Public-Key Cryptographic Primitives"],"prefix":"10.1587","volume":"E109.A","author":[{"given":"Yuichi","family":"TANISHITA","sequence":"first","affiliation":[{"name":"The University of Tokyo"},{"name":"National Institute of Advanced Industrial Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryuya","family":"HAYASHI","sequence":"additional","affiliation":[{"name":"National Institute of Advanced Industrial Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryu","family":"ISHII","sequence":"additional","affiliation":[{"name":"Deloitte Tohmatsu Cyber LLC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takahiro","family":"MATSUDA","sequence":"additional","affiliation":[{"name":"National Institute of Advanced Industrial Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanta","family":"MATSUURA","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Y. Tanishita, R. Hayashi, R. Ishii, T. Matsuda, and K. Matsuura, \u201cOn the implications from updatable encryption to public-key cryptographic primitives,\u201d ACISP 24, Part I, Y.L. Tianqing Zhu, ed., LNCS, vol.14895, pp.303-323, Springer, Singapore, July 2024. 10.1007\/978-981-97-5025-2_16","DOI":"10.1007\/978-981-97-5025-2_16"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] D. Boneh, K. Lewi, H.W. Montgomery, and A. Raghunathan, \u201cKey homomorphic PRFs and their applications,\u201d CRYPTO 2013, Part I, R. Canetti and J.A. Garay, eds., LNCS, vol.8042, pp.410-428, Springer, Berlin, Heidelberg, Aug. 2013. 10.1007\/978-3-642-40041-4_23","DOI":"10.1007\/978-3-642-40041-4_23"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] A. Everspaugh, K.G. Paterson, T. Ristenpart, and S. Scott, \u201cKey rotation for authenticated encryption,\u201d CRYPTO 2017, Part III, J. Katz and H. Shacham, eds., LNCS, vol.10403, pp.98-129, Springer, Cham, Aug. 2017. 10.1007\/978-3-319-63697-9_4","DOI":"10.1007\/978-3-319-63697-9_4"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] N. Alamati, H. Montgomery, and S. Patranabis, \u201cSymmetric primitives with structured secrets,\u201d CRYPTO 2019, Part I, A. Boldyreva and D. Micciancio, eds., LNCS, vol.11692, pp.650-679, Springer, Cham, Aug. 2019. 10.1007\/978-3-030-26948-7_23","DOI":"10.1007\/978-3-030-26948-7_23"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] A. Lehmann and B. Tackmann, \u201cUpdatable encryption with post-compromise security,\u201d EUROCRYPT 2018, Part III, J.B. Nielsen and V. Rijmen, eds., LNCS, vol.10822, pp.685-716, Springer, Cham, April\/May 2018. 10.1007\/978-3-319-78372-7_22","DOI":"10.1007\/978-3-319-78372-7_22"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] M. Kloo\u00df, A. Lehmann, and A. Rupp, \u201c(R)CCA secure updatable encryption with integrity protection,\u201d EUROCRYPT 2019, Part I, Y. Ishai and V. Rijmen, eds., LNCS, vol.11476, pp.68-99, Springer, Cham, May 2019. 10.1007\/978-3-030-17653-2_3","DOI":"10.1007\/978-3-030-17653-2_3"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] C. Boyd, G.T. Davies, K. Gj\u00f8steen, and Y. Jiang, \u201cFast and secure updatable encryption,\u201d CRYPTO 2020, Part I, D. Micciancio and T. Ristenpart, eds., LNCS, vol.12170, pp.464-493, Springer, Cham, Aug. 2020. 10.1007\/978-3-030-56784-2_16","DOI":"10.1007\/978-3-030-56784-2_16"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] Y. Jiang, \u201cThe direction of updatable encryption does not matter much,\u201d ASIACRYPT 2020, Part III, S. Moriai and H. Wang, eds., LNCS, vol.12493, pp.529-558, Springer, Cham, Dec. 2020. 10.1007\/978-3-030-64840-4_18","DOI":"10.1007\/978-3-030-64840-4_18"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] R. Nishimaki, \u201cThe direction of updatable encryption does matter,\u201d PKC 2022, Part II, G. Hanaoka, J. Shikata, and Y. Watanabe, eds., LNCS, vol.13178, pp.194-224, Springer, Cham, March 2022. 10.1007\/978-3-030-97131-1_7","DOI":"10.1007\/978-3-030-97131-1_7"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] Y.J. Galteland and J. Pan, \u201cBackward-leak uni-directional updatable encryption from (homomorphic) public key encryption,\u201d PKC 2023, Part II, A. Boldyreva and V. Kolesnikov, eds., LNCS, vol.13941, pp.399-428, Springer, Cham, May 2023. 10.1007\/978-3-031-31371-4_14","DOI":"10.1007\/978-3-031-31371-4_14"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] R. Impagliazzo and S. Rudich, \u201cLimits on the provable consequences of one-way permutations,\u201d 21st ACM STOC, pp.44-61, ACM Press, May 1989. 10.1145\/73007.73012","DOI":"10.1145\/73007.73012"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] I. Damg\u00e5rd and J.B. Nielsen, \u201cImproved non-committing encryption schemes based on a general complexity assumption,\u201d CRYPTO 2000, M. Bellare, ed., LNCS, vol.1880, pp.432-450, Springer, Berlin, Heidelberg, Aug. 2000. 10.1007\/3-540-44598-6_27","DOI":"10.1007\/3-540-44598-6_27"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] M. Bellare, D. Hofheinz, and S. Yilek, \u201cPossibility and impossibility results for encryption and commitment secure under selective opening,\u201d EUROCRYPT 2009, A. Joux, ed., LNCS, vol.5479, pp.1-35, Springer, Berlin, Heidelberg, April 2009. 10.1007\/978-3-642-01001-9_1","DOI":"10.1007\/978-3-642-01001-9_1"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] Y. Gertner, S. Kannan, T. Malkin, O. Reingold, and M. Viswanathan, \u201cThe relationship between public key encryption and oblivious transfer,\u201d 41st FOCS, pp.325-335, IEEE Computer Society Press, Nov. 2000. 10.1109\/sfcs.2000.892121","DOI":"10.1109\/SFCS.2000.892121"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] P. Miao, S. Patranabis, and G.J. Watson, \u201cUnidirectional updatable encryption and proxy re-encryption from DDH,\u201d PKC 2023, Part II, A. Boldyreva and V. Kolesnikov, eds., LNCS, vol.13941, pp.368-398, Springer, Cham, May 2023. 10.1007\/978-3-031-31371-4_13","DOI":"10.1007\/978-3-031-31371-4_13"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] D. Boneh, S. Halevi, M. Hamburg, and R. Ostrovsky, \u201cCircular-secure encryption from decision Diffie-Hellman,\u201d CRYPTO 2008, D. Wagner, ed., LNCS, vol.5157, pp.108-125, Springer, Berlin, Heidelberg, Aug. 2008. 10.1007\/978-3-540-85174-5_7","DOI":"10.1007\/978-3-540-85174-5_7"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] A.W. Dent, \u201cThe Cramer-Shoup encryption scheme is plaintext aware in the standard model,\u201d EUROCRYPT 2006, S. Vaudenay, ed., LNCS, vol.4004, pp.289-307, Springer, Berlin, Heidelberg, May\/June 2006. 10.1007\/11761679_18","DOI":"10.1007\/11761679_18"},{"key":"18","unstructured":"[18] R. Nishimaki, \u201cThe direction of updatable encryption does matter,\u201d Cryptology ePrint Archive, Report 2021\/221, The latest version as of April 23, 2024."},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] S. Even, O. Goldreich, and A. Lempel, \u201cA randomized protocol for signing contracts,\u201d CRYPTO\u201982, D. Chaum, R.L. Rivest, and A.T. Sherman, eds., pp.205-210, Plenum Press, New York, USA, 1982. 10.1007\/978-1-4757-0602-4_19","DOI":"10.1007\/978-1-4757-0602-4_19"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] A.C.C. Yao, \u201cProtocols for secure computations (extended abstract),\u201d 23rd FOCS, pp.160-164, IEEE Computer Society Press, Nov. 1982. 10.1109\/sfcs.1982.38","DOI":"10.1109\/SFCS.1982.38"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] D. Boneh, S. Eskandarian, S. Kim, and M. Shih, \u201cImproving speed and security in updatable encryption schemes,\u201d ASIACRYPT 2020, Part III, S. Moriai and H. Wang, eds., LNCS, vol.12493, pp.559-589, Springer, Cham, Dec. 2020. 10.1007\/978-3-030-64840-4_19","DOI":"10.1007\/978-3-030-64840-4_19"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] M. Bellare and C. Namprempre, \u201cAuthenticated encryption: Relations among notions and analysis of the generic composition paradigm,\u201d ASIACRYPT 2000, T. Okamoto, ed., LNCS, vol.1976, pp.531-545, Springer, Berlin, Heidelberg, Dec. 2000. 10.1007\/3-540-44448-3_41","DOI":"10.1007\/3-540-44448-3_41"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] L. Chen, Y. Li, and Q. Tang, \u201cCCA updatable encryption against malicious re-encryption attacks,\u201d ASIACRYPT 2020, Part III, S. Moriai and H. Wang, eds., LNCS, vol.12493, pp.590-620, Springer, Cham, Dec. 2020. 10.1007\/978-3-030-64840-4_20","DOI":"10.1007\/978-3-030-64840-4_20"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] H. Chen, Y.J. Galteland, and K. Liang, \u201cCCA-1 secure updatable encryption with adaptive security,\u201d ASIACRYPT 2023, Part V, J. Guo and R. Steinfeld, eds., LNCS, vol.14442, pp.374-406, Springer, Singapore, Dec. 2023. 10.1007\/978-981-99-8733-7_12","DOI":"10.1007\/978-981-99-8733-7_12"}],"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\/E109.A\/3\/E109.A_2025CIP0019\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T04:11:10Z","timestamp":1772856670000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025CIP0019\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,1]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2025cip0019","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,1]]},"article-number":"2025CIP0019"}}