{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:30:47Z","timestamp":1778128247223,"version":"3.51.4"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031780196","type":"print"},{"value":"9783031780202","type":"electronic"}],"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_6","type":"book-chapter","created":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T09:38:38Z","timestamp":1732959518000},"page":"156-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Distributed Broadcast Encryption from\u00a0Lattices"],"prefix":"10.1007","author":[{"given":"Jeffrey","family":"Champion","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David J.","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,30]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-642-13190-5_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S Agrawal","year":"2010","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 553\u2013572. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_28"},{"key":"6_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-031-15979-4_4","volume-title":"CRYPTO 2022","author":"MR Albrecht","year":"2022","unstructured":"Albrecht, M.R., Cini, V., Lai, R.W.F., Malavolta, R.W.F., Thyagarajan, S.A.K.: Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable - (extended abstract). In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508, pp. 102\u2013132. Springer, Cham (2022)"},{"key":"6_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-031-58754-2_4","volume-title":"EUROCRYPT 2024","author":"MR Albrecht","year":"2024","unstructured":"Albrecht, M.R., Fenzi, G., Lapiha, O., Nguyen, N.K.: SLAP: succinct lattice-based polynomial commitments from standard assumptions. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14657, pp. 90\u2013119. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58754-2_4"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-42033-7_6","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"S Agrawal","year":"2013","unstructured":"Agrawal, S., Gentry, C., Halevi, S., Sahai, A.: Discrete gaussian leftover hash lemma over infinite domains. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8269, pp. 97\u2013116. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42033-7_6"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: STOC (1996)","DOI":"10.1145\/237814.237838"},{"key":"6_CR6","unstructured":"Albrecht, M.R.: SIS with hints zoo (2024"},{"key":"6_CR7","unstructured":"Aggarwal, D., Regev, O.: A note on discrete gaussian combinations of lattice vectors. Chic. J. Theor. Comput. Sci. (2016)"},{"key":"6_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-031-68382-4_9","volume-title":"CRYPTO 2024","author":"N Attrapadung","year":"2024","unstructured":"Attrapadung, N., Tomida, J.: A modular approach to registered ABE for unbounded predicates. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14922, pp. 280\u2013316. Springer, Cham (2024)"},{"key":"6_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-031-48621-0_13","volume-title":"TCC 2023","author":"D Balb\u00e1s","year":"2023","unstructured":"Balb\u00e1s, D., Catalano, D., Fiore, D., Lai, R.W.F.: Chainable functional commitments for unbounded-depth circuits. In: Rothblum, G., Wee, H. (eds.) TCC 2023. LNCS, vol. 14371, pp. 363\u2013393. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48621-0_13"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-55220-5_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"D Boneh","year":"2014","unstructured":"Boneh, D., et al.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 533\u2013556. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_30"},{"key":"6_CR11","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":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11535218_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"D Boneh","year":"2005","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Shoup, V. (ed.) Collusion resistant broadcast encryption with short ciphertexts and private keys. LNCS, vol. 3621, pp. 258\u2013275. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_16"},{"key":"6_CR13","unstructured":"Branco, P., Lai, R.W.F., Maitra, M., Malavolta, G., Rahimi, A., Woo, I.K.Y.: Traitor tracing without trusted authority from registered functional encryption. IACR Cryptol. ePrint Arch. (2024)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-40041-4_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Lewi, K., Montgomery, H., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 410\u2013428. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_23"},{"key":"6_CR15","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Lattice-inspired broadcast encryption and succinct ciphertext-policy ABE. In: ITCS (2022)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-662-44371-2_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"D Boneh","year":"2014","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 480\u2013499. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_27"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Cong, K., Eldefrawy, K., Smart, N.P.: Optimizing registration based encryption. In: Cryptography and Coding (2021)","DOI":"10.1007\/978-3-030-92641-0_7"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"D Cash","year":"2010","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523\u2013552. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_27"},{"key":"6_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-031-38545-2_3","volume-title":"CRYPTO 2023","author":"V Cini","year":"2023","unstructured":"Cini, V., Lai, R.W.F., Malavolta, G.: Lattice-based succinct arguments from vanishing polynomials - (extended abstract). In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14082, pp. 72\u2013105. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_3"},{"key":"6_CR20","unstructured":"Champion, J., Wu, D.J.: Distributed broadcast encryption from lattices. IACR Cryptol. ePrint Arch. (2024). https:\/\/eprint.iacr.org\/2024\/1417.pdf"},{"key":"6_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-031-30620-4_14","volume-title":"EUROCRYPT 2023","author":"N D\u00f6ttling","year":"2023","unstructured":"D\u00f6ttling, N., Kolonelos, D., Lai, R.W.F., Lin, C., Malavolta, G., Rahimi, A.: Efficient laconic cryptography from learning with errors. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14006, pp. 417\u2013446. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_14"},{"key":"6_CR22","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":"6_CR23","unstructured":"Datta, P., Pal, T., Yamada, S.: Registered FE beyond predicates: (attribute-based) linear functions and more. Cryptology ePrint Archive (2023)"},{"key":"6_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-981-99-8733-7_4","volume-title":"ASIACRYPT 2023","author":"D Francati","year":"2023","unstructured":"Francati, D., Friolo, D., Maitra, M., Malavolta, G., Rahimi, A., Venturi, D.: Registered (inner-product) functional encryption. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14442, pp. 98\u2013133. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_4"},{"key":"6_CR25","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-981-99-8733-7_6","volume-title":"ASIACRYPT 2023","author":"D Fiore","year":"2023","unstructured":"Fiore, D., Kolonelos, D., de Perthuis, P.: Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces. In: ASIACRYPT 2023. LNCS, vol. 14442, pp. 166\u2013200. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_6"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Fenzi, G., Moghaddas, H., Nguyen, N.K.: Lattice-based polynomial commitments: towards asymptotic and concrete efficiency. IACR Cryptol. ePrint Arch. (2023)","DOI":"10.1007\/s00145-024-09511-8"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-48329-2_40","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"A Fiat","year":"1994","unstructured":"Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480\u2013491. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_40"},{"key":"6_CR28","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-031-38551-3_16","volume-title":"CRYPTO 2023","author":"C Freitag","year":"2023","unstructured":"Freitag, C., Waters, B., David, J.W.: How to use (plain) witness encryption: registered ABE, flexible broadcast, and more. In: CRYPTO 2023. LNCS, vol. 14084, pp. 498\u2013531. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_16"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: FOCS (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-17259-6_3","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"S Garg","year":"2019","unstructured":"Garg, S., Hajiabadi, M., Mahmoody, M., Rahimi, A., Sekar, S.: Registration-based encryption from standard assumptions. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 63\u201393. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_3"},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/978-3-030-03807-6_25","volume-title":"Theory of Cryptography","author":"S Garg","year":"2018","unstructured":"Garg, S., Hajiabadi, M., Mahmoody, M., Rahimi, A.: Registration-based encryption: removing private-key generator from IBE. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 689\u2013718. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_25"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Glaeser, N., Kolonelos, D., Malavolta, G., Rahimi, A.: Efficient registration-based encryption. In: ACM CCS (2023)","DOI":"10.1145\/3576915.3616596"},{"key":"6_CR33","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-031-68394-7_12","volume-title":"CRYPTO 2024","author":"S Garg","year":"2021","unstructured":"Garg, S., Kolonelos, D., Policharla, G.-V., Wang, M.: Threshold encryption with silent setup. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14926, pp. 352\u2013386. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_12"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-98113-0_7","volume-title":"Security and Cryptography for Networks","author":"R Gay","year":"2018","unstructured":"Gay, R., Kowalczyk, L., Wee, H.: Tight adaptively secure broadcast encryption with short ciphertexts and keys. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 123\u2013139. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_7"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Garg, R., Lu, G., Waters, B., Wu, D.J.: Realizing flexible broadcast encryption: how to broadcast to a public-key directory. In: ACM CCS (2023)","DOI":"10.1145\/3576915.3623168"},{"key":"6_CR36","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-031-68382-4_5","volume-title":"CRYPTO 2024","author":"R Garg","year":"2024","unstructured":"Garg, R., Lu, G., Waters, B., Wu, D.J.: Reducing the CRS size in registered ABE systems. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14922, pp. 143\u2013177. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_5"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"6_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-030-56784-2_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"R Goyal","year":"2020","unstructured":"Goyal, R., Vusirikala, S.: Verifiable registration-based encryption. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 621\u2013651. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_21"},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Attribute-based encryption for circuits. In: STOC (2013)","DOI":"10.1145\/2488608.2488677"},{"key":"6_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-01001-9_10","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"C Gentry","year":"2009","unstructured":"Gentry, C., Waters, B.: Adaptive security in broadcast encryption systems (with short ciphertexts). In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 171\u2013188. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_10"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Hsieh, Y.-C., Lin, H., Luo, J.: Attribute-based encryption for circuits of unbounded depth from lattices. In: FOCS (2023)","DOI":"10.1109\/FOCS57990.2023.00031"},{"key":"6_CR42","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-031-30620-4_17","volume-title":"EUROCRYPT 2023","author":"S Hohenberger","year":"2023","unstructured":"Hohenberger, S., Lu, G., Waters, B., Wu, D.J.: Registered attribute-based encryption. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14006, pp. 511\u2013542. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_17"},{"key":"6_CR43","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-981-99-8733-7_13","volume-title":"ASIACRYPT 2023","author":"D Kolonelos","year":"2023","unstructured":"Kolonelos, D., Malavolta, G., Wee, H.: Distributed broadcast encryption from bilinear groups. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14442, pp. 407\u2013441. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_13"},{"key":"6_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"6_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-32928-9_10","volume-title":"Security and Cryptography for Networks","author":"DH Phan","year":"2012","unstructured":"Phan, D.H., Pointcheval, D., Strefler, M.: Decentralized dynamic broadcast encryption. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 166\u2013183. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32928-9_10"},{"key":"6_CR46","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"6_CR47","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-031-15802-5_19","volume-title":"CRYPTO 2022","author":"R Tsabary","year":"2022","unstructured":"Tsabary, R.: Candidate witness encryption from lattice techniques. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13507, pp. 535\u2013559. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_19"},{"key":"6_CR48","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-031-22963-3_7","volume-title":"ASIACRYPT 2022","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. LNCS, vol. 13791, pp. 195\u2013221. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_7"},{"key":"6_CR49","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-031-07085-3_8","volume-title":"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. LNCS, vol. 13276, pp. 217\u2013241. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_8"},{"key":"6_CR50","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-031-68382-4_6","volume-title":"CRYPTO 2024","author":"H Wee","year":"2024","unstructured":"Wee, H.: Circuit ABE with $$ poly (\\text{ depth },\\lambda )$$-sized ciphertexts and keys from lattices. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14922, pp. 178\u2013209. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_6"},{"key":"6_CR51","doi-asserted-by":"crossref","unstructured":"Wu, Q., Qin, B., Zhang, L., Domingo-Ferrer, J.: Ad hoc broadcast encryption. In: ACM CCS (2010)","DOI":"10.1145\/1866307.1866416"},{"key":"6_CR52","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-981-99-8733-7_7","volume-title":"ASIACRYPT 2023","author":"H Wee","year":"2023","unstructured":"Wee, H., Wu, D.J.: Lattice-based functional commitments: fast verification and cryptanalysis. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14442, pp. 201\u2013235. Springer, Singapore (2023)"},{"key":"6_CR53","doi-asserted-by":"publisher","unstructured":"Wee, H., Wu, D.J.: Succinct vector, polynomial, and functional commitments from lattices. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14006, pp. 385\u2013416. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_13","DOI":"10.1007\/978-3-031-30620-4_13"},{"key":"6_CR54","doi-asserted-by":"publisher","unstructured":"Waters, B., Wee, H., Wu, D.J.: Multi-authority ABE from lattices without random oracles. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022. LNCS, vol. 13747, pp. 651\u2013679. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_23","DOI":"10.1007\/978-3-031-22318-1_23"},{"key":"6_CR55","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-981-99-8733-7_3","volume-title":"ASIACRYPT 2023","author":"Z Zhu","year":"2023","unstructured":"Zhu, Z., Zhang, K., Gong, J., Qian, H.: Registered ABE via predicate encodings. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14442, pp. 66\u201397. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_3"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T10:02:40Z","timestamp":1732960960000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78020-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,30]]},"ISBN":["9783031780196","9783031780202"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78020-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}}]}}