{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T10:49:07Z","timestamp":1783162147074,"version":"3.54.6"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306198","type":"print"},{"value":"9783031306204","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30620-4_15","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T11:03:05Z","timestamp":1681470185000},"page":"447-478","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Fully Adaptive Decentralized Multi-Authority ABE"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3938-7594","authenticated-orcid":false,"given":"Pratish","family":"Datta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1647-2112","authenticated-orcid":false,"given":"Ilan","family":"Komargodski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brent","family":"Waters","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-662-49099-0_10","volume-title":"Theory of Cryptography","author":"S Agrawal","year":"2016","unstructured":"Agrawal, S., Chase, M.: A study of pair encodings: predicate encryption in prime order groups. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 259\u2013288. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_10"},{"key":"15_CR2","unstructured":"Ambrona, M., Gay, R.: Multi-authority ABE, revisited. IACR Cryptology ePrint Archive, Report 2021\/1381 (2021). https:\/\/eprint.iacr.org\/2021\/1381"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-662-48000-7_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"P Ananth","year":"2015","unstructured":"Ananth, P., Brakerski, Z., Segev, G., Vaikuntanathan, V.: From selective to adaptive security in functional encryption. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 657\u2013677. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_32"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-662-53890-6_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"N Attrapadung","year":"2016","unstructured":"Attrapadung, N.: Dual system encryption framework in prime-order groups via computational pair encodings. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 591\u2013623. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_20"},{"key":"15_CR5","unstructured":"Beimel, A.: Secure schemes for secret sharing and key distribution. PhD Thesis, Israel Institute of Technology, Technion, Haifa, Israel (1996). https:\/\/technion.primo.exlibrisgroup.com\/permalink\/972TEC_INST\/q1jq5o\/alma990021768270203971"},{"key":"15_CR6","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":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41\u201355. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_3"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325\u2013341. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_18"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-70936-7_28","volume-title":"Theory of Cryptography","author":"M Chase","year":"2007","unstructured":"Chase, M.: Multi-authority attribute based encryption. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 515\u2013534. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_28"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Chase, M., Chow, S.S.M.: Improving privacy and security in multi-authority attribute-based encryption. In: Conference on Computer and Communications Security - CCS, pp. 121\u2013130 (2009). https:\/\/doi.org\/10.1145\/1653662.1653678","DOI":"10.1145\/1653662.1653678"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-662-46803-6_20","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Chen","year":"2015","unstructured":"Chen, J., Gay, R., Wee, H.: Improved dual system ABE in prime-order groups via predicate encodings. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 595\u2013624. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_20"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-319-78381-9_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"J Chen","year":"2018","unstructured":"Chen, J., Gong, J., Kowalczyk, L., Wee, H.: Unbounded ABE via bilinear entropy expansion, revisited. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 503\u2013534. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_19"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-030-77870-5_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"P Datta","year":"2021","unstructured":"Datta, P., Komargodski, I., Waters, B.: Decentralized multi-authority ABE for DNFs from LWE. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 177\u2013209. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_7"},{"key":"15_CR15","unstructured":"Datta, P., Komargodski, I., Waters, B.: Decentralized multi-authority ABE for $${\\sf NC}^1$$ from Computational-BDH. IACR Cryptol. ePrint Arch., 1325 (2021). https:\/\/eprint.iacr.org\/2021\/1325"},{"key":"15_CR16","unstructured":"Datta, P., Komargodski, I., Waters, B.: Fully adaptive decentralized multi-authority ABE. Cryptology ePrint Archive, Paper 2022\/1311 (2022). https:\/\/eprint.iacr.org\/2022\/1311"},{"key":"15_CR17","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"},{"issue":"1","key":"15_CR18","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/s00145-015-9220-6","volume":"30","author":"A Escala","year":"2015","unstructured":"Escala, A., Herold, G., Kiltz, E., R\u00e0fols, C., Villar, J.: An algebraic framework for Diffie\u2013Hellman assumptions. J. Cryptol. 30(1), 242\u2013288 (2015). https:\/\/doi.org\/10.1007\/s00145-015-9220-6","journal-title":"J. Cryptol."},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-13190-5_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"DM Freeman","year":"2010","unstructured":"Freeman, D.M.: Converting pairing-based cryptosystems from composite-order groups to prime-order groups. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 44\u201361. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_3"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/978-3-662-53890-6_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"J Gong","year":"2016","unstructured":"Gong, J., Dong, X., Chen, J., Cao, Z.: Efficient IBE with tight reduction to standard assumption in the multi-challenge setting. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 624\u2013654. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_21"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-030-45727-3_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"J Gong","year":"2020","unstructured":"Gong, J., Wee, H.: Adaptively secure ABE for DFA from k-lin and more. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 278\u2013308. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_10"},{"key":"15_CR22","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: Conference on Computer and Communications Security - CCS, pp. 89\u201398. ACM (2006). https:\/\/doi.org\/10.1145\/1180405.1180418","DOI":"10.1145\/1180405.1180418"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-642-38980-1_22","volume-title":"Applied Cryptography and Network Security","author":"A Guillevic","year":"2013","unstructured":"Guillevic, A.: Comparing the pairing efficiency over composite-order and prime-order elliptic curves. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 357\u2013372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_22"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-540-74143-5_31","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"D Hofheinz","year":"2007","unstructured":"Hofheinz, D., Kiltz, E.: Secure hybrid encryption from weakened key encapsulation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 553\u2013571. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_31"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-662-48000-7_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"L Kowalczyk","year":"2015","unstructured":"Kowalczyk, L., Lewko, A.B.: Bilinear entropy expansion from the decisional linear assumption. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 524\u2013541. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_26"},{"key":"15_CR26","doi-asserted-by":"publisher","unstructured":"Kowalczyk, Lucas, Wee, Hoeteck: compact adaptively secure ABE for $${\\sf NC}^1$$ from k-Lin. J. Cryptol. 33(3), 954\u20131002 (2019). https:\/\/doi.org\/10.1007\/s00145-019-09335-x","DOI":"10.1007\/s00145-019-09335-x"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-29011-4_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Lewko","year":"2012","unstructured":"Lewko, A.: Tools for simulating features of composite order bilinear groups in the prime order setting. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 318\u2013335. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_20"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-13190-5_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"A Lewko","year":"2010","unstructured":"Lewko, A., Okamoto, T., Sahai, A., Takashima, K., Waters, B.: Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 62\u201391. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_4"},{"key":"15_CR29","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":"15_CR30","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":"15_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-642-20465-4_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"A Lewko","year":"2011","unstructured":"Lewko, A., Waters, B.: Unbounded HIBE and attribute-based encryption. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 547\u2013567. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_30"},{"key":"15_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-89754-5_33","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"H Lin","year":"2008","unstructured":"Lin, H., Cao, Z., Liang, X., Shao, J.: Secure threshold multi authority attribute based encryption without a central authority. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol. 5365, pp. 426\u2013436. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89754-5_33"},{"key":"15_CR33","doi-asserted-by":"publisher","unstructured":"Lin, H., Luo, J.: Compact adaptively secure ABE from k-Lin: Beyond $${\\sf NC}^1$$ and towards NL. In: anteaut, A., Ishai, Y. (eds) Advances in Cryptology - EUROCRYPT 2020, EUROCRYPT 2020. Lecture Notes in Computer Science, 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":"15_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-642-00730-9_2","volume-title":"Information Security and Cryptology \u2013 ICISC 2008","author":"S M\u00fcller","year":"2009","unstructured":"M\u00fcller, S., Katzenbeisser, S., Eckert, C.: Distributed attribute-based encryption. In: Lee, P.J., Cheon, J.H. (eds.) ICISC 2008. LNCS, vol. 5461, pp. 20\u201336. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00730-9_2"},{"key":"15_CR35","doi-asserted-by":"publisher","first-page":"803","DOI":"10.4134\/BKMS.2009.46.4.803","volume":"46","author":"S M\u00fcller","year":"2009","unstructured":"M\u00fcller, S., Katzenbeisser, S., Eckert, C.: On multi-authority ciphertext-policy attribute-based encryption. Bull. Korean Math. Soc. 46, 803\u2013819 (2009). https:\/\/doi.org\/10.4134\/BKMS.2009.46.4.803","journal-title":"Bull. Korean Math. Soc."},{"key":"15_CR36","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":"15_CR37","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":"15_CR38","doi-asserted-by":"publisher","unstructured":"Okamoto, T., Takashima, K.: Decentralized attribute-based encryption and signatures. IEICE Trans. Fundam. Electr. Commun. Comput. Sci. 103-A(1), 41\u201373 (2020). https:\/\/doi.org\/10.1587\/transfun.2019CIP0008","DOI":"10.1587\/transfun.2019CIP0008"},{"key":"15_CR39","doi-asserted-by":"crossref","unstructured":"de la Piedra, A., Venema, M., Alp\u00e1r, G.: Abe squared: accurately benchmarking efficiency of attribute-based encryption. IACR Cryptology ePrint Archive, Report 2022\/038 (2022). https:\/\/eprint.iacr.org\/2022\/038","DOI":"10.46586\/tches.v2022.i2.192-239"},{"key":"15_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-662-47854-7_19","volume-title":"Financial Cryptography and Data Security","author":"Y Rouselakis","year":"2015","unstructured":"Rouselakis, Y., Waters, B.: Efficient statically-secure large-universe multi-authority attribute-based encryption. In: B\u00f6hme, R., Okamoto, T. (eds.) FC 2015. LNCS, vol. 8975, pp. 315\u2013332. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47854-7_19"},{"key":"15_CR41","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":"15_CR42","unstructured":"Shacham, H.: A cramer-shoup encryption scheme from the linear assumption and from progressively weaker linear variants. IACR Cryptol. ePrint Arch. 2007, 74 (2007). https:\/\/eprint.iacr.org\/2007\/074"},{"key":"15_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-031-15802-5_19","volume-title":"Advances in Cryptology - CRYPTO 2022, CRYPTO 2022","author":"R Tsabary","year":"2022","unstructured":"Tsabary, R.: Candidate witness encryption from lattice techniques. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022, CRYPTO 2022. Lecture Notes in Computer Science, vol. 13507, pp. 535\u2013559. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_19"},{"issue":"1\u20133","key":"15_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000010","volume":"7","author":"SP Vadhan","year":"2012","unstructured":"Vadhan, S.P.: Pseudorandomness. Found. Trends Theor. Comput. Sci. 7(1\u20133), 1\u2013336 (2012). https:\/\/doi.org\/10.1561\/0400000010","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"15_CR45","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":"15_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-19379-8_4","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"B Waters","year":"2011","unstructured":"Waters, B.: Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 53\u201370. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_4"},{"key":"15_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":"15_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/978-3-031-22318-1_23","volume-title":"Theory of Cryptography","author":"B Waters","year":"2022","unstructured":"Waters, B., Wee, H., Wu, D.: Multi-authority ABE from lattices without random oracles. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022. Lecture Notes in Computer Science, vol. 13747, pp. 651\u2013679. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_23"},{"key":"15_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-031-07085-3_8","volume-title":"Advances in Cryptology - EUROCRYPT 2022","author":"H Wee","year":"2022","unstructured":"Wee, H.: Optimal broadcast encryption and CP-ABE from evasive lattice assumptions. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. Lecture Notes in Computer Science, vol. 13276, pp. 217\u2013241. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_8"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30620-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:03:32Z","timestamp":1744754612000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30620-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306198","9783031306204"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30620-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"415","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}