{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T05:17:48Z","timestamp":1781155068437,"version":"3.54.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Austrian Science Fund"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We propose a novel variant of functional encryption which supports ciphertext updates, dubbed ciphertext-updatable functional encryption. Such a feature further broadens the practical applicability of the functional encryption paradigm and allows for fine-grained access control even after a ciphertext is generated. Updating ciphertexts is carried out via so-called update tokens which a dedicated party can use to convert ciphertexts. However, allowing update tokens requires some care for the security definition. Our contribution is threefold:<jats:list list-type=\"order\"><jats:list-item><jats:p>We define our new primitive with a security notion in the indistinguishability setting. Within CUFE, functional decryption keys<jats:italic>and<\/jats:italic>ciphertexts are labeled with tags such that only if the tags of the decryption key and the ciphertext match, then decryption succeeds. Furthermore, we allow ciphertexts to switch their tags to any other tag via update tokens. Such tokens are generated by the holder of the main secret key and can only be used in the desired direction.<\/jats:p><\/jats:list-item><jats:list-item><jats:p>We present a generic construction of CUFE for any functionality as well as predicates different from equality testing on tags which relies on the existence of indistinguishability obfuscation (iO).<\/jats:p><\/jats:list-item><jats:list-item><jats:p>We present a practical construction of CUFE for the inner-product functionality from standard assumptions (i.e., LWE) in the random-oracle model. On the technical level, we build on the recent functional encryption schemes with fine-grained access control and linear operations on encrypted data (Abdalla et al., AC\u201920) and introduce an additional ciphertext updatability feature. Proving security for such a construction turned out to be non-trivial, particularly when revealing keys for the updated challenge ciphertext is allowed. Overall, such construction enriches the set of known inner-product functional encryption schemes with the additional updatability feature of ciphertexts.<\/jats:p><\/jats:list-item><\/jats:list><\/jats:p>","DOI":"10.1007\/s00145-023-09486-y","type":"journal-article","created":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T18:02:12Z","timestamp":1702663332000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["(Inner-Product) Functional Encryption with Updatable Ciphertexts"],"prefix":"10.1007","volume":"37","author":[{"given":"Valerio","family":"Cini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Ramacher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Slamanig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"Striecks","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erkan","family":"Tairi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,15]]},"reference":[{"key":"9486_CR1","first-page":"553","volume-title":"EUROCRYPT 2010, volume 6110 of LNCS","author":"S Agrawal","year":"2010","unstructured":"S. Agrawal, D. Boneh, and X. Boyen, Efficient lattice (H)IBE in the standard model, in H. Gilbert, editors, EUROCRYPT\u00a02010, volume 6110 of LNCS, (Springer, Heidelberg, 2010), pp. 553\u2013572."},{"key":"9486_CR2","first-page":"733","volume-title":"PKC 2015","author":"M Abdalla","year":"2015","unstructured":"M. Abdalla, F. Bourse, A. De Caro, and D. Pointcheval, Simple functional encryption schemes for inner products, in J. Katz, editors, PKC\u00a02015, vol. 9020, (Springer, Heidelberg, 2015) pp. 733\u2013751"},{"key":"9486_CR3","unstructured":"M. Abdalla, F. Bourse, A. De Caro, and D. Pointcheval, Better security for functional encryption for inner product evaluations. Cryptology ePrint Archive, Report 2016\/011, 2016. https:\/\/eprint.iacr.org\/2016\/011"},{"key":"9486_CR4","first-page":"552","volume-title":"ASIACRYPT 2019, Part III, LNCS","author":"M Abdalla","year":"2019","unstructured":"M. Abdalla, F. Benhamouda, and R. Gay, From single-input to multi-client inner-product functional encryption, in S. \u00a0D. Galbraith and S. Moriai, editors, ASIACRYPT\u00a02019, Part\u00a0III, LNCS. vol. 11923, (Springer, Heidelberg, 2019) pp. 552\u2013582."},{"key":"9486_CR5","first-page":"128","volume-title":"PKC 2019, Part II, LNCS","author":"M Abdalla","year":"2019","unstructured":"M. Abdalla, F. Benhamouda, M. Kohlweiss, and H. Waldner, Decentralizing inner-product functional encryption, in D. Lin and K. Sako, editors, PKC\u00a02019, Part\u00a0II, LNCS. vol. 11443, (Springer, Heidelberg, 2019) pp. 128\u2013157."},{"key":"9486_CR6","first-page":"525","volume-title":"SCN 20, LNCS","author":"M Abdalla","year":"2020","unstructured":"M. Abdalla, F. Bourse, H. Marival, D. Pointcheval, A. Soleimanian, and H. Waldner, Multi-client inner-product functional encryption in the random-oracle model, in C. Galdi and V. Kolesnikov, editors, SCN 20, LNCS. vol. 12238, (Springer, Heidelberg, 2020) pp. 525\u2013545."},{"key":"9486_CR7","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-662-48000-7_32","volume-title":"CRYPTO 2015, Part II, LNCS","author":"P Ananth","year":"2015","unstructured":"P. Ananth, Z. Brakerski, G. Segev, and V. Vaikuntanathan, From selective to adaptive security in functional encryption, in R. Gennaro and M. J.\u00a0B. Robshaw, editors, CRYPTO\u00a02015, Part\u00a0II, LNCS vol. 9216, (Springer, Heidelberg, 2015) pp. 657\u2013677"},{"key":"9486_CR8","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-319-96884-1_20","volume-title":"CRYPTO 2018, Part I, LNCS","author":"M Abdalla","year":"2018","unstructured":"M. Abdalla, D. Catalano, D. Fiore, R. Gay, and B. Ursu, Multi-input functional encryption for inner products: Function-hiding realizations and constructions without pairings, in H. Shacham and A. Boldyreva, editors, CRYPTO\u00a02018, Part\u00a0I, LNCS vol. 10991, (Springer, Heidelberg, 2018) pp. 597\u2013627"},{"key":"9486_CR9","first-page":"467","volume-title":"ASIACRYPT 2020, Part III, LNCS","author":"M Abdalla","year":"2020","unstructured":"M. Abdalla, D. Catalano, R. Gay, and B. Ursu, Inner-product functional encryption with fine-grained access control, in S. Moriai and H. Wang, editors, ASIACRYPT\u00a02020, Part\u00a0III, LNCS vol. 12493, (Springer, Heidelberg, 2020) pp. 467\u2013497"},{"key":"9486_CR10","doi-asserted-by":"publisher","unstructured":"G. Ateniese, K. Fu, M. Green, and S. Hohenberger, Improved proxy re-encryption schemes with applications to secure distributed storage. ACM Trans. Inform. Syst. Secur. 9(1), 1\u201330 (2006). https:\/\/doi.org\/10.1145\/1127345.1127346","DOI":"10.1145\/1127345.1127346"},{"issue":"1","key":"9486_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.2478\/popets-2021-0003","volume":"2021","author":"M Ambrona","year":"2021","unstructured":"M. Ambrona, D. Fiore, and C. Soriente. Controlled functional encryption revisited: multi-authority extensions and efficient schemes for quadratic functions. PoPETs, 2021(1):21\u201342, 2021.","journal-title":"PoPETs"},{"key":"9486_CR12","doi-asserted-by":"crossref","unstructured":"M. Abdalla, R. Gay, M. Raykova, and H. Wee, Multi-input inner-product functional encryption from pairings, in J.-S. Coron and J.\u00a0B. Nielsen, editors, EUROCRYPT\u00a02017, Part\u00a0I, LNCS vol. 10210, (Springer, Heidelberg, 2017) pp. 601\u2013626","DOI":"10.1007\/978-3-319-56620-7_21"},{"key":"9486_CR13","series-title":"Part I, volume 12170 of LNCS","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-030-56784-2_23","volume-title":"CRYPTO 2020","author":"Michel Abdalla","year":"2020","unstructured":"M. Abdalla, J. Gong, and H. Wee. Functional encryption for attribute-weighted sums from $$k$$-Lin. In Daniele Micciancio and Thomas Ristenpart, editors, CRYPTO\u00a02020, Part\u00a0I, volume 12170 of LNCS, pages 685\u2013716. Springer, Heidelberg, 2020."},{"key":"9486_CR14","unstructured":"P. Ananth, A. Jain, and A. Sahai, Indistinguishability obfuscation without multilinear maps: iO from LWE, bilinear maps, and weak pseudorandomness. Cryptology ePrint Archive, Report 2018\/615, 2018. https:\/\/eprint.iacr.org\/2018\/615"},{"key":"9486_CR15","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-662-53015-3_12","volume-title":"CRYPTO 2016, Part III, LNCS","author":"S Agrawal","year":"2016","unstructured":"S. Agrawal, B. Libert, and D. Stehl\u00e9, Fully secure functional encryption for inner products, from standard assumptions, in M. Robshaw and J. Katz, editors, CRYPTO\u00a02016, Part\u00a0III, LNCS vol. 9816, (Springer, Heidelberg, 2016) pp. 333\u2013362"},{"key":"9486_CR16","first-page":"36","volume-title":"PKC 2017, Part II, LNCS","author":"F Benhamouda","year":"2017","unstructured":"F. Benhamouda, F. Bourse, and H. Lipmaa, CCA-secure inner-product functional encryption from projective hash functions, in S. Fehr, editors, PKC\u00a02017, Part\u00a0II, LNCS vol. 10175, (Springer, Heidelberg, 2017) pp. 36\u201366"},{"key":"9486_CR17","first-page":"127","volume-title":"EUROCRYPT\u201998, LNCS","author":"M Blaze","year":"1998","unstructured":"M. Blaze, G. Bleumer, and M. Strauss, Divertible protocols and atomic proxy cryptography, in K. Nyberg, editors, EUROCRYPT\u201998, LNCS vol. 1403, (Springer, Heidelberg, 1998) pp. 127\u2013144"},{"key":"9486_CR18","unstructured":"\u00c9. Bouscati\u00e9, G. Castagnos, and O. Sanders, Pattern matching in encrypted stream from inner product encryption. Cryptology ePrint Archive, Report 2022\/1527, 2022. https:\/\/eprint.iacr.org\/2022\/1527"},{"key":"9486_CR19","first-page":"253","volume-title":"TCC 2011, LNCS","author":"D Boneh","year":"2011","unstructured":"D. Boneh, A. Sahai, and B. Waters, Functional encryption: definitions and challenges, in Y. Ishai, editors, TCC\u00a02011, LNCS vol. 6597, (Springer, Heidelberg, 2011) pp. 253\u2013273"},{"key":"9486_CR20","series-title":"Part II, volume 8270 of LNCS","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"ASIACRYPT 2013","author":"D Boneh","year":"2013","unstructured":"D. Boneh and B. Waters. Constrained pseudorandom functions and their applications. In K. Sako and P. Sarkar, editors, ASIACRYPT\u00a02013, Part\u00a0II, volume 8270 of LNCS, pages 280\u2013300. Springer, Heidelberg, 2013."},{"key":"9486_CR21","series-title":"LNCS","first-page":"95","volume-title":"PKC 2014","author":"N Chandran","year":"2014","unstructured":"N. Chandran, M. Chase, F. H. Liu, R. Nishimaki, and K. Xagawa. Re-encryption, functional re-encryption, and multi-hop re-encryption: A framework for achieving obfuscation-based security and instantiations from lattices. In Hugo Krawczyk, editor, PKC\u00a02014, volume 8383 of LNCS, pages 95\u2013112. Springer, Heidelberg, 2014."},{"key":"9486_CR22","first-page":"703","volume-title":"ASIACRYPT 2018, Part II, LNCS","author":"J Chotard","year":"2018","unstructured":"J. Chotard, E. D. Sans, R. Gay, D.\u00a0H. Phan, and D. Pointcheval, Decentralized multi-client functional encryption for inner product, in T. Peyrin and S. Galbraith, editors, ASIACRYPT\u00a02018, Part\u00a0II, LNCS vol. 11273, (Springer, Heidelberg, 2018) pp. 703\u2013732"},{"key":"9486_CR23","first-page":"231","volume-title":"ACNS 20, Part I, LNCS","author":"P Chvojka","year":"2020","unstructured":"P. Chvojka, T. Jager, and S. \u00a0A. Kakvi, Offline witness encryption with semi-adaptive security, in M. Conti, J. Zhou, E. Casalicchio, and A. Spognardi, editors, ACNS 20, Part\u00a0I, LNCS vol. 12146, (Springer, Heidelberg, 2020) pp. 231\u2013250"},{"key":"9486_CR24","series-title":"Part II, volume 11273 of LNCS","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-030-03329-3_25","volume-title":"ASIACRYPT 2018","author":"G Castagnos","year":"2018","unstructured":"G. Castagnos, F. Laguillaumie, and I. Tucker. Practical fully secure unrestricted inner product functional encryption modulo p. In Thomas Peyrin and Steven Galbraith, editors, ASIACRYPT\u00a02018, Part\u00a0II, volume 11273 of LNCS, pages 733\u2013764. Springer, Heidelberg, 2018."},{"key":"9486_CR25","first-page":"468","volume-title":"TCC 2015, Part II, LNCS","author":"R Canetti","year":"2015","unstructured":"R. Canetti, H. Lin, S. Tessaro, and V. Vaikuntanathan, Obfuscation of probabilistic circuits and applications, in Y.Dodis and J. \u00a0B. Nielsen, editors, TCC\u00a02015, Part\u00a0II, LNCS vol. 9015, (Springer, Heidelberg, 2015) pp. 468\u2013497"},{"key":"9486_CR26","series-title":"Part II, volume 11443 of LNCS","first-page":"287","volume-title":"PKC 2019","author":"A Cohen","year":"2019","unstructured":"A. Cohen. What about bob? The inadequacy of CPA security for proxy reencryption. In D. Lin and K. Sako, editors, PKC\u00a02019, Part\u00a0II, volume 11443 of LNCS, pages 287\u2013316. Springer, Heidelberg, 2019."},{"key":"9486_CR27","unstructured":"Y. Chen, L. Zhang, and S. -M. Yiu, Practical attribute based inner product functional encryption from simple assumptions. Cryptology ePrint Archive, Report 2019\/846, 2019. https:\/\/eprint.iacr.org\/2019\/846"},{"key":"9486_CR28","series-title":"Part I, volume 10769 of LNCS","first-page":"219","volume-title":"PKC 2018","author":"D Derler","year":"2018","unstructured":"D. Derler, S. Krenn, T. Lor\u00fcnser, S. Ramacher, D. Slamanig, and C. Striecks. Revisiting proxy re-encryption: Forward secrecy, improved security, and applications. In M. Abdalla and R. Dahab, editors, PKC\u00a02018, Part\u00a0I, volume 10769 of LNCS, pages 219\u2013250. Springer, Heidelberg, 2018."},{"key":"9486_CR29","series-title":"Part I, volume 8616 of LNCS","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-662-44371-2_19","volume-title":"CRYPTO 2014","author":"L Ducas","year":"2014","unstructured":"L. Ducas and D. Micciancio. Improved short lattice signatures in the standard model. In J.\u00a0A. Garay and R. Gennaro, editors, CRYPTO\u00a02014, Part\u00a0I, volume 8616 of LNCS, pages 335\u2013352. Springer, Heidelberg, 2014."},{"key":"9486_CR30","series-title":"LNCS","first-page":"426","volume-title":"ACNS 19","author":"ED Sans","year":"2019","unstructured":"E. D. Sans and D. Pointcheval. Unbounded inner-product functional encryption with succinct keys. In R.\u00a0H. Deng, V. Gauthier-Uma\u00f1a, M. Ochoa, and M. Yung, editors, ACNS 19, volume 11464 of LNCS, pages 426\u2013441. Springer, Heidelberg, June 2019."},{"key":"9486_CR31","doi-asserted-by":"crossref","unstructured":"P. de\u00a0Perthuis and D. Pointcheval, Two-client inner-product functional encryption with an application to money-laundering detection, in H. Yin, A. Stavrou, C. Cremers, and E. Shi, editors, ACM CCS 2022, (ACM Press, USA 2022) pp. 725\u2013737","DOI":"10.1145\/3548606.3559374"},{"key":"9486_CR32","series-title":"Part II, volume 11443 of LNCS","first-page":"317","volume-title":"PKC 2019","author":"G Fuchsbauer","year":"2019","unstructured":"G. Fuchsbauer, C. Kamath, K. Klein, and K. Pietrzak. Adaptively secure proxy re-encryption. In Dongdai Lin and Kazue Sako, editors, PKC\u00a02019, Part\u00a0II, volume 11443 of LNCS, pages 317\u2013346. Springer, Heidelberg, 2019."},{"key":"9486_CR33","series-title":"LNCS","first-page":"363","volume-title":"ACNS 19","author":"X Fan","year":"2019","unstructured":"X. Fan and F. -H. Liu. Proxy re-encryption and re-signatures from lattices. In Robert\u00a0H. Deng, Val\u00e9rie Gauthier-Uma\u00f1a, Mart\u00edn Ochoa, and Moti Yung, editors, ACNS 19, volume 11464 of LNCS, pages 363\u2013382. Springer, Heidelberg, June 2019."},{"key":"9486_CR34","first-page":"3","volume-title":"ESOCC 2016, LCNS","author":"S Fugkeaw","year":"2016","unstructured":"S. Fugkeaw and H. Sato, Updating policies in cp-abe-based access control: an optimized and secure service, in M. Aiello, E. \u00a0B. Johnsen, S. Dustdar, and I. Georgievski, editors, ESOCC 2016, LCNS vol. 9846, (Springer, Cham, 2016) pp. 3\u201317"},{"key":"9486_CR35","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, and B. Waters, Candidate indistinguishability obfuscation and functional encryption for all circuits, in 54th FOCS, (IEEE Computer Society Press, 2013) pp. 40\u201349","DOI":"10.1109\/FOCS.2013.13"},{"key":"9486_CR36","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Goldwasser, and S. Micali, How to construct random functions (extended abstract), in 25th FOCS, (IEEE Computer Society Press, 1984) pp. 464\u2013479","DOI":"10.1109\/SFCS.1984.715949"},{"key":"9486_CR37","doi-asserted-by":"crossref","unstructured":"C. Gentry, C. Peikert, and V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, in R. \u00a0E. Ladner and C. Dwork, editors, 40th ACM STOC, (ACM Press, 2008) pp. 197\u2013206","DOI":"10.1145\/1374376.1374407"},{"key":"9486_CR38","doi-asserted-by":"crossref","unstructured":"S. Gorbunov, V. Vaikuntanathan, and H. Wee, Attribute-based encryption for circuits, in D. Boneh, T. Roughgarden, and J. Feigenbaum, editors, 45th ACM STOC, (ACM Press, 2013) pp. 545\u2013554","DOI":"10.1145\/2488608.2488677"},{"key":"9486_CR39","series-title":"Part I, volume 10401 of LNCS","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-319-63688-7_5","volume-title":"CRYPTO 2017","author":"Z Jafargholi","year":"2017","unstructured":"Z. Jafargholi, C. Kamath, K. Klein, I. Komargodski, K. Pietrzak, and D. Wichs. Be adaptive, avoid overcommitting. In Jonathan Katz and Hovav Shacham, editors, CRYPTO\u00a02017, Part\u00a0I, volume 10401 of LNCS, pages 133\u2013163. Springer, Heidelberg, 2017."},{"key":"9486_CR40","series-title":"Part I, volume 11476 of LNCS","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-17653-2_9","volume-title":"EUROCRYPT 2019","author":"A Jain","year":"2019","unstructured":"A. Jain, H. Lin, C. Matt, and A. Sahai. How to leverage hardness of constant-degree expanding polynomials overa $${\\mathbb{R}}$$ to build $$i{\\cal{O}}$$. In Yuval Ishai and Vincent Rijmen, editors, EUROCRYPT\u00a02019, Part\u00a0I, volume 11476 of LNCS, pages 251\u2013281. Springer, Heidelberg, 2019."},{"key":"9486_CR41","unstructured":"A. Jain, H. Lin, and A. Sahai, Simplifying constructions and assumptions for $$i{\\cal{O}} $$. Cryptology ePrint Archive, Report 2019\/1252, 2019. https:\/\/eprint.iacr.org\/2019\/1252."},{"key":"9486_CR42","doi-asserted-by":"crossref","unstructured":"Y. Kawai. Outsourcing the re-encryption key generation: flexible ciphertext-policy attribute-based proxy re-encryption. In J. L\u00f3pez and Y. Wu, editors, ISPEC 2015, LNCS vol. 9065, (Springer, 2015) pp. 301\u2013315","DOI":"10.1007\/978-3-319-17533-1_21"},{"key":"9486_CR43","doi-asserted-by":"crossref","unstructured":"V. Koutsos, D. Papadopoulos, D. Chatzopoulos, S. Tarkoma, and P. Hui, Agora: a privacy-aware data marketplace, in ICDCS, (IEEE, 2020) pp. 1211\u20131212","DOI":"10.1109\/ICDCS47774.2020.00156"},{"key":"9486_CR44","first-page":"682","volume-title":"ASIACRYPT 2016, Part II, LNCS","author":"S Katsumata","year":"2016","unstructured":"S. Katsumata and S. Yamada, Partitioning via non-linear polynomial functions: more compact IBEs from ideal lattices and bilinear maps, in J. \u00a0H. Cheon and T. Takagi, editors, ASIACRYPT\u00a02016, Part\u00a0II, LNCS vol. 10032, (Springer, Heidelberg, 2016) pp. 682\u2013712"},{"key":"9486_CR45","first-page":"498","volume-title":"EUROCRYPT 2021, Part I, LNCS","author":"Q Lai","year":"2021","unstructured":"Q. Lai, F. -H. Liu, and Z. Wang, New lattice two-stage sampling technique and its applications to functional encryption\u2014stronger security and smaller ciphertexts, in A. Canteaut and F. -X. Standaert, editors, EUROCRYPT\u00a02021, Part\u00a0I, LNCS vol. 12696, (Springer, Heidelberg, 2021) pp. 498\u2013527"},{"key":"9486_CR46","first-page":"520","volume-title":"ASIACRYPT 2019, Part III, LNCS","author":"B Libert","year":"2019","unstructured":"B. Libert and R. Titiu, Multi-client functional encryption for linear functions in the standard model from LWE, in S.\u00a0D. Galbraith and S. Moriai, editors, ASIACRYPT\u00a02019, Part\u00a0III, LNCS vol. 11923, (Springer, Heidelberg, 2019) pp. 520\u2013551"},{"key":"9486_CR47","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"D. Micciancio and C. Peikert. Trapdoors for lattices: Simpler, tighter, faster, smaller. In David Pointcheval and Thomas Johansson, editors, EUROCRYPT\u00a02012, volume 7237 of LNCS, pages 700\u2013718. Springer, Heidelberg, 2012."},{"key":"9486_CR48","doi-asserted-by":"crossref","unstructured":"D. Micciancio and O. Regev, Worst-case to average-case reductions based on Gaussian measures, in 45th FOCS, (IEEE Computer Society Press, 2004) pp. 372\u2013381","DOI":"10.1109\/FOCS.2004.72"},{"key":"9486_CR49","first-page":"3","volume-title":"ESORICS 2019, Part I, LNCS","author":"T Marc","year":"2019","unstructured":"T. Marc, M. Stopar, J. Hartman, M. Bizjak, and J. Modic, Privacy-enhanced machine learning with functional encryption, in K. Sako, S. Schneider, and P.Y.\u00a0A. Ryan, editors, ESORICS\u00a02019, Part\u00a0I, LNCS vol. 11735, (Springer, Heidelberg, 2019) pp. 3\u201321"},{"key":"9486_CR50","doi-asserted-by":"crossref","unstructured":"M. Naveed, S. Agrawal, M. Prabhakaran, X. Wang, E. Ayday, J. -P. Hubaux, and C.\u00a0A. Gunter, Controlled functional encryption, in G. J. Ahn, M. Yung, and N. Li, editors, ACM CCS 2014, (ACM Press, 2014) pp. 1280\u20131291","DOI":"10.1145\/2660267.2660291"},{"key":"9486_CR51","series-title":"Part I, volume 13791 of LNCS","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-031-22963-3_4","volume-title":"ASIACRYPT 2022","author":"K Nguyen","year":"2022","unstructured":"K.\u00a0Nguyen, D. \u00a0H. Phan, and D. Pointcheval. Multi-client functional encryption with fine-grained access control. In Shweta Agrawal and Dongdai Lin, editors, ASIACRYPT\u00a02022, Part\u00a0I, volume 13791 of LNCS, pages 95\u2013125. Springer, Heidelberg, 2022."},{"key":"9486_CR52","unstructured":"A. O\u2019Neill, Definitional issues in functional encryption. Cryptology ePrint Archive, Report 2010\/556, 2010. https:\/\/eprint.iacr.org\/2010\/556"},{"key":"9486_CR53","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-88238-9_7","volume-title":"LATINCRYPT 2021","author":"T Pal","year":"2021","unstructured":"T. Pal and R. Dutta. Attribute-based access control for inner product functional encryption from LWE. In Patrick Longa and Carla R\u00e0fols, editors, LATINCRYPT\u00a02021, volume 12912 of LNCS, pages 127\u2013148. Springer, Heidelberg, 2021."},{"key":"9486_CR54","doi-asserted-by":"crossref","unstructured":"O. Regev, On lattices, learning with errors, random linear codes, and cryptography, in H.\u00a0N. Gabow and R. Fagin, editors, 37th ACM STOC, (ACM Press, 2005) pp. 84\u201393","DOI":"10.1145\/1060590.1060603"},{"key":"9486_CR55","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11426639_27","volume-title":"EUROCRYPT 2005","author":"A Sahai","year":"2005","unstructured":"A. Sahai and B. \u00a0R. Waters. Fuzzy identity-based encryption. In Ronald Cramer, editor, EUROCRYPT\u00a02005, volume 3494 of LNCS, pages 457\u2013473. Springer, Heidelberg, 2005."},{"key":"9486_CR56","doi-asserted-by":"crossref","unstructured":"A. Sahai and B. Waters, How to use indistinguishability obfuscation: deniable encryption, and more, in D. \u00a0B. Shmoys, editor, 46th ACM STOC, (ACM Press, 2014) pp. 475\u2013484","DOI":"10.1145\/2591796.2591825"},{"key":"9486_CR57","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1007\/978-3-662-48000-7_33","volume-title":"CRYPTO 2015, Part II, LNCS","author":"B Waters","year":"2015","unstructured":"B. Waters, A punctured programming approach to adaptively secure functional encryption, in R. Gennaro and M. J.\u00a0B. Robshaw, editors, CRYPTO\u00a02015, Part\u00a0II, LNCS vol. 9216, (Springer, Heidelberg, 2015) pp. 678\u2013697"},{"key":"9486_CR58","series-title":"Part I, volume 10677 of LNCS","first-page":"206","volume-title":"TCC 2017","author":"H Wee","year":"2017","unstructured":"H. Wee. Attribute-hiding predicate encryption in bilinear groups, revisited. In Yael Kalai and Leonid Reyzin, editors, TCC\u00a02017, Part\u00a0I, volume 10677 of LNCS, pages 206\u2013233. Springer, Heidelberg, 2017."}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09486-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-023-09486-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09486-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T03:47:07Z","timestamp":1730864827000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-023-09486-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,15]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["9486"],"URL":"https:\/\/doi.org\/10.1007\/s00145-023-09486-y","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,15]]},"assertion":[{"value":"27 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"8"}}