{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T05:32:37Z","timestamp":1746595957580,"version":"3.40.3"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031780196"},{"type":"electronic","value":"9783031780202"}],"license":[{"start":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:00:00Z","timestamp":1732924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:00:00Z","timestamp":1732924800000},"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-78020-2_2","type":"book-chapter","created":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T09:38:32Z","timestamp":1732959512000},"page":"31-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-client Attribute-Based and\u00a0Predicate Encryption from\u00a0Standard Assumptions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6668-683X","authenticated-orcid":false,"given":"David","family":"Pointcheval","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8643-9046","authenticated-orcid":false,"given":"Robert","family":"Sch\u00e4dlich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,30]]},"reference":[{"key":"2_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":"2_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":"2_CR3","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":"2_CR4","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":"2_CR5","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. LNCS, vol. 12828, pp. 208\u2013238. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_8"},{"key":"2_CR6","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":"2_CR7","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":"2_CR8","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":"2_CR9","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":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-030-64375-1_6","volume-title":"Theory of Cryptography","author":"S Agrawal","year":"2020","unstructured":"Agrawal, S., Wichs, D., Yamada, S.: Optimal Broadcast Encryption from LWE and Pairings in the Standard Model. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 149\u2013178. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_6"},{"key":"2_CR11","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":"2_CR12","unstructured":"Ambrona, M., Gay, R.: Multi-authority ABE, revisited. Cryptology ePrint Archive, Report 2021\/1381 (2021). https:\/\/eprint.iacr.org\/2021\/1381"},{"key":"2_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-031-31371-4_11","volume-title":"PKC 2023, Part II","author":"M Ambrona","year":"2023","unstructured":"Ambrona, M., Gay, R.: Multi-authority ABE for non-monotonic access structures. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023, Part II. LNCS, vol. 13941, pp. 306\u2013335. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_11"},{"key":"2_CR14","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. LNCS, vol. 9215, pp. 308\u2013326. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_15"},{"key":"2_CR15","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":"2_CR16","unstructured":"Beimel, A.: Secure schemes for secret sharing and key distribution. Ph.D. thesis, Technion - Israel Institute of Technology, Haifa, Israel (1996). https:\/\/www.cs.bgu.ac.il\/~beimel\/Papers\/thesis.pdf"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"J Benaloh","year":"1990","unstructured":"Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27\u201335. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_3"},{"key":"2_CR18","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":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-70936-7_29","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2007","unstructured":"Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 535\u2013554. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_29"},{"key":"2_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-319-98113-0_23","volume-title":"SCN 18","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 18. LNCS, vol. 11035, pp. 425\u2013441. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_23"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Chen, J., Lim, H.W., Ling, S., Wang, H., Wee, H.: Shorter IBE and signatures via asymmetric pairings. In: Abdalla, M., Lange, T. (eds.) Pairing 2012. LNCS, vol. 7708, pp. 122\u2013140. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36334-4_8","DOI":"10.1007\/978-3-642-36334-4_8"},{"key":"2_CR22","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":"2_CR23","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":"2_CR24","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":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-40084-1_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A Escala","year":"2013","unstructured":"Escala, A., Herold, G., Kiltz, E., R\u00e0fols, C., Villar, J.: An algebraic framework for Diffie-Hellman assumptions. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 129\u2013147. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_8"},{"key":"2_CR26","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"},{"key":"2_CR27","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":"2_CR28","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":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-030-64375-1_9","volume-title":"Theory of Cryptography","author":"R Goyal","year":"2020","unstructured":"Goyal, R., Koppula, V., Vusirikala, S., Waters, B.: On perfect correctness in (lockable) obfuscation. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 229\u2013259. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_9"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Goyal, R., Koppula, V., Waters, B.: Lockable obfuscation. In: Umans, C. (ed.) 58th FOCS, pp. 612\u2013621. IEEE Computer Society Press (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.62","DOI":"10.1109\/FOCS.2017.62"},{"key":"2_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 (2006). https:\/\/doi.org\/10.1145\/1180405.1180418, available as Cryptology ePrint Archive Report 2006\/309","DOI":"10.1145\/1180405.1180418"},{"issue":"4","key":"2_CR32","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1007\/s00145-016-9243-7","volume":"30","author":"CS Jutla","year":"2016","unstructured":"Jutla, C.S., Roy, A.: Shorter quasi-adaptive NIZK proofs for linear subspaces. J. Cryptol. 30(4), 1116\u20131156 (2016). https:\/\/doi.org\/10.1007\/s00145-016-9243-7","journal-title":"J. Cryptol."},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-642-11799-2_27","volume-title":"Theory of Cryptography","author":"A Lewko","year":"2010","unstructured":"Lewko, A., Waters, B.: New techniques for dual system encryption and fully secure HIBE with short ciphertexts. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 455\u2013479. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_27"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-642-20465-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"A Lewko","year":"2011","unstructured":"Lewko, A., Waters, B.: Decentralizing attribute-based encryption. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 568\u2013588. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_31"},{"key":"2_CR35","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/978-3-031-22318-1_24","volume-title":"TCC 2022, Part I","author":"H Li","year":"2022","unstructured":"Li, H., Lin, H., Luo, J.: ABE for circuits with constant-size secret keys and adaptive security. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part I. LNCS, vol. 13747, pp. 680\u2013710. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_24"},{"key":"2_CR36","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. LNCS, vol. 11923, pp. 520\u2013551. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_18"},{"key":"2_CR37","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. LNCS, vol. 10401, pp. 599\u2013629. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_20"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-45727-3_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"H Lin","year":"2020","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"},{"key":"2_CR39","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, Part III. LNCS, vol. 12493, pp. 437\u2013466. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_15"},{"key":"2_CR40","doi-asserted-by":"publisher","unstructured":"Lin, H., Vaikuntanathan, V.: Indistinguishability obfuscation from DDH-like assumptions on constant-degree graded encodings. In: Dinur, I. (ed.) 57th FOCS, pp. 11\u201320. IEEE Computer Society Press (2016). https:\/\/doi.org\/10.1109\/FOCS.2016.11","DOI":"10.1109\/FOCS.2016.11"},{"key":"2_CR41","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":"2_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11426639_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"A Sahai","year":"2005","unstructured":"Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 457\u2013473. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_27"},{"key":"2_CR43","doi-asserted-by":"publisher","unstructured":"Shi, E., Bethencourt, J., Chan, H.T.H., Song, D.X., Perrig, A.: Multi-dimensional range query over encrypted data. In: 2007 IEEE Symposium on Security and Privacy, pp. 350\u2013364. IEEE Computer Society Press (2007). https:\/\/doi.org\/10.1109\/SP.2007.29","DOI":"10.1109\/SP.2007.29"},{"key":"2_CR44","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. LNCS, vol. 11923, pp. 459\u2013488. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_16"},{"key":"2_CR45","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-031-15802-5_19","volume-title":"CRYPTO 2022, Part I","author":"R Tsabary","year":"2022","unstructured":"Tsabary, R.: Candidate witness encryption from lattice techniques. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 535\u2013559. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_19"},{"key":"2_CR46","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-031-22963-3_7","volume-title":"ASIACRYPT 2022, Part I","author":"V Vaikuntanathan","year":"2022","unstructured":"Vaikuntanathan, V., Wee, H., Wichs, D.: Witness encryption and null-IO from evasive LWE. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part I. LNCS, vol. 13791, pp. 195\u2013221. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_7"},{"key":"2_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-642-03356-8_36","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B Waters","year":"2009","unstructured":"Waters, B.: Dual system encryption: realizing fully secure IBE and HIBE under simple assumptions. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 619\u2013636. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_36"},{"key":"2_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-319-70500-2_8","volume-title":"Theory of Cryptography","author":"H Wee","year":"2017","unstructured":"Wee, H.: Attribute-hiding predicate encryption in bilinear groups, revisited. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 206\u2013233. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_8"},{"key":"2_CR49","doi-asserted-by":"publisher","unstructured":"Wichs, D., Zirdelis, G.: Obfuscating compute-and-compare programs under LWE. In: Umans, C. (ed.) 58th FOCS, pp. 600\u2013611. IEEE Computer Society Press (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.61","DOI":"10.1109\/FOCS.2017.61"}],"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-031-78020-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T10:02:24Z","timestamp":1732960944000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78020-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,30]]},"ISBN":["9783031780196","9783031780202"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78020-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,30]]},"assertion":[{"value":"30 November 2024","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":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}