{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:58:52Z","timestamp":1778065132471,"version":"3.51.4"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018830","type":"print"},{"value":"9783032018847","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-032-01884-7_12","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T09:31:09Z","timestamp":1755336669000},"page":"356-389","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fully Anonymous Secret Sharing"],"prefix":"10.1007","author":[{"given":"Allison","family":"Bishop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Green","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4096-6305","authenticated-orcid":false,"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3572-7643","authenticated-orcid":false,"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8709-2205","authenticated-orcid":false,"given":"Paul","family":"Lou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/978-3-030-64381-2_23","volume-title":"Theory of Cryptography, Part III","author":"T Agrikola","year":"2020","unstructured":"Agrikola, T., Couteau, G., Ishai, Y., Jarecki, S., Sahai, A.: On pseudorandom encodings. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 639\u2013669. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_23"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/978-3-319-63688-7_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Applebaum","year":"2017","unstructured":"Applebaum, B., Arkis, B., Raykov, P., Vasudevan, P.N.: Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 727\u2013757. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_24"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-030-17659-4_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Applebaum","year":"2019","unstructured":"Applebaum, B., Beimel, A., Farr\u00e0s, O., Nir, O., Peter, N.: Secret-sharing schemes for general and uniform access structures. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part III. LNCS, vol. 11478, pp. 441\u2013471. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_15"},{"key":"12_CR4","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, pp. 1553\u20131566. ACM Press (2023)","DOI":"10.1145\/3564246.3585127"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Beimel, A., Nir, O., Peter, N.: Better secret sharing via robust conditional disclosure of secrets. In: Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G., Chuzhoy, J. (eds.) 52nd ACM STOC, pp. 280\u2013293. ACM Press (2020)","DOI":"10.1145\/3357713.3384293"},{"key":"12_CR6","unstructured":"Applebaum, B., Vasudevan, P.N.: Placing conditional disclosure of secrets in the communication complexity universe. In: Blum, A. (ed.) ITCS 2019, vol. 124, pp. 4:1\u20134:14. LIPIcs (2019)"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Babai, L., G\u00e1l, A., Wigderson, A.: Superpolynomial lower bounds for monotone span programs. Comb. 19(3), 301\u2013319 (1999). https:\/\/doi.org\/10.1007\/s004930050058","DOI":"10.1007\/s004930050058"},{"key":"12_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-031-68394-7_7","volume-title":"CRYPTO 2024, Part VII","author":"J Bartusek","year":"2024","unstructured":"Bartusek, J., Raizes, J.: Secret sharing with certified deletion. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part VII. LNCS, vol. 14926, pp. 184\u2013214. Springer, Cham (Aug (2024)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Beimel, A., Gabizon, A., Ishai, Y., Kushilevitz, E.: Distribution design. In: Sudan, M. (ed.) ITCS 2016, pp. 81\u201392. ACM (2016)","DOI":"10.1145\/2840728.2840759"},{"key":"12_CR10","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, pp. 1\u201310. ACM Press (1988)","DOI":"10.1145\/62212.62213"},{"key":"12_CR11","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":"12_CR12","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":"12_CR13","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":"12_CR14","doi-asserted-by":"publisher","unstructured":"Blundo, C., Stinson, D.R.: Anonymous secret sharing schemes. Disc. Appl. Math. 77(1), 13\u201328 (1997). https:\/\/doi.org\/10.1016\/S0166-218X(97)89208-6","DOI":"10.1016\/S0166-218X(97)89208-6"},{"key":"12_CR15","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":"12_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":"12_CR17","doi-asserted-by":"crossref","unstructured":"Chandran, N., Goyal, V., Ostrovsky, R., Sahai, A.: Covert multi-party computation. In: 48th FOCS, pp. 238\u2013248. IEEE Computer Society Press (Oct 2007)","DOI":"10.1109\/FOCS.2007.61"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: 20th ACM STOC, pp. 11\u201319. ACM Press (1988)","DOI":"10.1145\/62212.62214"},{"key":"12_CR19","unstructured":"Con, R.: Anonymous Shamir\u2019s secret sharing via Reed-Solomon codes against permutations, insertions, and deletions (2024). https:\/\/arxiv.org\/abs\/2412.17003"},{"issue":"4","key":"12_CR20","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s001459900029","volume":"10","author":"L Csirmaz","year":"1997","unstructured":"Csirmaz, L.: The size of a share must be large. J. Cryptol. 10(4), 223\u2013231 (1997)","journal-title":"J. Cryptol."},{"key":"12_CR21","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":"12_CR22","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":"12_CR23","unstructured":"Eldridge, H., Beck, G., Green, M., Heninger, N., Jain, A.: Abuse-Resistant location tracking: Balancing privacy and safety in the offline finding ecosystem. In: 33rd USENIX Security Symposium (USENIX Security 24), pp. 5431\u20135448. USENIX Association, Philadelphia (2024). https:\/\/www.usenix.org\/conference\/usenixsecurity24\/presentation\/eldridge"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-13190-5_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"DM Freeman","year":"2010","unstructured":"Freeman, D.M.: Converting pairing-based cryptosystems from composite-order groups to prime-order groups. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 44\u201361. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_3"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. In: 30th ACM STOC, pp. 151\u2013160. ACM Press (1998)","DOI":"10.1145\/276698.276723"},{"key":"12_CR26","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. (ed.) 19th ACM STOC, pp. 218\u2013229. ACM Press (1987)","DOI":"10.1145\/28395.28420"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-662-48000-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"S Gorbunov","year":"2015","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Predicate encryption for circuits from LWE. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015, Part II. LNCS, vol. 9216, pp. 503\u2013523. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_25"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Goyal, R., Koppula, V., Waters, B.: Lockable obfuscation. In: Umans, C. (ed.) 58th FOCS, pp. 612\u2013621. IEEE Computer Society Press (2017)","DOI":"10.1109\/FOCS.2017.62"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Juels, A., Wright, R.N., De Capitani di Vimercati, S. (eds.) ACM CCS 2006, pp. 89\u201398. ACM Press (2006). Cryptology ePrint Archive Report 2006\/309","DOI":"10.1145\/1180405.1180418"},{"key":"12_CR30","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":"12_CR31","unstructured":"Griffy, S., Kohlweiss, M., Lysyanskaya, A., Sengupta, M.: Privacy-preserving blueprints via succinctly verifiable computation over additively-homomorphically encrypted data. Cryptology ePrint Archive, Report 2024\/675 (2024). https:\/\/eprint.iacr.org\/2024\/675"},{"issue":"3","key":"12_CR32","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1024198519111","volume":"28","author":"M Guillermo","year":"2003","unstructured":"Guillermo, M., Martin, K.M., O\u2019Keefe, C.M.: Providing anonymity in unconditionally secure secret sharing schemes. Des. Codes Cryptogr. 28(3), 227\u2013245 (2003). https:\/\/doi.org\/10.1023\/A:1024198519111","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"12_CR33","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"12_CR34","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: Proceedings of IEEE Global Telecommunication Conf. (Globecom\u201987), pp. 99\u2013102 (1987)"},{"key":"12_CR35","doi-asserted-by":"publisher","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, 18\u201321 May 1993, pp. 102\u2013111. IEEE Computer Society (1993). https:\/\/doi.org\/10.1109\/SCT.1993.336536","DOI":"10.1109\/SCT.1993.336536"},{"issue":"1\u20133","key":"12_CR36","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0166-218X(01)00236-0","volume":"121","author":"W Kishimoto","year":"2002","unstructured":"Kishimoto, W., Okada, K., Kurosawa, K., Ogata, W.: On the bound for anonymous secret sharing schemes. Disc. Appl. Math. 121(1\u20133), 193\u2013202 (2002)","journal-title":"Disc. Appl. Math."},{"key":"12_CR37","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/978-3-031-30617-4_20","volume-title":"EUROCRYPT 2023, Part II","author":"M Kohlweiss","year":"2023","unstructured":"Kohlweiss, M., Lysyanskaya, A., Nguyen, A.: Privacy-preserving blueprints. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part II. LNCS, vol. 14005, pp. 594\u2013625. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_20"},{"key":"12_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-319-96884-1_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"L Kowalczyk","year":"2018","unstructured":"Kowalczyk, L., Malkin, T., Ullman, J., Wichs, D.: Hardness of non-interactive differential privacy from one-way functions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part I. LNCS, vol. 10991, pp. 437\u2013466. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_15"},{"key":"12_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-030-57990-6_28","volume-title":"Security and Cryptography for Networks","author":"KG Larsen","year":"2020","unstructured":"Larsen, K.G., Simkin, M.: Secret sharing lower bound: either reconstruction is hard or shares are long. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 566\u2013578. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_28"},{"key":"12_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-29011-4_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Lewko","year":"2012","unstructured":"Lewko, A.: Tools for simulating features of composite order bilinear groups in the prime order setting. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 318\u2013335. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_20"},{"key":"12_CR41","doi-asserted-by":"crossref","unstructured":"Liu, T., Vaikuntanathan, V.: Breaking the circuit-size barrier in secret sharing. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th ACM STOC, pp. 699\u2013708. ACM Press (2018)","DOI":"10.1145\/3188745.3188936"},{"key":"12_CR42","unstructured":"Naysmith, C.: Apple AirTags and Bluetooth Trackers Are Officially a Billion-Dollar Industry. Yahoo News (2022). https:\/\/www.pcmag.com\/news\/couple-used-apple-airtag-to-track-luggage-that-was-donated-to-charity"},{"key":"12_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-10366-7_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"T Okamoto","year":"2009","unstructured":"Okamoto, T., Takashima, K.: Hierarchical predicate encryption for inner-products. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 214\u2013231. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_13"},{"issue":"1","key":"12_CR44","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1587\/transfun.E98.A.3","volume":"98","author":"T Okamoto","year":"2015","unstructured":"Okamoto, T., Takashima, K.: Dual pairing vector spaces and their applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98(1), 3\u201315 (2015)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"12_CR45","doi-asserted-by":"publisher","unstructured":"Paskin-Cherniavsky, A., Olimid, R.F.: On cryptographic anonymity and unpredictability in secret sharing. Inf. Process. Lett. 161, 105965 (2020). https:\/\/doi.org\/10.1016\/j.ipl.2020.105965","DOI":"10.1016\/j.ipl.2020.105965"},{"issue":"3","key":"12_CR46","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF02451114","volume":"5","author":"SJ Phillips","year":"1992","unstructured":"Phillips, S.J., Phillips, N.C.: Strongly ideal secret sharing schemes. J. Cryptol. 5(3), 185\u2013191 (1992). https:\/\/doi.org\/10.1007\/BF02451114","journal-title":"J. Cryptol."},{"key":"12_CR47","doi-asserted-by":"crossref","unstructured":"Pitassi, T., Robere, R.: Strongly exponential lower bounds for monotone computation. In: Hatami, H., McKenzie, P., King, V. (eds.) 49th ACM STOC, pp. 1246\u20131255. ACM Press (2017)","DOI":"10.1145\/3055399.3055478"},{"key":"12_CR48","doi-asserted-by":"crossref","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 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"12_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11426639_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"A Sahai","year":"2005","unstructured":"Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 457\u2013473. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_27"},{"issue":"11","key":"12_CR50","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."},{"issue":"2","key":"12_CR51","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0401024","volume":"1","author":"DR Stinson","year":"1988","unstructured":"Stinson, D.R., Vanstone, S.A.: A combinatorial approach to threshold schemes. SIAM J. Disc. Math. 1(2), 230\u2013236 (1988)","journal-title":"SIAM J. Disc. Math."},{"key":"12_CR52","doi-asserted-by":"crossref","unstructured":"von Ahn, L., Hopper, N.J., Langford, J.: Covert two-party computation. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 513\u2013522. ACM Press (2005)","DOI":"10.1145\/1060590.1060668"},{"key":"12_CR53","doi-asserted-by":"crossref","unstructured":"Wichs, D., Zirdelis, G.: Obfuscating compute-and-compare programs under LWE. In: Umans, C. (ed.) 58th FOCS, pp. 600\u2013611. IEEE Computer Society Press (2017)","DOI":"10.1109\/FOCS.2017.61"},{"key":"12_CR54","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pp. 162\u2013167. IEEE Computer Society Press (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"12_CR55","unstructured":"Zhandry, M.: Optimal traitor tracing from pairings. Cryptology ePrint Archive, Report 2024\/867 (2024). https:\/\/eprint.iacr.org\/2024\/867"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01884-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T14:59:07Z","timestamp":1757429947000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01884-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018830","9783032018847"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01884-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","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":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}