{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:52Z","timestamp":1740122572669,"version":"3.37.3"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T00:00:00Z","timestamp":1722038400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T00:00:00Z","timestamp":1722038400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Karlsruher Institut f\u00fcr Technologie (KIT)"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents the <jats:italic>first<\/jats:italic> functional encryption <jats:inline-formula><jats:alternatives><jats:tex-math>$$(\\textsf{FE})$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>FE<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> scheme for the attribute-weighted sum functionality that supports the <jats:italic>uniform<\/jats:italic> model of computation. In such an  scheme, encryption takes as input a pair of attributes (<jats:italic>x<\/jats:italic>,\u00a0<jats:italic>z<\/jats:italic>) where <jats:italic>x<\/jats:italic> is public and <jats:italic>z<\/jats:italic> is private. A secret key corresponds to some weight function <jats:italic>f<\/jats:italic>, and decryption recovers the weighted sum <jats:italic>f<\/jats:italic>(<jats:italic>x<\/jats:italic>)<jats:italic>z<\/jats:italic>. In our scheme, both the public and private attributes can be of arbitrary polynomial lengths that are not fixed at system setup. The weight functions are modelled as <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\text {Logspace Turing machines}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mtext>Logspace Turing machines<\/mml:mtext>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Prior schemes could only support non-uniform Logspace. The proposed scheme is proven <jats:italic>adaptively simulation<\/jats:italic> secure under the well-studied symmetric external Diffie\u2013Hellman assumption against an arbitrary polynomial number of secret key queries both before and after the challenge ciphertext. This is the best possible security notion that could be achieved for . On the technical side, our contributions lie in extending the techniques of Lin and Luo [EUROCRYPT 2020] devised for indistinguishability-based payload hiding attribute-based encryption for uniform Logspace access policies and the \u201cthree-slot reduction\u201d technique for simulation-secure attribute-hiding  for non-uniform Logspace devised by Datta and Pal [ASIACRYPT 2021] to the context of simulation-secure attribute-hiding  for uniform Logspace.<\/jats:p>","DOI":"10.1007\/s10623-024-01432-8","type":"journal-article","created":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T11:02:03Z","timestamp":1722078123000},"page":"3155-3235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compact FE for unbounded attribute-weighted sums for logspace from SXDH"],"prefix":"10.1007","volume":"92","author":[{"given":"Pratish","family":"Datta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6278-0418","authenticated-orcid":false,"given":"Tapas","family":"Pal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsuyuki","family":"Takashima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,27]]},"reference":[{"key":"1432_CR1","doi-asserted-by":"crossref","unstructured":"Abdalla M., Benhamouda F., Gay R.: From single-input to multi-client inner-product functional encryption. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 552\u2013582. Springer (2019).","DOI":"10.1007\/978-3-030-34618-8_19"},{"key":"1432_CR2","doi-asserted-by":"crossref","unstructured":"Abdalla M., Benhamouda F., Kohlweiss M., Waldner H.: Decentralizing inner-product functional encryption. In: IACR International Workshop on Public Key Cryptography, pp. 128\u2013157. Springer (2019).","DOI":"10.1007\/978-3-030-17259-6_5"},{"key":"1432_CR3","doi-asserted-by":"crossref","unstructured":"Abdalla M., Bourse F., De\u00a0Caro A., Pointcheval D.: Simple functional encryption schemes for inner products. In: PKC 2015, pp. 733\u2013751. Springer (2015).","DOI":"10.1007\/978-3-662-46447-2_33"},{"key":"1432_CR4","doi-asserted-by":"crossref","unstructured":"Abdalla M., Bourse F., Marival H., Pointcheval D., Soleimanian A., Waldner H.: Multi-client inner-product functional encryption in the random-oracle model. In: International Conference on Security and Cryptography for Networks, pp. 525\u2013545. Springer (2020).","DOI":"10.1007\/978-3-030-57990-6_26"},{"key":"1432_CR5","doi-asserted-by":"crossref","unstructured":"Abdalla M., Catalano D., Fiore D., Gay R., Ursu B.: Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings. In: CRYPTO 2018, pp. 597\u2013627. Springer (2018).","DOI":"10.1007\/978-3-319-96884-1_20"},{"key":"1432_CR6","doi-asserted-by":"crossref","unstructured":"Abdalla M., Catalano D., Gay R., Ursu B.: Inner-product functional encryption with fine-grained access control. IACR Cryptology ePrint Archive, Report 2020\/577 (2020).","DOI":"10.1007\/978-3-030-64840-4_16"},{"key":"1432_CR7","doi-asserted-by":"crossref","unstructured":"Abdalla M., Gay R., Raykova M., Wee H.: Multi-input inner-product functional encryption from pairings. In: CRYPTO 2017, pp. 601\u2013626. Springer (2017).","DOI":"10.1007\/978-3-319-56620-7_21"},{"key":"1432_CR8","doi-asserted-by":"crossref","unstructured":"Abdalla M., Gong J., Wee H.: Functional encryption for attribute-weighted sums from $$k$$-Lin. In: CRYPTO 2020, pp. 685\u2013716. Springer (2020).","DOI":"10.1007\/978-3-030-56784-2_23"},{"key":"1432_CR9","doi-asserted-by":"crossref","unstructured":"Agrawal S., Goyal R., Tomida J.: Multi-input quadratic functional encryption from pairings. In: Annual International Cryptology Conference, pp. 208\u2013238. Springer (2021).","DOI":"10.1007\/978-3-030-84259-8_8"},{"key":"1432_CR10","doi-asserted-by":"crossref","unstructured":"Agrawal S., Libert B., Maitra M., Titiu R.: Adaptive simulation security for inner product functional encryption. In: PKC 2020, pp. 34\u201364. Springer (2020).","DOI":"10.1007\/978-3-030-45374-9_2"},{"key":"1432_CR11","doi-asserted-by":"crossref","unstructured":"Agrawal S., Libert B., Stehl\u00e9 D.: Fully secure functional encryption for inner products, from standard assumptions. In: CRYPTO 2016, pp. 333\u2013362. Springer (2016).","DOI":"10.1007\/978-3-662-53015-3_12"},{"key":"1432_CR12","doi-asserted-by":"crossref","unstructured":"Agrawal S., Maitra M.: Fe and io for turing machines from minimal assumptions. In: Theory of Cryptography: 16th International Conference, TCC 2018, Panaji, India, November 11\u201314, 2018, Proceedings, Part II, pp. 473\u2013512. Springer-Verlag (2018).","DOI":"10.1007\/978-3-030-03810-6_18"},{"key":"1432_CR13","doi-asserted-by":"crossref","unstructured":"Agrawal S., Maitra M., Vempati N.S., Yamada S.: Functional encryption for turing machines with dynamic bounded collusion from LWE. In: CRYPTO 2021, pp. 239\u2013269. Springer (2021).","DOI":"10.1007\/978-3-030-84259-8_9"},{"key":"1432_CR14","doi-asserted-by":"crossref","unstructured":"Agrawal S., Rosen A.: Functional encryption for bounded collusions, revisited. In: Theory of Cryptography Conference, pp. 173\u2013205. Springer (2017).","DOI":"10.1007\/978-3-319-70500-2_7"},{"key":"1432_CR15","doi-asserted-by":"crossref","unstructured":"Ananth P., Brakerski Z., Segev G., Vaikuntanathan V.: From selective to adaptive security in functional encryption. In: Annual Cryptology Conference, pp. 657\u2013677. Springer (2015).","DOI":"10.1007\/978-3-662-48000-7_32"},{"key":"1432_CR16","doi-asserted-by":"crossref","unstructured":"Ananth P., Sahai A.: Functional encryption for turing machines. In: TCC 2016, pp. 125\u2013153. Springer (2016).","DOI":"10.1007\/978-3-662-49096-9_6"},{"key":"1432_CR17","doi-asserted-by":"crossref","unstructured":"Ananth P., Vaikuntanathan V.: Optimal bounded-collusion secure functional encryption. In: Theory of Cryptography Conference, pp. 174\u2013198. Springer (2019).","DOI":"10.1007\/978-3-030-36030-6_8"},{"key":"1432_CR18","doi-asserted-by":"crossref","unstructured":"Applebaum B., Ishai Y., Kushilevitz E.: How to garble arithmetic circuits. In: FOCS 2011, pp. 120\u2013129. IEEE Computer Society (2011).","DOI":"10.1109\/FOCS.2011.40"},{"key":"1432_CR19","doi-asserted-by":"crossref","unstructured":"Attrapadung N.: Dual system encryption framework in prime-order groups via computational pair encodings. In: ASIACRYPT 2016, pp. 591\u2013623. Springer (2016).","DOI":"10.1007\/978-3-662-53890-6_20"},{"key":"1432_CR20","doi-asserted-by":"crossref","unstructured":"Badrinarayanan S., Goyal V., Jain A., Sahai A.: Verifiable functional encryption. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 557\u2013587. Springer (2016).","DOI":"10.1007\/978-3-662-53890-6_19"},{"key":"1432_CR21","doi-asserted-by":"crossref","unstructured":"Baltico C.E.Z., Catalano D., Fiore D., Gay R.: Practical functional encryption for quadratic functions with applications to predicate encryption. In: CRYPTO 2017, pp. 67\u201398. Springer (2017).","DOI":"10.1007\/978-3-319-63688-7_3"},{"key":"1432_CR22","doi-asserted-by":"crossref","unstructured":"Boneh D., Gentry C., Gorbunov S., Halevi S., Nikolaenko V., Segev G., Vaikuntanathan V., Vinayagamurthy D.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: EUROCRYPT 2014, pp. 533\u2013556. Springer (2014).","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"1432_CR23","doi-asserted-by":"crossref","unstructured":"Boneh D., Lewi K., Raykova M., Sahai A., Zhandry M., Zimmerman J.: Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 563\u2013594. Springer (2015).","DOI":"10.1007\/978-3-662-46803-6_19"},{"key":"1432_CR24","doi-asserted-by":"crossref","unstructured":"Boneh D., Sahai A., Waters B.: Functional encryption: definitions and challenges. In: TCC 2011, pp. 253\u2013273. Springer (2011).","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"1432_CR25","unstructured":"Brakerski Z., Chandran N., Goyal V., Jain A., Sahai A., Segev G.: Hierarchical functional encryption. In: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)."},{"key":"1432_CR26","doi-asserted-by":"crossref","unstructured":"Brakerski Z., Komargodski I., Segev G.: Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 852\u2013880. Springer (2016).","DOI":"10.1007\/978-3-662-49896-5_30"},{"issue":"1","key":"1432_CR27","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/s00145-017-9255-y","volume":"31","author":"Z Brakerski","year":"2018","unstructured":"Brakerski Z., Segev G.: Function-private functional encryption in the private-key setting. J. Cryptol. 31(1), 202\u2013225 (2018).","journal-title":"J. Cryptol."},{"key":"1432_CR28","doi-asserted-by":"crossref","unstructured":"Caro A.D., Iovino V., O\u2019Neill A.: Deniable functional encryption. In: Public-Key Cryptography\u2014PKC 2016, pp. 196\u2013222. Springer (2016).","DOI":"10.1007\/978-3-662-49384-7_8"},{"key":"1432_CR29","doi-asserted-by":"crossref","unstructured":"Castagnos G., Laguillaumie F., Tucker I.: Practical fully secure unrestricted inner product functional encryption modulo p. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 733\u2013764. Springer (2018).","DOI":"10.1007\/978-3-030-03329-3_25"},{"key":"1432_CR30","doi-asserted-by":"crossref","unstructured":"Chen J., Gay R., Wee H.: Improved dual system ABE in prime-order groups via predicate encodings. In: EUROCRYPT 2015, pp. 595\u2013624. Springer (2015).","DOI":"10.1007\/978-3-662-46803-6_20"},{"key":"1432_CR31","doi-asserted-by":"crossref","unstructured":"Chen J., Gong J., Kowalczyk L., Wee H.: Unbounded ABE via bilinear entropy expansion, revisited. In: EUROCRYPT 2018, pp. 503\u2013534. Springer (2018).","DOI":"10.1007\/978-3-319-78381-9_19"},{"key":"1432_CR32","doi-asserted-by":"crossref","unstructured":"Chotard J., Dufour\u00a0Sans E., Gay R., Phan D.H., Pointcheval D.: Decentralized multi-client functional encryption for inner product. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 703\u2013732. Springer (2018).","DOI":"10.1007\/978-3-030-03329-3_24"},{"key":"1432_CR33","doi-asserted-by":"crossref","unstructured":"Chotard J., Dufour-Sans E., Gay R., Phan D.H., Pointcheval D.: Dynamic decentralized functional encryption. In: Annual International Cryptology Conference, pp. 747\u2013775. Springer (2020).","DOI":"10.1007\/978-3-030-56784-2_25"},{"key":"1432_CR34","doi-asserted-by":"crossref","unstructured":"Chung K.M., Katz J., Zhou H.S.: Functional encryption from (small) hardware tokens. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 120\u2013139. Springer (2013).","DOI":"10.1007\/978-3-642-42045-0_7"},{"key":"1432_CR35","doi-asserted-by":"crossref","unstructured":"Ciampi M., Siniscalchi L., Waldner H.: Multi-client functional encryption for separable functions. In: IACR International Conference on Public-Key Cryptography, pp. 724\u2013753. Springer (2021).","DOI":"10.1007\/978-3-030-75245-3_26"},{"key":"1432_CR36","doi-asserted-by":"crossref","unstructured":"Datta P., Dutta R., Mukhopadhyay S.: Functional encryption for inner product with full function privacy. In: PKC 2016, pp. 164\u2013195. Springer (2016).","DOI":"10.1007\/978-3-662-49384-7_7"},{"key":"1432_CR37","doi-asserted-by":"crossref","unstructured":"Datta P., Okamoto T., Takashima K.: Adaptively simulation-secure attribute-hiding predicate encryption. In: ASIACRYPT 2018, pp. 640\u2013672. Springer (2018).","DOI":"10.1007\/978-3-030-03329-3_22"},{"key":"1432_CR38","doi-asserted-by":"crossref","unstructured":"Datta P., Pal T.: (Compact) adaptively secure FE for attribute-weighted sums from k-Lin. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 434\u2013467. Springer (2021).","DOI":"10.1007\/978-3-030-92068-5_15"},{"key":"1432_CR39","doi-asserted-by":"crossref","unstructured":"Datta P., Pal T., Takashima K.: Compact FE for unbounded attribute-weighted sums for Logspace from SXDH. In: Advances in Cryptology\u2014ASIACRYPT 2022: 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5\u20139, 2022, Proceedings, Part I, pp. 126\u2013159. Springer (2023).","DOI":"10.1007\/978-3-031-22963-3_5"},{"key":"1432_CR40","doi-asserted-by":"crossref","unstructured":"Dufour-Sans E., Pointcheval D.: Unbounded inner-product functional encryption with succinct keys. In: ACNS 2019, pp. 426\u2013441. Springer (2019).","DOI":"10.1007\/978-3-030-21568-2_21"},{"key":"1432_CR41","doi-asserted-by":"crossref","unstructured":"Garg R., Goyal R., Lu G., Waters B.: Dynamic collusion bounded functional encryption from identity-based encryption. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 736\u2013763. Springer (2022).","DOI":"10.1007\/978-3-031-07085-3_25"},{"issue":"3","key":"1432_CR42","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/14095772X","volume":"45","author":"S Garg","year":"2016","unstructured":"Garg S., Gentry C., Halevi S., Raykova M., Sahai A., Waters B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. SIAM J. Comput. 45(3), 882\u2013929 (2016).","journal-title":"SIAM J. Comput."},{"key":"1432_CR43","doi-asserted-by":"crossref","unstructured":"Garg S., Gentry C., Halevi S., Zhandry M.: Functional encryption without obfuscation. In: Theory of Cryptography Conference, pp. 480\u2013511. Springer (2016).","DOI":"10.1007\/978-3-662-49099-0_18"},{"key":"1432_CR44","doi-asserted-by":"publisher","unstructured":"Garg S., Srinivasan A.: Single-key to multi-key functional encryption with polynomial loss. In: Hirt M., Smith A.D. (eds.) Theory of Cryptography\u201414th International Conference, TCC 2016-B, Beijing, China, October 31\u2013November 3, 2016, Proceedings, Part II, Lecture Notes in Computer Science, vol. 9986, pp. 419\u2013442 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_16.","DOI":"10.1007\/978-3-662-53644-5_16"},{"key":"1432_CR45","doi-asserted-by":"crossref","unstructured":"Goldwasser S., Gordon S.D., Goyal V., Jain A., Katz J., Liu F.H., Sahai A., Shi E., Zhou H.S.: Multi-input functional encryption. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 578\u2013602. Springer (2014).","DOI":"10.1007\/978-3-642-55220-5_32"},{"key":"1432_CR46","doi-asserted-by":"crossref","unstructured":"Goldwasser S., Kalai Y., Popa R.A., Vaikuntanathan V., Zeldovich N.: Reusable garbled circuits and succinct functional encryption. In: STOC 2013, pp. 555\u2013564. ACM (2013).","DOI":"10.1145\/2488608.2488678"},{"key":"1432_CR47","doi-asserted-by":"crossref","unstructured":"Goldwasser S., Kalai Y.T., Popa R.A., Vaikuntanathan V., Zeldovich N.: How to run turing machines on encrypted data. In: Annual Cryptology Conference, pp. 536\u2013553. Springer (2013).","DOI":"10.1007\/978-3-642-40084-1_30"},{"key":"1432_CR48","doi-asserted-by":"crossref","unstructured":"Gorbunov S., Vaikuntanathan V., Wee H.: Functional encryption with bounded collusions via multi-party computation. In: CRYPTO 2012, pp. 162\u2013179. Springer (2012).","DOI":"10.1007\/978-3-642-32009-5_11"},{"key":"1432_CR49","doi-asserted-by":"crossref","unstructured":"Goyal V., Jain A., Koppula V., Sahai A.: Functional encryption for randomized functionalities. In: Theory of Cryptography Conference, pp. 325\u2013351. Springer (2015).","DOI":"10.1007\/978-3-662-46497-7_13"},{"key":"1432_CR50","doi-asserted-by":"crossref","unstructured":"Iovino V., \u017bebroski K.: Simulation-based secure functional encryption in the random oracle model. In: International Conference on Cryptology and Information Security in Latin America, pp. 21\u201339. Springer (2015).","DOI":"10.1007\/978-3-319-22174-8_2"},{"key":"1432_CR51","doi-asserted-by":"crossref","unstructured":"Ishai Y., Wee H.: Partial garbling schemes and their applications. In: ICALP 2014, pp. 650\u2013662. Springer (2014).","DOI":"10.1007\/978-3-662-43948-7_54"},{"key":"1432_CR52","doi-asserted-by":"crossref","unstructured":"Jain A., Lin H., Sahai A.: Indistinguishability obfuscation from well-founded assumptions. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 60\u201373 (2021).","DOI":"10.1145\/3406325.3451093"},{"key":"1432_CR53","doi-asserted-by":"crossref","unstructured":"Jain A., Lin H., Sahai A.: Indistinguishability obfuscation from LPN over, DLIN, and PRGS in NC. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 670\u2013699. Springer (2022).","DOI":"10.1007\/978-3-031-06944-4_23"},{"key":"1432_CR54","doi-asserted-by":"crossref","unstructured":"Kim S., Lewi K., Mandal A., Montgomery H., Roy A., Wu D.J.: Function-hiding inner product encryption is practical. In: SCN 2018, pp. 544\u2013562. Springer (2018).","DOI":"10.1007\/978-3-319-98113-0_29"},{"issue":"1","key":"1432_CR55","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/s00145-016-9250-8","volume":"31","author":"I Komargodski","year":"2018","unstructured":"Komargodski I., Segev G., Yogev E.: Functional encryption for randomized functionalities in the private-key setting from minimal assumptions. J. Cryptol. 31(1), 60\u2013100 (2018).","journal-title":"J. Cryptol."},{"key":"1432_CR56","doi-asserted-by":"crossref","unstructured":"Lai Q., Liu F.H., Wang Z.: New lattice two-stage sampling technique and its applications to functional encryption\u2014stronger security and smaller ciphertexts. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 498\u2013527. Springer (2021).","DOI":"10.1007\/978-3-030-77870-5_18"},{"key":"1432_CR57","doi-asserted-by":"crossref","unstructured":"Lewko A., Okamoto T., Sahai A., Takashima K., Waters B.: Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption. In: EUROCRYPT 2010, pp. 62\u201391. Springer (2010).","DOI":"10.1007\/978-3-642-13190-5_4"},{"key":"1432_CR58","doi-asserted-by":"crossref","unstructured":"Lewko A.B., Waters B.: New techniques for dual system encryption and fully secure HIBE with short ciphertexts. In: TCC 2010, pp. 455\u2013479. Springer (2010).","DOI":"10.1007\/978-3-642-11799-2_27"},{"key":"1432_CR59","doi-asserted-by":"crossref","unstructured":"Lewko A.B., Waters B.: Unbounded HIBE and attribute-based encryption. In: EUROCRYPT 2011, pp. 547\u2013567. Springer (2011).","DOI":"10.1007\/978-3-642-20465-4_30"},{"key":"1432_CR60","doi-asserted-by":"crossref","unstructured":"Libert B., \u0162i\u0163iu R.: Multi-client functional encryption for linear functions in the standard model from LWE. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 520\u2013551. Springer (2019).","DOI":"10.1007\/978-3-030-34618-8_18"},{"key":"1432_CR61","doi-asserted-by":"crossref","unstructured":"Lin H.: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGS. In: CRYPTO 2017, pp. 599\u2013629. Springer (2017).","DOI":"10.1007\/978-3-319-63688-7_20"},{"key":"1432_CR62","doi-asserted-by":"crossref","unstructured":"Lin H., Luo J.: Compact adaptively secure ABE from $$k$$-Lin: beyond $${\\sf NC}^1$$ and towards NL. In: EUROCRYPT 2020, pp. 247\u2013277. Springer (2020).","DOI":"10.1007\/978-3-030-45727-3_9"},{"key":"1432_CR63","doi-asserted-by":"crossref","unstructured":"Lin H., Tessaro S.: Indistinguishability obfuscation from trilinear maps and block-wise local PRGs. In: Annual International Cryptology Conference, pp. 630\u2013660. Springer (2017).","DOI":"10.1007\/978-3-319-63688-7_21"},{"key":"1432_CR64","doi-asserted-by":"crossref","unstructured":"Lin H., Vaikuntanathan V.: Indistinguishability obfuscation from DDH-like assumptions on constant-degree graded encodings. In: FOCS 2016, pp. 11\u201320. IEEE (2016).","DOI":"10.1109\/FOCS.2016.11"},{"key":"1432_CR65","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2021.10.008","volume":"898","author":"X Liu","year":"2022","unstructured":"Liu X., Liu S., Han S., Gu D.: Tightly CCA-secure inner product functional encryption scheme. Theor. Comput. Sci. 898, 1\u201319 (2022).","journal-title":"Theor. Comput. Sci."},{"key":"1432_CR66","doi-asserted-by":"crossref","unstructured":"Mera J.M.B., Karmakar A., Marc T., Soleimanian A.: Efficient lattice-based inner-product functional encryption. In: IACR International Conference on Public-Key Cryptography, pp. 163\u2013193. Springer (2022).","DOI":"10.1007\/978-3-030-97131-1_6"},{"key":"1432_CR67","doi-asserted-by":"crossref","unstructured":"Okamoto T., Takashima K.: Fully secure functional encryption with general relations from the decisional linear assumption. In: CRYPTO 2010, pp. 191\u2013208. Springer (2010).","DOI":"10.1007\/978-3-642-14623-7_11"},{"key":"1432_CR68","doi-asserted-by":"crossref","unstructured":"Okamoto T., Takashima K.: Fully secure unbounded inner-product and attribute-based encryption. In: ASIACRYPT 2012, pp. 349\u2013366. Springer (2012).","DOI":"10.1007\/978-3-642-34961-4_22"},{"key":"1432_CR69","unstructured":"O\u2019Neill A.: Definitional issues in functional encryption. IACR Cryptology ePrint Archive, Report 2010\/556 (2010)."},{"key":"1432_CR70","doi-asserted-by":"crossref","unstructured":"Tomida J., Abe M., Okamoto T.: Efficient functional encryption for inner-product values with full-hiding security. In: ICS 2016, pp. 408\u2013425. Springer (2016).","DOI":"10.1007\/978-3-319-45871-7_24"},{"issue":"3","key":"1432_CR71","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s13160-020-00419-x","volume":"37","author":"J Tomida","year":"2020","unstructured":"Tomida J., Takashima K.: Unbounded inner product functional encryption from bilinear maps. Jpn. J. Ind. Appl. Math. 37(3), 723\u2013779 (2020).","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"1432_CR72","doi-asserted-by":"crossref","unstructured":"Wang Z., Fan X., Liu F.H.: FE for inner products and its application to decentralized ABE. In: PKC 2019, pp. 97\u2013127. Springer (2019).","DOI":"10.1007\/978-3-030-17259-6_4"},{"key":"1432_CR73","doi-asserted-by":"crossref","unstructured":"Waters B.: Dual system encryption: realizing fully secure IBE and HIBE under simple assumptions. In: CRYPTO 2009, pp. 619\u2013636. Springer (2009).","DOI":"10.1007\/978-3-642-03356-8_36"},{"key":"1432_CR74","doi-asserted-by":"crossref","unstructured":"Waters B.: A punctured programming approach to adaptively secure functional encryption. In: Annual Cryptology Conference, pp. 678\u2013697. Springer (2015).","DOI":"10.1007\/978-3-662-48000-7_33"},{"key":"1432_CR75","doi-asserted-by":"crossref","unstructured":"Wee H.: Dual system encryption via predicate encodings. In: TCC 2014, pp. 616\u2013637. Springer (2014).","DOI":"10.1007\/978-3-642-54242-8_26"},{"key":"1432_CR76","doi-asserted-by":"crossref","unstructured":"Wee H.: Attribute-hiding predicate encryption in bilinear groups, revisited. In: TCC 2017, pp. 206\u2013233. Springer (2017).","DOI":"10.1007\/978-3-319-70500-2_8"},{"key":"1432_CR77","doi-asserted-by":"crossref","unstructured":"Wee H.: Functional encryption for quadratic functions from $$k$$-Lin, revisited. In: TCC 2020, pp. 210\u2013228. Springer (2020).","DOI":"10.1007\/978-3-030-64375-1_8"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01432-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01432-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01432-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T20:19:34Z","timestamp":1726690774000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01432-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,27]]},"references-count":77,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["1432"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01432-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,7,27]]},"assertion":[{"value":"10 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial conflict of interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}