{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T07:37:58Z","timestamp":1769585878874,"version":"3.49.0"},"publisher-location":"Cham","reference-count":70,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683879","type":"print"},{"value":"9783031683886","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68388-6_9","type":"book-chapter","created":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T08:02:51Z","timestamp":1723795371000},"page":"221-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Traceable Secret Sharing: Strong Security and\u00a0Efficient Constructions"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[]},{"given":"Aditi","family":"Partap","sequence":"additional","affiliation":[]},{"given":"Lior","family":"Rotem","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,17]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Goldreich, O., H\u00e5stad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. In: 31st FOCS, pp. 544\u2013553. IEEE Computer Society Press. St. Louis, MO, USA (1990)","DOI":"10.1109\/FSCS.1990.89575"},{"key":"9_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-031-38557-5_8","volume-title":"CRYPTO 2023 Part I","author":"B Applebaum","year":"2023","unstructured":"Applebaum, B., Nir, O., Pinkas, B.: How to recover a secret with $$o(n)$$ additions. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023 Part I. LNCS, vol. 14081, pp. 236\u2013262. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_8"},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"29","author":"C Asmuth","year":"1983","unstructured":"Asmuth, C., Bloom, J.: A modular approach to key safeguarding. IEEE Trans. Inf. Theory 29(2), 208\u2013210 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"111","key":"9_CR4","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"24","author":"ER Berlekamp","year":"1970","unstructured":"Berlekamp, E.R.: Factoring polynomials over large finite fields. Math. Comput. 24(111), 713\u2013735 (1970)","journal-title":"Math. Comput."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: 1979 International Workshop on Managing Requirements Knowledge (MARK), pp. 313\u2013318 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"9_CR6","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":"9_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D., Kiayias, A., Montgomery, H.W.: Robust fingerprinting codes: a near optimal construction. In: Proceedings of the Tenth Annual ACM Workshop on Digital Rights Management, DRM 2010, pp. 3\u201312. Association for Computing Machinery, New York (2010)","DOI":"10.1145\/1866870.1866873"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Boneh, D., Naor, M.: Traitor tracing with constant size ciphertext. In: Ning, P., Syverson, P.F., Jha, S., (eds.) ACM CCS 2008, pp. 501\u2013510. ACM Press, Alexandria, Virginia (2008)","DOI":"10.1145\/1455770.1455834"},{"key":"9_CR10","unstructured":"Boneh, D., Partap, A., Rotem, L.: Accountability for misbehavior in threshold decryption via threshold traitor tracing. Cryptology ePrint Archive, Paper 2023\/1724 (2023). https:\/\/eprint.iacr.org\/2023\/1724. To be published in CRYPTO 2024"},{"key":"9_CR11","unstructured":"Boneh, D., Partap, A., Rotem, L.: Traceable secret sharing: Strong security and efficient constructions. Cryptology ePrint Archive, Paper 2024\/405 (2024). https:\/\/eprint.iacr.org\/2024\/405"},{"key":"9_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":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/3-540-44750-4_36","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","author":"D Boneh","year":"1995","unstructured":"Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 452\u2013465. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_36"},{"key":"9_CR14","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 Part I. LNCS, vol. 8616, pp. 480\u2013499. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_27"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-662-49896-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Bootle","year":"2016","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016 Part II. LNCS, vol. 9666, pp. 327\u2013357. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_12"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/3-540-46885-4_45","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201989","author":"EF Brickell","year":"1990","unstructured":"Brickell, E.F.: Some ideal secret sharing schemes. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 468\u2013475. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_45"},{"key":"9_CR17","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":"9_CR18","unstructured":"Chainlink vrf: On-chain verifiable randomness. link"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-72540-4_17","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"H Chen","year":"2007","unstructured":"Chen, H., Cramer, R., Goldwasser, S., de Haan, R., Vaikuntanathan, V.: Secure computation from random error correcting codes. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 291\u2013310. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_17"},{"key":"9_CR20","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":"9_CR21","doi-asserted-by":"crossref","unstructured":"Choi, K., Manoj, A., Bonneau, J.: SoK: distributed randomness beacons. In: 2023 IEEE Symposium on Security and Privacy, pp. 75\u201392 IEEE Computer Society Press, San Francisco (2023)","DOI":"10.1109\/SP46215.2023.10179419"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"B Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 257\u2013270. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_25"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-662-46803-6_11","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"R Cramer","year":"2015","unstructured":"Cramer, R., Damg\u00e5rd, I.B., D\u00f6ttling, N., Fehr, S., Spini, G.: Linear secret sharing schemes from error correcting codes and universal hash functions. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015 Part II. LNCS, vol. 9057, pp. 313\u2013336. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_11"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-030-45721-1_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"R Cramer","year":"2020","unstructured":"Cramer, R., Xing, C.: Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020 Part I. LNCS, vol. 12105, pp. 499\u2013528. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_18"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Das, P., Faust, S., Loss, J.: A formal treatment of deterministic wallets. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J., (eds) ACM CCS 2019, pp. 651\u2013668 ACM Press London (2019)","DOI":"10.1145\/3319535.3354236"},{"key":"9_CR26","unstructured":"Das, S., Pinkas, B., Tomescu, A., Xiang, Z.: Distributed randomness using weighted vrfs. Cryptology ePrint Archive, Paper 2024\/198 (2024). https:\/\/eprint.iacr.org\/2024\/198"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36288-6_1","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"Y Dodis","year":"2003","unstructured":"Dodis, Y.: Efficient construction of (distributed) verifiable random functions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 1\u201317. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_1"},{"key":"9_CR28","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":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-30580-4_28","volume-title":"Public Key Cryptography - PKC 2005","author":"Y Dodis","year":"2005","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 416\u2013431. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30580-4_28"},{"key":"9_CR30","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":"9_CR31","doi-asserted-by":"crossref","unstructured":"Galindo, D., Liu, J., Ordean, M., Wong, J.M.: Fully distributed verifiable random functions and their application to decentralised random beacons. In: 2021 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 88\u2013102 (2021)","DOI":"10.1109\/EuroSP51992.2021.00017"},{"key":"9_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-031-38557-5_10","volume-title":"CRYPTO 2023, Part I","author":"S Garg","year":"2023","unstructured":"Garg, S., Jain, A., Mukherjee, P., Sinha, R., Wang, M., Zhang, Y.: Cryptography with weights: MPC, encryption and signatures. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part I. LNCS, vol. 14081, pp. 295\u2013327. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_10"},{"key":"9_CR33","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, pp. 121\u2013130. ACM Press, Chicago (2010)","DOI":"10.1145\/1866307.1866322"},{"key":"9_CR34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography. Cambridge University Press, Cambridge (2001)"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: 21st ACM STOC, pp. 25\u201332. ACM Press, Seattle (1989 )","DOI":"10.1145\/73007.73010"},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Ron, D., Sudan, M.: Chinese remaindering with errors. In: 31st ACM STOC, pp. 225\u2013234. ACM Press, Atlanta (1999)","DOI":"10.1145\/301250.301309"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Rubinfeld, R., Sudan, M.: Learning polynomials with queries: the highly noisy case. In: 36th FOCS, pp. 294\u2013303. IEEE Computer Society Press, Milwaukee (1995)","DOI":"10.1109\/SFCS.1995.492485"},{"key":"9_CR38","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-031-30620-4_21","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). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_21"},{"key":"9_CR39","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, pp. 660\u2013670. ACM Press, Los Angeles (2018)","DOI":"10.1145\/3188745.3188844"},{"key":"9_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-540-74143-5_24","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"V Goyal","year":"2007","unstructured":"Goyal, V.: Reducing trust in the PKG in identity based cryptosystems. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 430\u2013447. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_24"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Goyal, V., Lu, S., Sahai, A., Waters, B.: Black-box accountable authority identity-based encryption. In: Ning, P., Syverson, P.F., Jha, S., (eds.) ACM CCS 2008, pp. 427\u2013436. ACM Press, Alexandria (2008)","DOI":"10.1145\/1455770.1455824"},{"key":"9_CR42","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 Part III. LNCS, vol. 12827, pp. 718\u2013747. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_24"},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometric codes. In: 39th FOCS, pp. 28\u201339. IEEE Computer Society Press, Palo Alto (1998)","DOI":"10.1109\/SFCS.1998.743426"},{"key":"9_CR44","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":"9_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/3-540-47870-1_3","volume-title":"Security and Privacy in Digital Rights Management","author":"A Kiayias","year":"2002","unstructured":"Kiayias, A., Yung, M.: On crafty pirates and foxy tracers. In: Sander, T. (ed.) DRM 2001. LNCS, vol. 2320, pp. 22\u201339. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-47870-1_3"},{"key":"9_CR46","unstructured":"Knuth, D.E.: Art of Computer Programming, Volume 2: Seminumerical Algorithms. Addison-Wesley Professional (2014)"},{"key":"9_CR47","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":"9_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45708-9_38","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"A Lysyanskaya","year":"2002","unstructured":"Lysyanskaya, A.: Unique signatures and verifiable random functions from the DH-DDH separation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 597\u2013612. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_38"},{"key":"9_CR49","unstructured":"Massey, J.L.: Some applications of coding theory in cryptography. Codes Ciphers: Crypt. Coding IV, 33\u201347 (1995)"},{"key":"9_CR50","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":"9_CR51","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":"9_CR52","doi-asserted-by":"crossref","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications. In: 22nd ACM STOC, pp. 213\u2013223. ACM Press, Baltimore (1990)","DOI":"10.1145\/100216.100244"},{"key":"9_CR53","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":"9_CR54","doi-asserted-by":"crossref","unstructured":"Nick, J., Ruffing, T., Seurin, Y., Wuille, P.: MuSig-DN: schnorr multi-signatures with verifiably deterministic nonces. In: Ligatti, J., Ou, X., Katz, J., Vigna, G., (eds.) ACM CCS 2020, pp. 1717\u20131731. ACM Press, Virtual Event, USA (2020)","DOI":"10.1145\/3372297.3417236"},{"key":"9_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-14496-7_16","volume-title":"Information Theoretic Security","author":"K Nuida","year":"2010","unstructured":"Nuida, K.: A general conversion method of fingerprint codes to (more) robust fingerprint codes against bit erasure. In: Kurosawa, K. (ed.) ICITS 2009. LNCS, vol. 5973, pp. 194\u2013212. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14496-7_16"},{"key":"9_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-61996-8_31","volume-title":"Information Hiding","author":"B Pfitzmann","year":"1996","unstructured":"Pfitzmann, B.: Trials of traced traitors. In: Anderson, R. (ed.) IH 1996. LNCS, vol. 1174, pp. 49\u201364. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61996-8_31"},{"key":"9_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-68339-9_8","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"B Pfitzmann","year":"1996","unstructured":"Pfitzmann, B., Schunter, M.: Asymmetric fingerprinting. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 84\u201395. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_8"},{"key":"9_CR58","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: Asymmetric fingerprinting for larger collusions. In: Graveman, R., Janson, P.A., Neuman, C., Gong, L., (eds.) ACM CCS 97, pp. 151\u2013160. ACM Press, Zurich (1997)","DOI":"10.1145\/266420.266453"},{"key":"9_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11958239_24","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"DH Phan","year":"2006","unstructured":"Phan, D.H.: Traitor tracing for stateful pirate decoders with constant ciphertext rate. In: Nguyen, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol. 4341, pp. 354\u2013365. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11958239_24"},{"issue":"2","key":"9_CR60","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"MO Rabin","year":"1980","unstructured":"Rabin, M.O.: Probabilistic algorithms in finite fields. SIAM J. Comput. 9(2), 273\u2013280 (1980)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9_CR61","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"9_CR62","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":"9_CR63","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":"9_CR64","unstructured":"Sirvent, T.: Traitor tracing scheme with constant ciphertext rate against powerful pirates. Cryptology ePrint Archive, Paper 2006\/383 (2006). https:\/\/eprint.iacr.org\/2006\/383"},{"key":"9_CR65","doi-asserted-by":"crossref","unstructured":"Sudan, M.: Maximum likelihood decoding of reed solomon codes. In: 37th FOCS, pp. 164\u2013172. IEEE Computer Society Press, Burlington, Vermont (1996)","DOI":"10.1109\/SFCS.1996.548475"},{"key":"9_CR66","doi-asserted-by":"crossref","unstructured":"Ta-Shma, A.: Explicit, almost optimal, epsilon-balanced codes. In: Hatami, H., McKenzie, P., King, V., (eds.) 49th ACM STOC, pp. 238\u2013251. ACM Press, Montreal, QC, Canada (2017)","DOI":"10.1145\/3055399.3055408"},{"key":"9_CR67","doi-asserted-by":"crossref","unstructured":"Tardos, G.: Optimal probabilistic fingerprint codes. J. ACM, 55(2) (2008)","DOI":"10.1145\/1346330.1346335"},{"key":"9_CR68","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 Part I. LNCS, vol. 12550, pp. 210\u2013228. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_8"},{"key":"9_CR69","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 Part I. LNCS, vol. 12170, pp. 652\u2013682. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_22"},{"key":"9_CR70","doi-asserted-by":"crossref","unstructured":"Zou, X., Maino, F., Bertino, E., Sui, Y., Wang, K., Li, F.: A new approach to weighted multi-secret sharing. In: 2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN), pp. 1\u20136. IEEE (2011)","DOI":"10.1109\/ICCCN.2011.6005766"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68388-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T19:37:40Z","timestamp":1732649860000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68388-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683879","9783031683886"],"references-count":70,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68388-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}