{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:43:11Z","timestamp":1765370591864,"version":"3.41.0"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031910913"},{"type":"electronic","value":"9783031910920"}],"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-031-91092-0_2","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T12:57:59Z","timestamp":1745758679000},"page":"34-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Disincentivize Collusion in\u00a0Verifiable Secret Sharing"],"prefix":"10.1007","author":[{"given":"Tiantian","family":"Gong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aniket","family":"Kate","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hemanta K.","family":"Maji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai H.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"2_CR1","unstructured":"Drand: Distributed randomness beacon. https:\/\/drand.love\/"},{"key":"2_CR2","unstructured":"Zengo threshold wallet. https:\/\/github.com\/ZenGo-X\/gotham-city\/blob\/master\/white-paper\/white-paper.pdf"},{"key":"2_CR3","unstructured":"Babai, L., Frankl, P.: Linear algebra methods in combinatorics: with applications to geometry and computer science. Department of Computer Science, University of Chicago (1992)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-31517-1_12","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2016","author":"G Bai","year":"2016","unstructured":"Bai, G., Damg\u00e5rd, I., Orlandi, C., Xia, Yu.: Non-interactive verifiable secret sharing for monotone circuits. In: Pointcheval, D., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2016. LNCS, vol. 9646, pp. 225\u2013244. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31517-1_12"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Bai, G., Damg\u00e5rd, I., Orlandi, C., Xia, Y.: Non-interactive verifiable secret sharing for monotone circuits. Cryptology ePrint Archive, Paper 2016\/078 (2016)","DOI":"10.1007\/978-3-319-31517-1_12"},{"key":"2_CR6","unstructured":"Beimel, A.: Lower bounds for secret-sharing schemes for k-hypergraphs. In: Chung, K. (ed.) 4th ITC Conference 2023, pp. 16:1\u201316:13 (2023)"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Beimel, A., Farr\u00e0s, O., Lasri, O.: Improved polynomial secret-sharing schemes. In: Rothblum, G.N., Wee, H. (eds.) TCC 2023. LNCS, vol. 14370, pp. 374\u2013405. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48618-0_13","DOI":"10.1007\/978-3-031-48618-0_13"},{"key":"2_CR8","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, May 1988","DOI":"10.1145\/62212.62213"},{"key":"2_CR9","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_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-662-49890-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"A Bishop","year":"2016","unstructured":"Bishop, A., Pastro, V., Rajaraman, R., Wichs, D.: Essentially optimal robust secret sharing with maximal corruptions. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 58\u201386. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_3"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: International Workshop on Managing Requirements Knowledge, p. 313 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"2_CR12","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 2024. 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":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19\u201340. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_2"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Goodman, J.: Improved extractors for small-space sources. In: 62nd FOCS, pp. 610\u2013621. IEEE Computer Society Press, February 2022","DOI":"10.1109\/FOCS52979.2021.00066"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Goodman, J., Goyal, V., Li, X.: Extractors for adversarial sources via extremal hypergraphs. In: 52nd ACM STOC, pp. 1184\u20131197. ACM Press, June 2020","DOI":"10.1145\/3357713.3384339"},{"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, pp. 11\u201319. ACM Press, May 1988","DOI":"10.1145\/62212.62214"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Chen, Y.H., Lindell, Y.: Feldman\u2019s verifiable secret sharing for a dishonest majority. IACR Commun. Cryptol. 1(1) (2024)","DOI":"10.62056\/ak2isgvtw"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1007\/s10623-018-0578-y","volume":"87","author":"M Cheraghchi","year":"2019","unstructured":"Cheraghchi, M.: Nearly optimal robust secret sharing. Des. Codes Crypt. 87, 1777\u20131796 (2019)","journal-title":"Des. Codes Crypt."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: FOCS, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0053420","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201994","author":"L Csirmaz","year":"1995","unstructured":"Csirmaz, L.: The size of a share must be large. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 13\u201322. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0053420"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Faust, S., Lizurej, T., Mielniczuk, M.: Secret sharing with snitching. In: Proceedings of the 2024 ACM CCS (2024)","DOI":"10.1145\/3658644.3690296"},{"key":"2_CR22","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive (2019)"},{"key":"2_CR23","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, May 1987","DOI":"10.1145\/28395.28420"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Gong, T., Henry, R., Psomas, A., Kate, A.: More is merrier: relax the non-collusion assumption in multi-server PIR. In: 2024 IEEE Symposium on Security and Privacy (SP), pp. 95\u201395. IEEE Computer Society, Los Alamitos, CA, USA, May 2024","DOI":"10.1109\/SP54263.2024.00095"},{"key":"2_CR25","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"},{"issue":"2","key":"2_CR26","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s004930050053","volume":"19","author":"DA Grable","year":"1999","unstructured":"Grable, D.A.: More-than-nearly-perfect packings and partial designs. Combinatorica 19(2), 221\u2013239 (1999)","journal-title":"Combinatorica"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"2_CR28","unstructured":"Cloudflare Inc.: DDoS threat report for 2024 Q2 by Cloudflare (2024). https:\/\/blog.cloudflare.com\/ddos-threat-report-for-2024-q2\/"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. Electroni. Commun. Japan (Part III: Fundam. Electron. Sci.) 72(9), 56\u201364 (1989)","DOI":"10.1002\/ecjc.4430720906"},{"issue":"3","key":"2_CR30","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1962.1057714","volume":"8","author":"S Johnson","year":"1962","unstructured":"Johnson, S.: A new upper bound for error-correcting codes. IRE Trans. Inf. Theor. 8(3), 203\u2013207 (1962)","journal-title":"IRE Trans. Inf. Theor."},{"issue":"1","key":"2_CR31","doi-asserted-by":"publisher","first-page":"131","DOI":"10.2140\/pjm.1968.26.131","volume":"26","author":"J Kalbfleisch","year":"1968","unstructured":"Kalbfleisch, J., Stanton, R.: Maximal and minimal coverings of (k- 1)-tuples by k-tuples. Pac. J. Math. 26(1), 131\u2013140 (1968)","journal-title":"Pac. J. Math."},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Kate, A., Mangipudi, E.V., Mukherjee, P., Saleem, H., Thyagarajan, S.A.K.: Non-interactive VSS using class groups and application to DKG. In: ACM CCS (2024)","DOI":"10.1145\/3658644.3670312"},{"key":"2_CR33","unstructured":"Keevash, P.: The existence of designs. arXiv preprint arXiv:1401.3665 (2014)"},{"key":"2_CR34","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/S1571-0653(04)00228-8","volume":"7","author":"JH Kim","year":"2001","unstructured":"Kim, J.H.: Nearly optimal partial Steiner systems. Electron. Notes Discret. Math. 7, 74\u201377 (2001)","journal-title":"Electron. Notes Discret. Math."},{"key":"2_CR35","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, June 2018","DOI":"10.1145\/3188745.3188936"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Liu, X., Mubayi, D.: On explicit constructions of designs. Electron. J. Comb. 29(1) (2022)","DOI":"10.37236\/10513"},{"key":"2_CR37","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, vol.\u00a016. Elsevier (1977)"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Mangipudi, E.V., Desai, U., Minaei, M., Mondal, M., Kate, A.: Uncovering impact of mental models towards adoption of multi-device crypto-wallets. In: ACM CCS, pp. 3153\u20133167. ACM (2023)","DOI":"10.1145\/3576915.3623218"},{"key":"2_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-36413-7_26","volume-title":"Security in Communication Networks","author":"J Mart\u00ed-Farr\u00e9","year":"2003","unstructured":"Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: Secret sharing schemes on access structures with intersection number equal to one. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 354\u2013363. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36413-7_26"},{"issue":"3","key":"2_CR40","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.dam.2005.09.003","volume":"154","author":"J Mart\u00ed-Farr\u00e9","year":"2006","unstructured":"Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: Secret sharing schemes on access structures with intersection number equal to one. Discret. Appl. Math. 154(3), 552\u2013563 (2006)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"2_CR41","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs randomness. J. Comput. Syst. Sci. 49(2), 149\u2013167 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR42","unstructured":"Ozdemir, A., Boneh, D.: Experimenting with collaborative zk-SNARKs: zero-knowledge proofs for distributed secrets. In: USENIX Security 2022, pp. 4291\u20134308 (2022)"},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: 21st ACM STOC, pp. 73\u201385. ACM Press, May 1989","DOI":"10.1145\/73007.73014"},{"key":"2_CR44","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Technical report, USA (1996)"},{"issue":"1","key":"2_CR45","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0195-6698(85)80023-8","volume":"6","author":"V R\u00f6dl","year":"1985","unstructured":"R\u00f6dl, V.: On a packing and covering problem. Eur. J. Comb. 6(1), 69\u201378 (1985)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"2_CR46","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/rsa.3240050117","volume":"5","author":"V R\u00f6dl","year":"1994","unstructured":"R\u00f6dl, V., \u0160inajov\u00e1, E.: Note on independent sets in Steiner systems. Random Struct. Algorithms 5(1), 183\u2013190 (1994)","journal-title":"Random Struct. Algorithms"},{"key":"2_CR47","unstructured":"Selten, R.: Spieltheoretische behandlung eines oligopolmodells mit nachfragetr\u00e4gheit: Teil i: Bestimmung des dynamischen preisgleichgewichts. Zeitschrift f\u00fcr die gesamte Staatswissenschaft\/J. Instit. Theor. Econ. (H. 2), 301\u2013324 (1965)"},{"issue":"11","key":"2_CR48","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"issue":"1","key":"2_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0021-9800(68)80023-7","volume":"5","author":"J Spencer","year":"1968","unstructured":"Spencer, J.: Maximal consistent families of triples. J. Comb. Theory 5(1), 1\u20138 (1968)","journal-title":"J. Comb. Theory"},{"key":"2_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-48071-4_11","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"C Blundo","year":"1993","unstructured":"Blundo, C., De Santis, A., Gargano, L., Vaccaro, U.: On the information rate of secret sharing schemes. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 148\u2013167. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_11"},{"key":"2_CR51","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd FOCS, pp. 80\u201391. IEEE Computer Society Press, November 1982","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91092-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T18:22:54Z","timestamp":1749493374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91092-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031910913","9783031910920"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91092-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 April 2025","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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","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":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}