{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:14:51Z","timestamp":1778087691789,"version":"3.51.4"},"publisher-location":"Cham","reference-count":65,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253293","type":"print"},{"value":"9783032253309","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-25330-9_17","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:42:52Z","timestamp":1778085772000},"page":"486-516","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Threshold Traitor Tracing"],"prefix":"10.1007","author":[{"given":"Sourav","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pratish","family":"Datta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditi","family":"Partap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swagata","family":"Sasmal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Zhandry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,7]]},"reference":[{"key":"17_CR1","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":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48523-6_1","volume-title":"Automata, Languages and Programming","author":"M Ajtai","year":"1999","unstructured":"Ajtai, M.: Generating hard instances of the short basis problem. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 1\u20139. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48523-6_1"},{"key":"17_CR3","unstructured":"Akinyele, J.A., Lehmann, C.U., Green, M.D., Pagano, M.W., Peterson, Z.N.J., Rubin, A.D.: Self-protecting electronic medical records using attribute-based encryption. Cryptology ePrint Archive, Report 2010\/565 (2010). https:\/\/eprint.iacr.org\/2010\/565"},{"key":"17_CR4","unstructured":"Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. Cryptology ePrint Archive, Report 2008\/521 (2008). https:\/\/eprint.iacr.org\/2008\/521"},{"key":"17_CR5","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Nir, O., Pinkas, B.: How to recover a secret with $$o(n)$$ additions. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0I. LNCS, vol. 14081, pp. 236\u2013262. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_8","DOI":"10.1007\/978-3-031-38557-5_8"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Asano, K., Attrapadung, N., Hara, K., Hashimoto, K., Watanabe, Y.: Key revocation in registered attribute-based encryption. In: Jager, T., Pan, J. (eds.) PKC\u00a02025, Part\u00a0III. LNCS, vol. 15676, pp. 102\u2013133. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91826-1_4","DOI":"10.1007\/978-3-031-91826-1_4"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Ball, M., \u00c7akan, A., Malkin, T.: Linear threshold secret-sharing with binary reconstruction. In: Tessaro, S. (ed.) ITC 2021. LIPIcs, vol.\u00a0199, pp. 12:1\u201312:22. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Seattle, WA, USA (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2021.12","DOI":"10.4230\/LIPIcs.ITC.2021.12"},{"key":"17_CR8","unstructured":"Bebel, J., Ojha, D.: Ferveo: threshold decryption for mempool privacy in BFT networks. Cryptology ePrint Archive, Report 2022\/898 (2022). https:\/\/eprint.iacr.org\/2022\/898"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Bhattacharyya, R., Bormet, J., Faust, S., Mukherjee, P., Othman, H.: CCA-secure traceable threshold (ID-based) encryption and application. Cryptology ePrint Archive, Paper 2025\/341 (2025). https:\/\/eprint.iacr.org\/2025\/341","DOI":"10.1145\/3719027.3744876"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Bhattacharyya, R., Bormet, J., Faust, S., Mukherjee, P., Othman, H.: CCA-secure traceable threshold (ID-based) encryption and application. Cryptology ePrint Archive, Report 2025\/341 (2025). https:\/\/eprint.iacr.org\/2025\/341","DOI":"10.1145\/3719027.3744876"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-319-96884-1_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 565\u2013596. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19"},{"key":"17_CR12","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":"17_CR13","doi-asserted-by":"publisher","unstructured":"Boneh, D., Partap, A., Rotem, L.: Accountability for misbehavior in threshold decryption via threshold traitor tracing. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0VII. LNCS, vol. 14926, pp. 317\u2013351. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_11","DOI":"10.1007\/978-3-031-68394-7_11"},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Boneh, D., Partap, A., Rotem, L.: Traceable secret sharing: strong security and efficient constructions. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0V. LNCS, vol. 14924, pp. 221\u2013256. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68388-6_9","DOI":"10.1007\/978-3-031-68388-6_9"},{"key":"17_CR15","unstructured":"Boneh, D., Partap, A., Rotem, L.: Traceable verifiable random functions. Cryptology ePrint Archive, Report 2025\/312 (2025). https:\/\/eprint.iacr.org\/2025\/312"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/11761679_34","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"D Boneh","year":"2006","unstructured":"Boneh, D., Sahai, A., Waters, B.: Fully collusion resistant traitor tracing with short ciphertexts and private keys. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 573\u2013592. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_34"},{"key":"17_CR17","unstructured":"Bormet, J., et al.: BEAST-MEV: batched threshold encryption with silent setup for MEV prevention. Cryptology ePrint Archive, Paper 2025\/1419 (2025). https:\/\/eprint.iacr.org\/2025\/1419"},{"key":"17_CR18","unstructured":"Bormet, J., Hofmann, J., Othman, H.: Traceable threshold encryption without trusted dealer. Cryptology ePrint Archive, Report 2025\/342 (2025). https:\/\/eprint.iacr.org\/2025\/342"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Boudgoust, K., Scholl, P.: Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0I. LNCS, vol. 14438, pp. 371\u2013404. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8721-4_12","DOI":"10.1007\/978-981-99-8721-4_12"},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Medina, S.: Limits on adaptive security for attribute-based encryption. In: Boyle, E., Mahmoody, M. (eds.) TCC\u00a02024, Part\u00a0III. LNCS, vol. 15366, pp. 91\u2013123. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78020-2_4","DOI":"10.1007\/978-3-031-78020-2_4"},{"key":"17_CR21","doi-asserted-by":"publisher","unstructured":"Canard, S., Papon, N., Phan, D.H.: Public traceability in threshold decryption. Cryptology ePrint Archive, Paper 2025\/1347 (2025). https:\/\/doi.org\/10.62056\/akjb0lmol. https:\/\/eprint.iacr.org\/2025\/1347","DOI":"10.62056\/akjb0lmol"},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"Castagnos, G., Laguillaumie, F., Tucker, I.: Threshold linearly homomorphic encryption on $$\\textbf{Z}\/2^{k}\\textbf{Z}$$. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13792, pp. 99\u2013129. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_4","DOI":"10.1007\/978-3-031-22966-4_4"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Chairattana-Apirom, R., Tessaro, S., Zhu, C.: Partially non-interactive two-round lattice-based threshold signatures. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT\u00a02024, Part\u00a0IV. LNCS, vol. 15487, pp. 268\u2013302. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_9","DOI":"10.1007\/978-981-96-0894-2_9"},{"key":"17_CR24","doi-asserted-by":"publisher","unstructured":"Chakrabarti, A., Maitra, M., Mondal, A., Sehgal, K.: Silent threshold traitor tracing & enhancing mempool privacy. In: Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, CCS 2025, pp. 1769\u20131783. Association for Computing Machinery, New York, NY, USA (2025). https:\/\/doi.org\/10.1145\/3719027.3765099","DOI":"10.1145\/3719027.3765099"},{"key":"17_CR25","doi-asserted-by":"publisher","unstructured":"Chase, M., Chow, S.S.M.: Improving privacy and security in multi-authority attribute-based encryption. In: Al-Shaer, E., Jha, S., Keromytis, A.D. (eds.) ACM CCS 2009, pp. 121\u2013130. ACM Press, Chicago, Illinois, USA (2009). https:\/\/doi.org\/10.1145\/1653662.1653678","DOI":"10.1145\/1653662.1653678"},{"key":"17_CR26","unstructured":"Cheon, J.H., Cho, W., Kim, J.: Improved universal thresholdizer from iterative shamir secret sharing. Cryptology ePrint Archive, Report 2023\/545 (2023). https:\/\/eprint.iacr.org\/2023\/545"},{"key":"17_CR27","unstructured":"Choudhuri, A.R., Garg, S., Piet, J., Policharla, G.V.: Mempool privacy via batched threshold encryption: attacks and defenses. In: Balzarotti, D., Xu, W. (eds.) USENIX Security 2024. USENIX Association, Philadelphia, PA, USA (2024). https:\/\/www.usenix.org\/conference\/usenixsecurity24\/presentation\/choudhuri"},{"key":"17_CR28","doi-asserted-by":"publisher","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT\u201997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_9","DOI":"10.1007\/3-540-69053-0_9"},{"key":"17_CR29","unstructured":"Dahl, M., et al.: Noah\u2019s ark: efficient threshold-FHE using noise flooding. Cryptology ePrint Archive, Report 2023\/815 (2023). https:\/\/eprint.iacr.org\/2023\/815"},{"key":"17_CR30","unstructured":"Das, S., Datta, P., Partap, A., Sasmal, S., Zhandry, M.: Optimal threshold traitor tracing. Cryptology ePrint Archive, Paper 2025\/2154 (2025). https:\/\/eprint.iacr.org\/2025\/2154"},{"key":"17_CR31","unstructured":"Das, S., Ren, L., Yang, Z.: Adaptively secure threshold ElGamal decryption from DDH. Cryptology ePrint Archive, Paper 2025\/1477 (2025). https:\/\/eprint.iacr.org\/2025\/1477"},{"key":"17_CR32","doi-asserted-by":"publisher","unstructured":"Datta, P., Komargodski, I., Waters, B.: Decentralized multi-authority ABE for DNFs from LWE. In: Canteaut, A., Standaert, F.X. (eds.) EUROCRYPT\u00a02021, Part\u00a0I. LNCS, vol. 12696, pp. 177\u2013209. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_7","DOI":"10.1007\/978-3-030-77870-5_7"},{"key":"17_CR33","doi-asserted-by":"publisher","unstructured":"De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: 26th ACM STOC, pp. 522\u2013533. ACM Press, Montr\u00e9al, Qu\u00e9bec, Canada (1994). https:\/\/doi.org\/10.1145\/195058.195405","DOI":"10.1145\/195058.195405"},{"key":"17_CR34","doi-asserted-by":"publisher","unstructured":"Desmedt, Y.: Society and group oriented cryptography: a new concept. In: Pomerance, C. (ed.) CRYPTO\u201987. LNCS, vol.\u00a0293, pp. 120\u2013127. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_8","DOI":"10.1007\/3-540-48184-2_8"},{"key":"17_CR35","doi-asserted-by":"publisher","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO\u201989. LNCS, vol.\u00a0435, pp. 307\u2013315. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_28","DOI":"10.1007\/0-387-34805-0_28"},{"key":"17_CR36","doi-asserted-by":"publisher","unstructured":"Devevey, J., Libert, B., Nguyen, K., Peters, T., Yung, M.: Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings. In: Garay, J. (ed.) PKC\u00a02021, Part\u00a0I. LNCS, vol. 12710, pp. 659\u2013690. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_24","DOI":"10.1007\/978-3-030-75245-3_24"},{"key":"17_CR37","doi-asserted-by":"publisher","unstructured":"Do, X.T., Phan, D.H., Pointcheval, D.: Traceable inner product functional encryption. In: Jarecki, S. (ed.) CT-RSA\u00a02020. LNCS, vol. 12006, pp. 564\u2013585. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_24","DOI":"10.1007\/978-3-030-40186-3_24"},{"key":"17_CR38","doi-asserted-by":"publisher","unstructured":"Frankel, Y.: A practical protocol for large group oriented networks. In: Quisquater, J.J., Vandewalle, J. (eds.) EUROCRYPT\u201989. LNCS, vol.\u00a0434, pp. 56\u201361. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_8","DOI":"10.1007\/3-540-46885-4_8"},{"key":"17_CR39","doi-asserted-by":"publisher","unstructured":"Gagn\u00e9, M., Narayan, S., Safavi-Naini, R.: Threshold attribute-based signcryption. In: Garay, J.A., De Prisco, R. (eds.) SCN 10. LNCS, vol.\u00a06280, pp. 154\u2013171. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_11","DOI":"10.1007\/978-3-642-15317-4_11"},{"key":"17_CR40","doi-asserted-by":"publisher","unstructured":"Garg, S., Kolonelos, D., Policharla, G.V., Wang, M.: Threshold encryption with silent setup. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0VII. LNCS, vol. 14926, pp. 352\u2013386. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_12","DOI":"10.1007\/978-3-031-68394-7_12"},{"key":"17_CR41","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 197\u2013206. ACM Press, Victoria, BC, Canada (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"17_CR42","doi-asserted-by":"publisher","unstructured":"Gong, J., Luo, J., Wee, H.: Traitor tracing with $${N}^{1\/3}$$-size ciphertexts and $${O}(1)$$-size keys from $$k$$-Lin. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0III. LNCS, vol. 14006, pp. 637\u2013668. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_21","DOI":"10.1007\/978-3-031-30620-4_21"},{"key":"17_CR43","doi-asserted-by":"publisher","unstructured":"Goyal, R., Koppula, V., Waters, B.: Collusion resistant traitor tracing from learning with errors. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th ACM STOC, pp. 660\u2013670. ACM Press, Los Angeles, CA, USA (2018). https:\/\/doi.org\/10.1145\/3188745.3188844","DOI":"10.1145\/3188745.3188844"},{"key":"17_CR44","doi-asserted-by":"publisher","unstructured":"Goyal, V., Song, Y., Srinivasan, A.: Traceable secret sharing and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0III. LNCS, vol. 12827, pp. 718\u2013747. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_24","DOI":"10.1007\/978-3-030-84252-9_24"},{"key":"17_CR45","doi-asserted-by":"publisher","unstructured":"G\u00fcr, K.D., Katz, J., Silde, T.: Two-round threshold lattice-based signatures from threshold homomorphic encryption. In: Saarinen, M.J., Smith-Tone, D. (eds.) Post-Quantum Cryptography, PQCrypto 2024, Part\u00a0II, pp. 266\u2013300. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62746-0_12","DOI":"10.1007\/978-3-031-62746-0_12"},{"key":"17_CR46","unstructured":"Hall-Andersen, M., Simkin, M., Wagner, B.: Silent threshold encryption with one-shot adaptive security. Cryptology ePrint Archive, Paper 2025\/1384 (2025). https:\/\/eprint.iacr.org\/2025\/1384"},{"key":"17_CR47","doi-asserted-by":"publisher","unstructured":"Herranz, J., Laguillaumie, F., R\u00e0fols, C.: Constant size ciphertexts in threshold attribute-based encryption. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC\u00a02010. LNCS, vol.\u00a06056, pp. 19\u201334. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_2","DOI":"10.1007\/978-3-642-13013-7_2"},{"key":"17_CR48","doi-asserted-by":"publisher","unstructured":"Hohenberger, S., Lu, G., Waters, B., Wu, D.J.: Registered attribute-based encryption. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0III. LNCS, vol. 14006, pp. 511\u2013542. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_17","DOI":"10.1007\/978-3-031-30620-4_17"},{"key":"17_CR49","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Wee, H.: Partial garbling schemes and their applications. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part\u00a0I. LNCS, vol.\u00a08572, pp. 650\u2013662. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_54","DOI":"10.1007\/978-3-662-43948-7_54"},{"key":"17_CR50","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proceedings of Structures in Complexity Theory, pp. 102\u2013111 (1993)","DOI":"10.1109\/SCT.1993.336536"},{"key":"17_CR51","doi-asserted-by":"publisher","unstructured":"Lu, G., Waters, B., Wu, D.J.: Multi-authority registered attribute-based encryption. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT\u00a02025, Part\u00a0III. LNCS, vol. 15603, pp. 3\u201333. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91131-6_1","DOI":"10.1007\/978-3-031-91131-6_1"},{"key":"17_CR52","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT\u00a02012. LNCS, vol.\u00a07237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"17_CR53","doi-asserted-by":"publisher","unstructured":"Mukherjee, P.: Adaptively secure threshold symmetric-key encryption. In: Bhargavan, K., Oswald, E., Prabhakaran, M. (eds.) INDOCRYPT\u00a02020. LNCS, vol. 12578, pp. 465\u2013487. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65277-7_21","DOI":"10.1007\/978-3-030-65277-7_21"},{"key":"17_CR54","doi-asserted-by":"publisher","unstructured":"M\u00fcller, S., Katzenbeisser, S., Eckert, C.: Distributed attribute-based encryption. In: Lee, P.J., Cheon, J.H. (eds.) ICISC 08. LNCS, vol.\u00a05461, pp. 20\u201336. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00730-9_2","DOI":"10.1007\/978-3-642-00730-9_2"},{"key":"17_CR55","unstructured":"Osmosis. https:\/\/docs.osmosis.zone\/"},{"key":"17_CR56","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 84\u201393. ACM Press, Baltimore, MA, USA (2005). https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"17_CR57","doi-asserted-by":"publisher","unstructured":"Sako, K.: An auction protocol which hides bids of losers. In: Imai, H., Zheng, Y. (eds.) PKC\u00a02000. LNCS, vol.\u00a01751, pp. 422\u2013432. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46588-1_28","DOI":"10.1007\/978-3-540-46588-1_28"},{"key":"17_CR58","unstructured":"Shutter: Preventing front running and malicious MEV on ethereum. https:\/\/shutter.network"},{"key":"17_CR59","unstructured":"Suegami, S., Ashizawa, S., Shibano, K.: Constant-cost batched partial decryption in threshold encryption. Cryptology ePrint Archive, Paper 2024\/762 (2024). https:\/\/eprint.iacr.org\/2024\/762"},{"key":"17_CR60","unstructured":"de\u00a0Valence, H.: The Penumbra protocol. https:\/\/protocol.penumbra.zone\/main\/crypto\/flow-encryption\/threshold-encryption.html"},{"key":"17_CR61","doi-asserted-by":"publisher","unstructured":"Venema, M.: A practical compiler for attribute-based encryption: new decentralized constructions and more. In: Rosulek, M. (ed.) CT-RSA\u00a02023. LNCS, vol. 13871, pp. 132\u2013159. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30872-7_6","DOI":"10.1007\/978-3-031-30872-7_6"},{"key":"17_CR62","doi-asserted-by":"publisher","unstructured":"Waters, B., Wichs, D.: Adaptively secure attribute-based encryption from witness encryption. In: Boyle, E., Mahmoody, M. (eds.) TCC\u00a02024, Part\u00a0III. LNCS, vol. 15366, pp. 65\u201390. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78020-2_3","DOI":"10.1007\/978-3-031-78020-2_3"},{"key":"17_CR63","unstructured":"Waters, B., Wu, D.J.: Silent threshold cryptography from pairings: expressive policies in the plain model. Cryptology ePrint Archive, Paper 2025\/1547 (2025). https:\/\/eprint.iacr.org\/2025\/1547"},{"key":"17_CR64","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: New techniques for traitor tracing: Size $$N^{1\/3}$$ and more from pairings. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO\u00a02020, Part\u00a0I. LNCS, vol. 12170, pp. 652\u2013682. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_22","DOI":"10.1007\/978-3-030-56784-2_22"},{"key":"17_CR65","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: Optimal traitor tracing from pairings. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT\u00a02025, Part\u00a0III. LNCS, vol. 15603, pp. 305\u2013335. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91131-6_11","DOI":"10.1007\/978-3-031-91131-6_11"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25330-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:43:01Z","timestamp":1778085781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25330-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253293","9783032253309"],"references-count":65,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25330-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 May 2026","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":"Rome","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}