{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T20:33:08Z","timestamp":1764621188512,"version":"3.46.0"},"publisher-location":"Cham","reference-count":74,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032122926","type":"print"},{"value":"9783032122933","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-12293-3_10","type":"book-chapter","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T20:28:15Z","timestamp":1764620895000},"page":"291-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["(Multi-input) $$\\textsf{FE}$$ for\u00a0Randomized Functionalities, Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3938-7594","authenticated-orcid":false,"given":"Pratish","family":"Datta","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1823-8845","authenticated-orcid":false,"given":"Jiaxin","family":"Guan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6888-5296","authenticated-orcid":false,"given":"Alexis","family":"Korb","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2216-9600","authenticated-orcid":false,"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-030-34618-8_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"M Abdalla","year":"2019","unstructured":"Abdalla, M., Benhamouda, F., Gay, R.: From single-input to multi-client inner-product functional encryption. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part III. LNCS, vol. 11923, pp. 552\u2013582. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_19"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-030-17259-6_5","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"M Abdalla","year":"2019","unstructured":"Abdalla, M., Benhamouda, F., Kohlweiss, M., Waldner, H.: Decentralizing inner-product functional encryption. In: Lin, D., Sako, K. (eds.) PKC 2019, Part II. LNCS, vol. 11443, pp. 128\u2013157. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_5"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-030-57990-6_26","volume-title":"Security and Cryptography for Networks","author":"M Abdalla","year":"2020","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: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 525\u2013545. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_26"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-319-96884-1_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"M Abdalla","year":"2018","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: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part I. LNCS, vol. 10991, pp. 597\u2013627. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_20"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-030-64840-4_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"M Abdalla","year":"2020","unstructured":"Abdalla, M., Catalano, D., Gay, R., Ursu, B.: Inner-product functional encryption with fine-grained access control. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part III. LNCS, vol. 12493, pp. 467\u2013497. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_16"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-319-56620-7_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"M Abdalla","year":"2017","unstructured":"Abdalla, M., Gay, R., Raykova, M., Wee, H.: Multi-input inner-product functional encryption from pairings. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part I. LNCS, vol. 10210, pp. 601\u2013626. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_21"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-030-56784-2_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"M Abdalla","year":"2020","unstructured":"Abdalla, M., Gong, J., Wee, H.: Functional encryption for attribute-weighted sums from k-lin. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part I. LNCS, vol. 12170, pp. 685\u2013716. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_23"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-56614-6_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"S Agrawal","year":"2017","unstructured":"Agrawal, S., Wu, D.J.: Functional encryption: deterministic to randomized functions from simple assumptions. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part II. LNCS, vol. 10211, pp. 30\u201361. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_2"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Clear, M., Frieder, O., Garg, S., O\u2019Neill, A., Thaler, J.: Ad hoc multi-input functional encryption. In: Vidick, T. (ed.) ITCS 2020, vol.\u00a0151, pp. 40:1\u201340:41. LIPIcs (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2020.40","DOI":"10.4230\/LIPIcs.ITCS.2020.40"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-642-40084-1_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Agrawal","year":"2013","unstructured":"Agrawal, S., Gorbunov, S., Vaikuntanathan, V., Wee, H.: Functional encryption: new perspectives and lower bounds. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 500\u2013518. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_28"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-030-84259-8_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"S Agrawal","year":"2021","unstructured":"Agrawal, S., Goyal, R., Tomida, J.: Multi-input quadratic functional encryption from pairings. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part IV. LNCS, vol. 12828, pp. 208\u2013238. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_8"},{"key":"10_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/978-3-031-22318-1_25","volume-title":"TCC 2022, Part I","author":"S Agrawal","year":"2022","unstructured":"Agrawal, S., Goyal, R., Tomida, J.: Multi-input quadratic functional encryption: stronger security, broader functionality. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part I. LNCS, vol. 13747, pp. 711\u2013740. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_25"},{"key":"10_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-031-38551-3_17","volume-title":"CRYPTO 2023, Part IV","author":"S Agrawal","year":"2023","unstructured":"Agrawal, S., Rossi, M., Yadav, A., Yamada, S.: Constant input attribute based (and predicate) encryption from evasive and tensor LWE. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part IV. LNCS, vol. 14084, pp. 532\u2013564. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_17"},{"key":"10_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-031-38551-3_15","volume-title":"CRYPTO 2023, Part IV","author":"S Agrawal","year":"2023","unstructured":"Agrawal, S., Tomida, J., Yadav, A.: Attribute-based multi-input FE (and more) for attribute-weighted sums. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part IV. LNCS, vol. 14084, pp. 464\u2013497. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_15"},{"key":"10_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-031-15802-5_21","volume-title":"CRYPTO 2022, Part I","author":"S Agrawal","year":"2022","unstructured":"Agrawal, S., Yadav, A., Yamada, S.: Multi-input attribute based encryption and predicate encryption. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 590\u2013621. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_21"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-45239-0_5","volume-title":"Cryptography and Coding","author":"J Alwen","year":"2013","unstructured":"Alwen, J., et al.: On the relationship between functional encryption, obfuscation, and fully homomorphic encryption. In: Stam, M. (ed.) IMACC 2013. LNCS, vol. 8308, pp. 65\u201384. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45239-0_5"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.2478\/popets-2021-0003","volume":"2021","author":"M Ambrona","year":"2021","unstructured":"Ambrona, M., Fiore, D., Soriente, C.: Controlled functional encryption revisited: multi-authority extensions and efficient schemes for quadratic functions. PoPETs 2021(1), 21\u201342 (2021). https:\/\/doi.org\/10.2478\/popets-2021-0003","journal-title":"PoPETs"},{"key":"10_CR18","unstructured":"Ananth, P., Jain, A., Sahai, A.: 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":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-662-47989-6_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"P Ananth","year":"2015","unstructured":"Ananth, P., Jain, A.: Indistinguishability obfuscation from compact functional encryption. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015, Part I. LNCS, vol. 9215, pp. 308\u2013326. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_15"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-662-53890-6_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"S Badrinarayanan","year":"2016","unstructured":"Badrinarayanan, S., Goyal, V., Jain, A., Sahai, A.: Verifiable functional encryption. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part II. LNCS, vol. 10032, pp. 557\u2013587. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_19"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-662-48797-6_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"S Badrinarayanan","year":"2015","unstructured":"Badrinarayanan, S., Gupta, D., Jain, A., Sahai, A.: Multi-input functional encryption for unbounded arity functions. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015, Part I. LNCS, vol. 9452, pp. 27\u201351. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_2"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/978-3-030-03807-6_23","volume-title":"Theory of Cryptography","author":"S Badrinarayanan","year":"2018","unstructured":"Badrinarayanan, S., Khurana, D., Sahai, A., Waters, B.: Upgrading to functional encryption. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part I. LNCS, vol. 11239, pp. 629\u2013658. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_23"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/978-3-030-75248-4_25","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"P Bhatotia","year":"2021","unstructured":"Bhatotia, P., Kohlweiss, M., Martinico, L., Tselekounis, Y.: Steel: composable hardware-based stateful and randomised functional encryption. In: Garay, J.A. (ed.) PKC 2021, Part II. LNCS, vol. 12711, pp. 709\u2013736. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_25"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-662-46803-6_19","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"D Boneh","year":"2015","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: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 563\u2013594. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_19"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-19571-6_16","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: definitions and challenges. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 253\u2013273. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_16"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_15"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-54242-8_3","volume-title":"Theory of Cryptography","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Chung, K.-M., Pass, R.: On extractability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 52\u201373. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_3"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-54631-0_29","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 501\u2013519. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_29"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-319-98113-0_23","volume-title":"Security and Cryptography for Networks","author":"Z Brakerski","year":"2018","unstructured":"Brakerski, Z., Jain, A., Komargodski, I., Passel\u00e8gue, A., Wichs, D.: Non-trivial witness encryption and null-iO from standard assumptions. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 425\u2013441. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_23"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1007\/978-3-662-49896-5_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Z Brakerski","year":"2016","unstructured":"Brakerski, Z., Komargodski, I., Segev, G.: Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 852\u2013880. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_30"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-662-49096-9_8","volume-title":"Theory of Cryptography","author":"M Bun","year":"2016","unstructured":"Bun, M., Zhandry, M.: Order-revealing encryption and the hardness of private learning. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016, Part I. LNCS, vol. 9562, pp. 176\u2013206. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_8"},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"Carmer, B., Malozemoff, A.J., Raykova, M.: 5Gen-C: multi-input functional encryption and program obfuscation for arithmetic circuits. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 747\u2013764. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3133983","DOI":"10.1145\/3133956.3133983"},{"key":"10_CR34","unstructured":"Chandran, N., Goyal, V., Jain, A., Sahai, A.: Functional encryption: decentralised and delegatable. Cryptology ePrint Archive, Report 2015\/1017 (2015). https:\/\/eprint.iacr.org\/2015\/1017"},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-662-52993-5_24","volume-title":"Fast Software Encryption","author":"N Chenette","year":"2016","unstructured":"Chenette, N., Lewi, K., Weis, S.A., Wu, D.J.: Practical order-revealing encryption with limited leakage. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 474\u2013493. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_24"},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/978-3-030-03329-3_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"J Chotard","year":"2018","unstructured":"Chotard, J., Dufour Sans, E., Gay, R., Phan, D.H., Pointcheval, D.: Decentralized multi-client functional encryption for inner product. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part II. LNCS, vol. 11273, pp. 703\u2013732. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_24"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Chotard, J., Dufour Sans, E., Gay, R., Phan, D.H., Pointcheval, D.: Multi-client functional encryption with repetition for inner product. Cryptology ePrint Archive, Report 2018\/1021 (2018). https:\/\/eprint.iacr.org\/2018\/1021","DOI":"10.1007\/978-3-030-03329-3_24"},{"key":"10_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/978-3-030-56784-2_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"J Chotard","year":"2020","unstructured":"Chotard, J., Dufour-Sans, E., Gay, R., Phan, D.H., Pointcheval, D.: Dynamic decentralized functional encryption. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part I. LNCS, vol. 12170, pp. 747\u2013775. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_25"},{"key":"10_CR39","unstructured":"Datta, P., Guan, J., Korb, A., Sahai, A.: (Multi-input) FE for randomized functionalities, revisited. Cryptology ePrint Archive, Report 2025\/330 (2025). https:\/\/eprint.iacr.org\/2025\/330"},{"key":"10_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-76581-5_9","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"P Datta","year":"2018","unstructured":"Datta, P., Okamoto, T., Tomida, J.: Full-hiding (unbounded) multi-input inner product functional encryption from the k-linear assumption. In: Abdalla, M., Dahab, R. (eds.) PKC 2018, Part II. LNCS, vol. 10770, pp. 245\u2013277. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76581-5_9"},{"key":"10_CR41","unstructured":"De Caro, A., Iovino, V.: On the power of rewinding simulators in functional encryption. Cryptology ePrint Archive, Report 2013\/752 (2013). https:\/\/eprint.iacr.org\/2013\/752"},{"key":"10_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-642-40084-1_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A De Caro","year":"2013","unstructured":"De Caro, A., Iovino, V., Jain, A., O\u2019Neill, A., Paneth, O., Persiano, G.: On the achievability of simulation-based security for functional encryption. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 519\u2013535. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_29"},{"key":"10_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-319-70278-0_7","volume-title":"Financial Cryptography and Data Security","author":"Y Desmedt","year":"2017","unstructured":"Desmedt, Y., Iovino, V., Persiano, G., Visconti, I.: Controlled homomorphic encryption: definition and construction. In: Brenner, M., et al. (eds.) FC 2017. LNCS, vol. 10323, pp. 107\u2013129. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70278-0_7"},{"key":"10_CR44","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-031-30620-4_19","volume-title":"EUROCRYPT 2023, Part III","author":"D Francati","year":"2023","unstructured":"Francati, D., Friolo, D., Malavolta, G., Venturi, D.: Multi-key and multi-input predicate encryption from learning with errors. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part III. LNCS, vol. 14006, pp. 573\u2013604. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_19"},{"issue":"3","key":"10_CR45","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s00145-024-09504-7","volume":"37","author":"D Francati","year":"2024","unstructured":"Francati, D., Friolo, D., Malavolta, G., Venturi, D.: Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors. J. Cryptol. 37(3), 24 (2024). https:\/\/doi.org\/10.1007\/s00145-024-09504-7","journal-title":"J. Cryptol."},{"key":"10_CR46","doi-asserted-by":"publisher","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th FOCS, pp. 40\u201349. IEEE Computer Society Press (2013). https:\/\/doi.org\/10.1109\/FOCS.2013.13","DOI":"10.1109\/FOCS.2013.13"},{"key":"10_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-662-44371-2_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S Garg","year":"2014","unstructured":"Garg, S., Gentry, C., Halevi, S., Wichs, D.: On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 518\u2013535. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_29"},{"key":"10_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-662-49099-0_18","volume-title":"Theory of Cryptography","author":"S Garg","year":"2016","unstructured":"Garg, S., Gentry, C., Halevi, S., Zhandry, M.: Functional encryption without obfuscation. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016, Part II. LNCS, vol. 9563, pp. 480\u2013511. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_18"},{"key":"10_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-55220-5_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Goldwasser","year":"2014","unstructured":"Goldwasser, S., et al.: Multi-input functional encryption. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 578\u2013602. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_32"},{"key":"10_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-662-53890-6_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"V Goyal","year":"2016","unstructured":"Goyal, V., Jain, A., O\u2019Neill, A.: Multi-input functional encryption with unbounded-message security. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part II. LNCS, vol. 10032, pp. 531\u2013556. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_18"},{"key":"10_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-662-46497-7_13","volume-title":"Theory of Cryptography","author":"V Goyal","year":"2015","unstructured":"Goyal, V., Jain, A., Koppula, V., Sahai, A.: Functional encryption for randomized functionalities. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part II. LNCS, vol. 9015, pp. 325\u2013351. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_13"},{"key":"10_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-319-48965-0_37","volume-title":"Cryptology and Network Security","author":"V Iovino","year":"2016","unstructured":"Iovino, V., Tang, Q., \u017bebrowski, K.: On the power of public-key function-private functional encryption. In: Foresti, S., Persiano, G. (eds.) CANS 2016. LNCS, vol. 10052, pp. 585\u2013593. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48965-0_37"},{"key":"10_CR53","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Khuller, S., Williams, V.V. (eds.) 53rd ACM STOC, pp. 60\u201373. ACM Press (2021). https:\/\/doi.org\/10.1145\/3406325.3451093","DOI":"10.1145\/3406325.3451093"},{"key":"10_CR54","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/978-3-031-06944-4_23","volume-title":"EUROCRYPT 2022, Part I","author":"A Jain","year":"2022","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from LPN over $$\\mathbb{F} _p$$, DLIN, and PRGs in $${NC}^0$$. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 670\u2013699. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_23"},{"key":"10_CR55","doi-asserted-by":"publisher","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 669\u2013684. ACM Press (2013). https:\/\/doi.org\/10.1145\/2508859.2516668","DOI":"10.1145\/2508859.2516668"},{"key":"10_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-319-98113-0_29","volume-title":"Security and Cryptography for Networks","author":"S Kim","year":"2018","unstructured":"Kim, S., Lewi, K., Mandal, A., Montgomery, H., Roy, A., Wu, D.J.: Function-hiding inner product encryption is practical. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 544\u2013562. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_29"},{"key":"10_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/978-3-319-78375-8_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"F Kitagawa","year":"2018","unstructured":"Kitagawa, F., Nishimaki, R., Tanaka, K.: Obfustopia built on secret-key functional encryption. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part II. LNCS, vol. 10821, pp. 603\u2013648. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_20"},{"key":"10_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-319-56620-7_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"I Komargodski","year":"2017","unstructured":"Komargodski, I., Segev, G.: From minicrypt to obfustopia via private-key functional encryption. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part I. LNCS, vol. 10210, pp. 122\u2013151. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_5"},{"key":"10_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-662-46497-7_14","volume-title":"Theory of Cryptography","author":"I Komargodski","year":"2015","unstructured":"Komargodski, I., Segev, G., Yogev, E.: Functional encryption for randomized functionalities in the private-key setting from minimal assumptions. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part II. LNCS, vol. 9015, pp. 352\u2013377. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_14"},{"key":"10_CR60","doi-asserted-by":"publisher","unstructured":"Lewi, K., Wu, D.J.: Order-revealing encryption: new constructions, applications, and lower bounds. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 1167\u20131178. ACM Press (2016). https:\/\/doi.org\/10.1145\/2976749.2978376","DOI":"10.1145\/2976749.2978376"},{"key":"10_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-030-34618-8_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"B Libert","year":"2019","unstructured":"Libert, B., \u0162i\u0163iu, R.: Multi-client functional encryption for linear functions in the standard model from LWE. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part III. LNCS, vol. 11923, pp. 520\u2013551. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_18"},{"key":"10_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-319-63688-7_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"H Lin","year":"2017","unstructured":"Lin, H.: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 599\u2013629. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_20"},{"issue":"1","key":"10_CR63","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1093\/comjnl\/bxz154","volume":"63","author":"M Liu","year":"2020","unstructured":"Liu, M., Zhang, P.: An adaptively secure functional encryption for randomized functions. Comput. J. 63(1), 1247\u20131258 (2020). https:\/\/doi.org\/10.1093\/comjnl\/bxz154","journal-title":"Comput. J."},{"key":"10_CR64","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-981-99-8733-7_2","volume-title":"ASIACRYPT 2023, Part V","author":"DD Nguyen","year":"2023","unstructured":"Nguyen, D.D., Phan, D.H., Pointcheval, D.: Verifiable decentralized multi-client functional encryption for inner product. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part V. LNCS, vol. 14442, pp. 33\u201365. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_2"},{"key":"10_CR65","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-031-22963-3_4","volume-title":"ASIACRYPT 2022, Part I","author":"K Nguyen","year":"2022","unstructured":"Nguyen, K., Phan, D.H., Pointcheval, D.: Multi-client functional encryption with fine-grained access control. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part I. LNCS, vol. 13791, pp. 95\u2013125. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_4"},{"key":"10_CR66","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-031-33491-7_13","volume-title":"ACNS 2023, Part II","author":"K Nguyen","year":"2023","unstructured":"Nguyen, K., Phan, D.H., Pointcheval, D.: Optimal security notion for decentralized multi-client functional encryption. In: Tibouchi, M., Wang, X. (eds.) ACNS 2023, Part II. LNCS, vol. 13906, pp. 336\u2013365. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33491-7_13"},{"key":"10_CR67","unstructured":"O\u2019Neill, A.: Definitional issues in functional encryption. Cryptology ePrint Archive, Report 2010\/556 (2010). https:\/\/eprint.iacr.org\/2010\/556"},{"key":"10_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"C Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D.R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 433\u2013444. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_35"},{"key":"10_CR69","doi-asserted-by":"publisher","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: 40th FOCS, pp. 543\u2013553. IEEE Computer Society Press (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814628","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"10_CR70","doi-asserted-by":"publisher","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 475\u2013484. ACM Press (2014). https:\/\/doi.org\/10.1145\/2591796.2591825","DOI":"10.1145\/2591796.2591825"},{"key":"10_CR71","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/978-3-031-31368-4_22","volume-title":"PKC 2023, Part I","author":"E Shi","year":"2023","unstructured":"Shi, E., Vanjani, N.: Multi-client inner product encryption: function-hiding instantiations without random oracles. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023, Part I. LNCS, vol. 13940, pp. 622\u2013651. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_22"},{"key":"10_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-030-34618-8_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"J Tomida","year":"2019","unstructured":"Tomida, J.: Tightly secure inner product functional\u00a0encryption: multi-input and\u00a0function-hiding constructions. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part III. LNCS, vol. 11923, pp. 459\u2013488. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_16"},{"key":"10_CR73","doi-asserted-by":"publisher","unstructured":"Waters, B., Wu, D.J.: Adaptively-sound succinct arguments for NP from indistinguishability obfuscation. In: Mohar, B., Shinkar, I., O\u2019Donnell, R. (eds.) 56th ACM STOC, pp. 387\u2013398. ACM Press (2024). https:\/\/doi.org\/10.1145\/3618260.3649671","DOI":"10.1145\/3618260.3649671"},{"key":"10_CR74","unstructured":"Waters, B., Wu, D.J.: A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for NP. Cryptology ePrint Archive, Report 2024\/933 (2024). https:\/\/eprint.iacr.org\/2024\/933"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-12293-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T20:28:17Z","timestamp":1764620897000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12293-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"ISBN":["9783032122926","9783032122933"],"references-count":74,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12293-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,2]]},"assertion":[{"value":"2 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}