{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T04:02:09Z","timestamp":1746763329875,"version":"3.40.5"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031918315","type":"print"},{"value":"9783031918322","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-91832-2_1","type":"book-chapter","created":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T08:24:10Z","timestamp":1746692650000},"page":"3-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-Client Attribute-Based Unbounded Inner Product Functional Encryption, and\u00a0More"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4013-6995","authenticated-orcid":false,"given":"Subhranil","family":"Dutta","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7073-0258","authenticated-orcid":false,"given":"Aikaterini","family":"Mitrokotsa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6278-0418","authenticated-orcid":false,"given":"Tapas","family":"Pal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5329-0138","authenticated-orcid":false,"given":"Jenit","family":"Tomy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,5]]},"reference":[{"key":"1_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. LNCS, vol. 11923, pp. 552\u2013582. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_19"},{"key":"1_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. LNCS, vol. 11443, pp. 128\u2013157. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_5"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-662-46447-2_33","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"M Abdalla","year":"2015","unstructured":"Abdalla, M., Bourse, F., De Caro, A., Pointcheval, D.: Simple functional encryption schemes for inner products. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 733\u2013751. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_33"},{"key":"1_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. LNCS, vol. 10991, pp. 597\u2013627. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_20"},{"key":"1_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. LNCS, vol. 12493, pp. 467\u2013497. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_16"},{"key":"1_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. LNCS, vol. 10210, pp. 601\u2013626. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_21"},{"key":"1_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. LNCS, vol. 12170, pp. 685\u2013716. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_23"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-030-90453-1_8","volume-title":"Theory of Cryptography","author":"S Agrawal","year":"2021","unstructured":"Agrawal, S., Goyal, R., Tomida, J.: Multi-party functional encryption. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 224\u2013255. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_8"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Goyal, R., Tomida, J.: Multi-input quadratic functional encryption: Stronger security, broader functionality. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022, Part\u00a0I. LNCS, vol. 13747, pp. 711\u2013740. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_25","DOI":"10.1007\/978-3-031-22318-1_25"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-662-53015-3_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"S Agrawal","year":"2016","unstructured":"Agrawal, S., Libert, B., Stehl\u00e9, D.: Fully secure functional encryption for inner products, from standard assumptions. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 333\u2013362. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_12"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-84259-8_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"S Agrawal","year":"2021","unstructured":"Agrawal, S., Maitra, M., Vempati, N.S., Yamada, S.: Functional encryption for Turing machines with dynamic bounded collusion from LWE. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 239\u2013269. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_9"},{"key":"1_CR12","doi-asserted-by":"publisher","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\u00a02023, Part\u00a0IV. LNCS, vol. 14084, pp. 464\u2013497. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_15","DOI":"10.1007\/978-3-031-38551-3_15"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Yadav, A., Yamada, S.: Multi-input attribute based encryption and predicate encryption. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0I. LNCS, vol. 13507, pp. 590\u2013621. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_21","DOI":"10.1007\/978-3-031-15802-5_21"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-662-49096-9_6","volume-title":"Theory of Cryptography","author":"P Ananth","year":"2016","unstructured":"Ananth, P., Sahai, A.: Functional encryption for Turing machines. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 125\u2013153. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_6"},{"key":"1_CR15","unstructured":"Beimel, A.: Secure schemes for secret sharing and key distribution. Ph.D. thesis, Technion - Israel Institute of Technology, Israel (1996). https:\/\/technion.primo.exlibrisgroup.com\/permalink\/972TEC_INST\/q1jq5o\/alma990021768270203971"},{"key":"1_CR16","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":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-63715-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"C Cho","year":"2017","unstructured":"Cho, C., D\u00f6ttling, N., Garg, S., Gupta, D., Miao, P., Polychroniadou, A.: Laconic oblivious transfer and its applications. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 33\u201365. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_2"},{"key":"1_CR18","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. LNCS, vol. 11273, pp. 703\u2013732. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_24"},{"key":"1_CR19","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. LNCS, vol. 12170, pp. 747\u2013775. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_25"},{"key":"1_CR20","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 (2018). https:\/\/eprint.iacr.org\/2018\/1021","DOI":"10.1007\/978-3-030-03329-3_24"},{"key":"1_CR21","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. LNCS, vol. 10770, pp. 245\u2013277. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76581-5_9"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-030-92068-5_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"P Datta","year":"2021","unstructured":"Datta, P., Pal, T.: (Compact) adaptively secure FE for\u00a0attribute-weighted sums from\u00a0k-Lin. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 434\u2013467. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_15"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Datta, P., Pal, T.: Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023, Part\u00a0I. LNCS, vol. 13940, pp. 587\u2013621. Springer, Cham. (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_21","DOI":"10.1007\/978-3-031-31368-4_21"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Datta, P., Pal, T., Takashima, K.: Compact FE for unbounded attribute-weighted sums for logspace from SXDH. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0I. LNCS, vol. 13791, pp. 126\u2013159. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_5","DOI":"10.1007\/978-3-031-22963-3_5"},{"issue":"3","key":"1_CR25","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00145-023-09458-2","volume":"36","author":"U Dowerah","year":"2023","unstructured":"Dowerah, U., Dutta, S., Mitrokotsa, A., Mukherjee, S., Pal, T.: Unbounded predicate inner product functional encryption from pairings. J. Cryptol. 36(3), 29 (2023). https:\/\/doi.org\/10.1007\/s00145-023-09458-2","journal-title":"J. Cryptol."},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-030-21568-2_21","volume-title":"Applied Cryptography and Network Security","author":"E Dufour-Sans","year":"2019","unstructured":"Dufour-Sans, E., Pointcheval, D.: Unbounded inner-product functional encryption with succinct keys. In: Deng, R.H., Gauthier-Uma\u00f1a, V., Ochoa, M., Yung, M. (eds.) ACNS 2019. LNCS, vol. 11464, pp. 426\u2013441. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21568-2_21"},{"key":"1_CR27","doi-asserted-by":"publisher","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\u00a02023, Part\u00a0III. LNCS, vol. 14006, pp. 573\u2013604. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_19","DOI":"10.1007\/978-3-031-30620-4_19"},{"key":"1_CR28","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, Berkeley, CA, USA, October 26\u201329 2013. https:\/\/doi.org\/10.1109\/FOCS.2013.13","DOI":"10.1109\/FOCS.2013.13"},{"key":"1_CR29","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. LNCS, vol. 9563, pp. 480\u2013511. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_18"},{"key":"1_CR30","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":"1_CR31","doi-asserted-by":"publisher","unstructured":"Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Juels, A., Wright, R.N., De Capitani di Vimercati, S. (eds.) ACM CCS 2006, pp. 89\u201398. ACM Press, Alexandria, Virginia, USA, October 30\u2013November 3 2006. https:\/\/doi.org\/10.1145\/1180405.1180418","DOI":"10.1145\/1180405.1180418"},{"key":"1_CR32","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, Virtual Event, Italy, June 21\u201325 2021. https:\/\/doi.org\/10.1145\/3406325.3451093","DOI":"10.1145\/3406325.3451093"},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Li, Y., Wei, J., Guo, F., Susilo, W., Chen, X.: Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14442, pp. 134\u2013165. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_5","DOI":"10.1007\/978-981-99-8733-7_5"},{"key":"1_CR34","doi-asserted-by":"publisher","unstructured":"Libert, B., Titiu, R.: Multi-client functional encryption for linear functions in the standard model from LWE. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT\u00a02019, Part\u00a0III. LNCS, vol. 11923, pp. 520\u2013551. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_5","DOI":"10.1007\/978-981-99-8733-7_5"},{"key":"1_CR35","doi-asserted-by":"publisher","unstructured":"Lin, H., Luo, J.: Compact adaptively secure ABE from $$k$$-Lin: Beyond $$\\sf {NC}^{1}$$ and towards $$\\sf {NL}$$. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 247\u2013277. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_9","DOI":"10.1007\/978-3-030-45727-3_9"},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-030-64840-4_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"H Lin","year":"2020","unstructured":"Lin, H., Luo, J.: Succinct and adaptively secure ABE for ABP from k-Lin. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 437\u2013466. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_15"},{"key":"1_CR37","doi-asserted-by":"publisher","unstructured":"Nguyen, K., Phan, D.H., Pointcheval, D.: Multi-client functional encryption with fine-grained access control. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0I. LNCS, vol. 13791, pp. 95\u2013125. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_4","DOI":"10.1007\/978-3-031-22963-3_4"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Nguyen, K., Phan, D.H., Pointcheval, D.: Multi-client functional encryption with public inputs and strong security. Cryptology ePrint Archive, Paper 2024\/740 (2024). https:\/\/eprint.iacr.org\/2024\/740","DOI":"10.62056\/andkp2fgx"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Nguyen, K., Pointcheval, D., Sch\u00e4dlich, R.: Decentralized multi-client functional encryption with strong security. Cryptology ePrint Archive (2024). https:\/\/eprint.iacr.org\/2024\/764","DOI":"10.62056\/andkp2fgx"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-14623-7_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"T Okamoto","year":"2010","unstructured":"Okamoto, T., Takashima, K.: Fully secure functional encryption with general relations from the decisional linear assumption. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 191\u2013208. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_11"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-642-34961-4_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"T Okamoto","year":"2012","unstructured":"Okamoto, T., Takashima, K.: Fully secure unbounded inner-product and attribute-based encryption. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 349\u2013366. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_22"},{"key":"1_CR42","doi-asserted-by":"publisher","unstructured":"Okamoto, T., Takashima, K.: Dual pairing vector spaces and their applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(1), 3\u201315 (2015). https:\/\/doi.org\/10.1587\/TRANSFUN.E98.A.3","DOI":"10.1587\/TRANSFUN.E98.A.3"},{"key":"1_CR43","unstructured":"O\u2019Neill, A.: Definitional issues in functional encryption. Cryptology ePrint Archive (2010). https:\/\/eprint.iacr.org\/2010\/556"},{"key":"1_CR44","doi-asserted-by":"publisher","unstructured":"Shi, E., Vanjani, N.: Multi-client inner product encryption: Function-hiding instantiations without random oracles. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023, Part\u00a0I. LNCS, vol. 13940, pp. 622\u2013651. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_22","DOI":"10.1007\/978-3-031-31368-4_22"},{"key":"1_CR45","doi-asserted-by":"publisher","unstructured":"Tomida, J.: Unbounded quadratic functional encryption and more from pairings. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0III. LNCS, vol. 14006, pp. 543\u2013572. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_18","DOI":"10.1007\/978-3-031-30620-4_18"},{"key":"1_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-030-03329-3_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"J Tomida","year":"2018","unstructured":"Tomida, J., Takashima, K.: Unbounded inner product functional encryption from bilinear maps. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 609\u2013639. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_21"},{"key":"1_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1007\/978-3-662-48000-7_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"B Waters","year":"2015","unstructured":"Waters, B.: A punctured programming approach to adaptively secure functional encryption. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 678\u2013697. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_33"},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-030-64375-1_8","volume-title":"Theory of Cryptography","author":"H Wee","year":"2020","unstructured":"Wee, H.: Functional encryption for quadratic functions from k-Lin, revisited. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 210\u2013228. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_8"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91832-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T08:24:13Z","timestamp":1746692653000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91832-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031918315","9783031918322"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91832-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"R\u00f8ros","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","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":"12 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}