{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:42:23Z","timestamp":1780634543967,"version":"3.54.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030971304","type":"print"},{"value":"9783030971311","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-97131-1_7","type":"book-chapter","created":{"date-parts":[[2022,2,26]],"date-time":"2022-02-26T20:35:11Z","timestamp":1645907711000},"page":"194-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["The Direction of Updatable Encryption Does Matter"],"prefix":"10.1007","author":[{"given":"Ryo","family":"Nishimaki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,2,27]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-03515-4_1","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2013","author":"Y Aono","year":"2013","unstructured":"Aono, Y., Boyen, X., Phong, L.T., Wang, L.: Key-private proxy re-encryption under LWE. In: Paul, G., Vaudenay, S. (eds.) INDOCRYPT 2013. LNCS, vol. 8250, pp. 1\u201318. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03515-4_1"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-29011-4_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"G Asharov","year":"2012","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold FHE. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 483\u2013501. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_29"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/978-3-030-26948-7_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"N Alamati","year":"2019","unstructured":"Alamati, N., Montgomery, H., Patranabis, S.: Symmetric primitives with structured secrets. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 650\u2013679. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_23"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-030-56784-2_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"C Boyd","year":"2020","unstructured":"Boyd, C., Davies, G.T., Gj\u00f8steen, K., Jiang, Y.: Fast and secure updatable encryption. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 464\u2013493. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_16"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-030-64840-4_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"D Boneh","year":"2020","unstructured":"Boneh, D., Eskandarian, S., Kim, S., Shih, M.: Improving speed and security in updatable encryption schemes. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 559\u2013589. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_19"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-36362-7_1","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"Z Brakerski","year":"2013","unstructured":"Brakerski, Z., Gentry, C., Halevi, S.: Packed ciphertexts in LWE-based homomorphic encryption. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 1\u201313. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_1"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. J. ACM, 59(2), 6:1\u20136:48 (2012)","DOI":"10.1145\/2160158.2160159"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, C.G.V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6(3), 13:1\u201313:36 (2014)","DOI":"10.1145\/2633600"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-40041-4_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Lewi, K., Montgomery, H., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 410\u2013428. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_23"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from Ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_29"},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. SIAM J. Comput. 43(2), 831\u2013871 (2014)","journal-title":"SIAM J. Comput."},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-54631-0_6","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"N Chandran","year":"2014","unstructured":"Chandran, N., Chase, M., Liu, F.-H., Nishimaki, R., Xagawa, K.: Re-encryption, functional re-encryption, and multi-hop re-encryption: a framework for achieving obfuscation-based security and instantiations from lattices. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 95\u2013112. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_6"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-030-64840-4_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"L Chen","year":"2020","unstructured":"Chen, L., Li, Y., Tang, Q.: CCA updatable encryption against malicious re-encryption attacks. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 590\u2013620. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_20"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-030-75245-3_19","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"N D\u00f6ttling","year":"2021","unstructured":"D\u00f6ttling, N., Nishimaki, R.: Universal proxy re-encryption. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12710, pp. 512\u2013542. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_19"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-319-63697-9_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"A Everspaugh","year":"2017","unstructured":"Everspaugh, A., Paterson, K., Ristenpart, T., Scott, S.: Key rotation for authenticated encryption. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 98\u2013129. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_4"},{"key":"7_CR16","first-page":"559","volume":"2021","author":"A Fabrega","year":"2021","unstructured":"Fabrega, A., Maurer, U., Mularczyk, M.: A fresh approach to updatable symmetric encryption. IACR Cryptol. ePrint Arch. 2021, 559 (2021)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, Stanford University (2009). crypto.stanford.edu\/craig","DOI":"10.1145\/1536414.1536440"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-662-53890-6_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"S Han","year":"2016","unstructured":"Han, S., Liu, S., Lyu, L.: Efficient KDM-CCA secure public-key encryption for polynomial functions. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 307\u2013338. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_11"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-030-64840-4_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"Y Jiang","year":"2020","unstructured":"Jiang, Y.: The direction of updatable encryption does not matter much. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 529\u2013558. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_18"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: STOC 2021 (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-030-17653-2_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"M Kloo\u00df","year":"2019","unstructured":"Kloo\u00df, M., Lehmann, A., Rupp, A.: (R)CCA secure updatable encryption with integrity protection. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 68\u201399. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_3"},{"key":"7_CR22","first-page":"538","volume":"2021","author":"F Levy-dit-Vehel","year":"2021","unstructured":"Levy-dit-Vehel, F., Rom\u00e9as, M.: A composable look at updatable encryption. IACR Cryptol. ePrint Arch. 2021, 538 (2021)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-319-78372-7_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"A Lehmann","year":"2018","unstructured":"Lehmann, A., Tackmann, B.: Updatable encryption with\u00a0post-compromise security. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 685\u2013716. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_22"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Nishimaki, R.: The direction of updatable encryption does matter. IACR Cryptol. ePrint Arch. 221 (2021)","DOI":"10.1007\/978-3-030-97131-1_7"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Nishimaki, R., Xagawa, K.: Key-private proxy re-encryption from lattices, revisited. IEICE Trans. 98-A(1), 100\u2013116 (2015)","DOI":"10.1587\/transfun.E98.A.100"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Egev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34:1\u201334:40 (2009)","DOI":"10.1145\/1568318.1568324"},{"key":"7_CR27","first-page":"268","volume":"2021","author":"D Slamanig","year":"2021","unstructured":"Slamanig, D., Striecks, C.: Puncture \u2019Em all: stronger updatable encryption with no-directional key updates. IACR Cryptol. ePrint Arch. 2021, 268 (2021)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"3","key":"7_CR28","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1137\/15M1030108","volume":"50","author":"A Sahai","year":"2021","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. SIAM J. Comput. 50(3), 857\u2013908 (2021)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-97131-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T10:22:09Z","timestamp":1726741329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-97131-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030971304","9783030971311"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-97131-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"137","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}