{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:13:39Z","timestamp":1778019219113,"version":"3.51.4"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253231","type":"print"},{"value":"9783032253248","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-25324-8_2","type":"book-chapter","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:02:48Z","timestamp":1778018568000},"page":"33-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Traceable Secret Sharing Revisited"],"prefix":"10.1007","author":[{"given":"Vipul","family":"Goyal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditi","family":"Partap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,6]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Beimel, A., Ishai, Y., Kushilevitz, E., Liu, T., Vaikuntanathan, V.: Succinct computational secret sharing. In: Saha, B., Servedio, R.A. (eds.) 55th ACM STOC, Orlando, FL, USA, pp. 1553\u20131566. ACM Press (2023)","DOI":"10.1145\/3564246.3585127"},{"key":"2_CR2","unstructured":"Baghery, K., Ebrahimi, E., Mirzamohammadi, O., Sedaghat, M.: Traceable verifiable secret sharing and applications. Cryptology ePrint Archive, Report 2025\/318 (2025)"},{"key":"2_CR3","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_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th ACM STOC, Chicago, IL, USA, pp. 1\u201310. ACM Press (1988)","DOI":"10.1145\/62212.62213"},{"key":"2_CR5","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_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-57220-1_53","volume-title":"Advances in Cryptology \u2014 AUSCRYPT \u201992","author":"M Bertilsson","year":"1993","unstructured":"Bertilsson, M., Ingemarsson, I.: A construction of practical secret sharing schemes using linear block codes. In: Seberry, J., Zheng, Y. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 67\u201379. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57220-1_53"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Bishop, A., Green, M., Ishai, Y., Jain, A., Lou, P.: Fully anonymous secret sharing. In: Advances in Cryptology \u2013 CRYPTO 2025: 45th Annual International Cryptology Conference, Santa Barbara, CA, USA, 17\u201321 August 2025, Proceedings, Part IV, pp. 356\u2013389. Springer, Heidelberg (2025)","DOI":"10.1007\/978-3-032-01884-7_12"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of AFIPS 1979 National Computer Conference, vol. 48, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/3-540-48405-1_22","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"D Boneh","year":"1999","unstructured":"Boneh, D., Franklin, M.: An efficient public key traitor tracing scheme. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 338\u2013353. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_22"},{"key":"2_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-031-68394-7_11","volume-title":"CRYPTO 2024, Part VII","author":"D Boneh","year":"2024","unstructured":"Boneh, D., Partap, A., Rotem, L.: Accountability for misbehavior in threshold decryption via threshold traitor tracing. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part VII. LNCS, vol. 14926, pp. 317\u2013351. Springer, Cham (2024a)"},{"key":"2_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-031-68388-6_9","volume-title":"CRYPTO 2024, Part V","author":"D Boneh","year":"2024","unstructured":"Boneh, D., Partap, A., Rotem, L.: Traceable secret sharing: strong security and efficient constructions. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part V. LNCS, vol. 14924, pp. 221\u2013256. Springer, Cham (2024b)"},{"key":"2_CR12","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":"2_CR13","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":"2_CR14","doi-asserted-by":"crossref","unstructured":"Bormet, J., Dziembowski, S., Faust, S., Lizurej, T., Mielniczuk, M.: Strong secret sharing with snitching. Cryptology ePrint Archive, Paper 2025\/1119 (2025)","DOI":"10.1007\/978-3-032-01884-7_10"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/11426639_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"H Chabanne","year":"2005","unstructured":"Chabanne, H., Phan, D.H., Pointcheval, D.: Public traceability in traitor tracing schemes. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 542\u2013558. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_32"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: 20th ACM STOC, Chicago, IL, USA, pp. 11\u201319. ACM Press (1988)","DOI":"10.1145\/62212.62214"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-030-03810-6_13","volume-title":"Theory of Cryptography","author":"Y Chen","year":"2018","unstructured":"Chen, Y., Vaikuntanathan, V., Waters, B., Wee, H., Wichs, D.: Traitor-tracing from LWE made simple and attribute-based. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11240, pp. 341\u2013369. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_13"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-48184-2_8","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"Y Desmedt","year":"1988","unstructured":"Desmedt, Y.: Society and group oriented cryptography: a new concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 120\u2013127. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_8"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"Y Desmedt","year":"1990","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307\u2013315. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_28"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Devadas, L., Jain, A., Waters, B., Wu, D.J.: Succinct witness encryption for batch languages and applications. In: ASIACRYPT (2025)","DOI":"10.1007\/978-981-95-5125-5_5"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/978-3-030-40186-3_24","volume-title":"Topics in Cryptology \u2013 CT-RSA 2020","author":"XT Do","year":"2020","unstructured":"Do, X.T., Phan, D.H., Pointcheval, D.: Traceable inner product functional encryption. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 564\u2013585. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_24"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-36288-6_8","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"Y Dodis","year":"2003","unstructured":"Dodis, Y., Fazio, N.: Public key trace and revoke scheme secure against adaptive chosen ciphertext attack. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 100\u2013115. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_8"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Faust, S., Lizurej, T., Mielniczuk, M.: Secret sharing with snitching. In: Luo, B., Liao, X., Xu, J., Kirda, E., Lie, D. (eds.) ACM CCS 2024, Salt Lake City, UT, USA, pp. 840\u2013853. ACM Press (2024)","DOI":"10.1145\/3658644.3690296"},{"key":"2_CR24","unstructured":"Farr\u00e0s, O., Guiot, M.: Traceable secret sharing schemes for general access structures. Cryptology ePrint Archive, Paper 2025\/1120 (2025)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-48405-1_23","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"A Fiat","year":"1999","unstructured":"Fiat, A., Tassa, T.: Dynamic traitor tracing. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 354\u2013371. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_23"},{"key":"2_CR26","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: 54th FOCS, Berkeley, CA, USA, pp. 40\u201349. IEEE Computer Society Press (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Garg, S., Kumarasubramanian, A., Sahai, A., Waters, B.: Building efficient fully collusion-resilient traitor tracing and revocation schemes. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) ACM CCS 2010, Chicago, Illinois, USA, pp. 121\u2013130. ACM Press (2010)","DOI":"10.1145\/1866307.1866322"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: 21st ACM STOC, Seattle, WA, USA, pp. 25\u201332. ACM Press (1989)","DOI":"10.1145\/73007.73010"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Aho, A. (eds.) 19th ACM STOC, New York City, NY, USA, pp. 218\u2013229. ACM Press (1987)","DOI":"10.1145\/28395.28420"},{"key":"2_CR30","series-title":"LNCS","first-page":"637","volume-title":"EUROCRYPT 2023, Part III","author":"J Gong","year":"2023","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 2023, Part III. LNCS, vol. 14006, pp. 637\u2013668. Springer, Cham (2023)"},{"key":"2_CR31","doi-asserted-by":"crossref","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, Los Angeles, CA, USA, pp. 660\u2013670. ACM Press (2018)","DOI":"10.1145\/3188745.3188844"},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-030-36033-7_6","volume-title":"Theory of Cryptography","author":"R Goyal","year":"2019","unstructured":"Goyal, R., Koppula, V., Waters, B.: New approaches to traitor tracing with embedded identities. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11892, pp. 149\u2013179. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_6"},{"key":"2_CR33","unstructured":"Goyal, R., Waters, B.: Personal communication (2025)"},{"key":"2_CR34","unstructured":"Goyal, V., Jain, A., Partap, A.: Traceable secret sharing revisited. Cryptology ePrint Archive, Paper 2025\/1980 (2025)"},{"key":"2_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1007\/978-3-030-84252-9_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"V Goyal","year":"2021","unstructured":"Goyal, V., Song, Y., Srinivasan, A.: Traceable secret sharing and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 718\u2013747. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_24"},{"key":"2_CR36","unstructured":"Hoffmann, C.: Traceable secret sharing based on the Chinese remainder theorem. Cryptology ePrint Archive, Report 2024\/811 (2024)"},{"key":"2_CR37","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: Proceedings of the IEEE Global Telecommunication Conference (Globecom 1987), pp. 99\u2013102 (1987)"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Jain, A., Jin, Z., Mathialagan, S., Paneth, O.: On succinct obfuscation via propositional proofs (or: how to use PV-IO). In: STOC 2025 (2025, to appear)","DOI":"10.1109\/FOCS63196.2025.00091"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Khuller, S., Williams, V.V. (eds.) 53rd ACM STOC, Virtual Event, Italy, pp. 60\u201373. ACM Press (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"2_CR40","series-title":"LNCS","first-page":"670","volume-title":"EUROCRYPT 2022, Part I","author":"A Jain","year":"2022","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from LPN over $$\\mathbb{F} _p$$, DLIN, and PRGs in $${NC}^0$$. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 670\u2013699. Springer, Cham (2022)"},{"key":"2_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-44647-8_4","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"A Kiayias","year":"2001","unstructured":"Kiayias, A., Yung, M.: Self protecting pirates and black-box traitor tracing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 63\u201379. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_4"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Koppula, V., Lewko, A.B., Waters, B.: Indistinguishability obfuscation for Turing machines with unbounded memory. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th ACM STOC, Portland, OR, USA, pp. 419\u2013428. ACM Press (2015)","DOI":"10.1145\/2746539.2746614"},{"key":"2_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BFb0054123","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"K Kurosawa","year":"1998","unstructured":"Kurosawa, K., Desmedt, Y.: Optimum traitor tracing and asymmetric schemes. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 145\u2013157. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054123"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"Leslie, M., Dutta, R.: A Traceable Threshold Asmuth\u2013Bloom Secret Sharing Scheme. Cryptology ePrint Archive, Paper 2025\/1561 (2025)","DOI":"10.1016\/j.jisa.2025.104350"},{"key":"2_CR45","doi-asserted-by":"crossref","unstructured":"Lu, G., Nassar, S., Waters, B.: Succinct computational secret sharing for monotone circuits (2025)","DOI":"10.1007\/978-981-95-5125-5_4"},{"key":"2_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-39466-4_27","volume-title":"Cryptography","author":"M Mignotte","year":"1983","unstructured":"Mignotte, M.: How to share a secret. In: Beth, T. (ed.) EUROCRYPT 1982. LNCS, vol. 149, pp. 371\u2013375. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/3-540-39466-4_27"},{"key":"2_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-44647-8_3","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Naor","year":"2001","unstructured":"Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 41\u201362. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_3"},{"key":"2_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/BFb0055750","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"M Naor","year":"1998","unstructured":"Naor, M., Pinkas, B.: Threshold traitor tracing. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 502\u2013517. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055750"},{"key":"2_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-662-49896-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"R Nishimaki","year":"2016","unstructured":"Nishimaki, R., Wichs, D., Zhandry, M.: Anonymous traitor tracing: how to embed arbitrary information in a key. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 388\u2013419. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_14"},{"key":"2_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-44598-6_20","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"R Safavi-Naini","year":"2000","unstructured":"Safavi-Naini, R., Wang, Y.: Sequential traitor tracing. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 316\u2013332. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_20"},{"issue":"11","key":"2_CR51","first-page":"612","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. Assoc. Comput. Mach. 22(11), 612\u2013613 (1979)","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"2_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-24582-7_12","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"V Vinod","year":"2003","unstructured":"Vinod, V., Narayanan, A., Srinathan, K., Rangan, C.P., Kim, K.: On the power of computational secret sharing. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 162\u2013176. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24582-7_12"},{"key":"2_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-030-64375-1_8","volume-title":"Theory of Cryptography","author":"H Wee","year":"2020","unstructured":"Wee, H.: Functional encryption for quadratic functions from k-lin, revisited. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 210\u2013228. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_8"},{"key":"2_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/978-3-030-56784-2_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"M Zhandry","year":"2020","unstructured":"Zhandry, M.: New techniques for traitor tracing: size $$N^{1\/3}$$ and more from pairings. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 652\u2013682. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_22"},{"key":"2_CR55","series-title":"LNCS","first-page":"305","volume-title":"EUROCRYPT 2025, Part III","author":"M Zhandry","year":"2025","unstructured":"Zhandry, M.: Optimal traitor tracing from pairings. In: Fehr, S., Fouque, P.-A. (eds.) EUROCRYPT 2025, Part III. LNCS, vol. 15603, pp. 305\u2013335. Springer, Cham (2025)"}],"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-25324-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:03:01Z","timestamp":1778018581000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25324-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253231","9783032253248"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25324-8_2","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":"6 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"}}]}}