{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:06:31Z","timestamp":1778061991471,"version":"3.51.4"},"publisher-location":"Cham","reference-count":29,"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_10","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T09:31:13Z","timestamp":1755336673000},"page":"295-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Strong Secret Sharing with\u00a0Snitching"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-4315-1914","authenticated-orcid":false,"given":"Jan","family":"Bormet","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6914-6425","authenticated-orcid":false,"given":"Stefan","family":"Dziembowski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8625-4639","authenticated-orcid":false,"given":"Sebastian","family":"Faust","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8563-4325","authenticated-orcid":false,"given":"Tomasz","family":"Lizurej","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0335-7018","authenticated-orcid":false,"given":"Marcin","family":"Mielniczuk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-540-85174-5_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J Alwen","year":"2008","unstructured":"Alwen, J., Shelat, A., Visconti, I.: Collusion-free protocols in the mediated model. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 497\u2013514. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_28"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., et al. (eds.) CCS \u201993, Proceedings of the 1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, USA, 3\u20135 November 1993, pp. 62\u2013 73. ACM (1993). https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, 2\u20134 May 1988, pp. 1\u201310. ACM (1988). https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"10_CR4","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":"10_CR5","doi-asserted-by":"publisher","unstructured":"Boneh, D., Naor, M.: Traitor tracing with constant size ciphertext. In: Proceedings of the 15th ACM Conference on Computer and Communications Security. CCS \u201908, pp. 501\u2013510. Association for Computing Machinery, Alexandria (2008). isbn: 9781595938107. https:\/\/doi.org\/10.1145\/1455770.1455834","DOI":"10.1145\/1455770.1455834"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Boneh, D., Partap, A., Rotem, L.: Accountability for misbehavior in threshold decryption via threshold traitor tracing. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 2024, Proceedings, Part VII. LNCS, vol. 14926, pp. 317\u2013351. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_11","DOI":"10.1007\/978-3-031-68394-7_11"},{"key":"10_CR7","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.) Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 2024, Proceedings, Part V. LNCS, vol. 14924, pp. 221\u2013256. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-68388-6_9","DOI":"10.1007\/978-3-031-68388-6_9"},{"key":"10_CR8","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":"10_CR9","doi-asserted-by":"publisher","unstructured":"Boneh, D., Waters, B.: A fully collusion resistant broadcast, trace, and revoke system. In: Proceedings of the 13th ACM Conference on Computer and Communications Security. CCS \u201906, pp. 211\u2013220. Association for Computing Machinery, Alexandria (2006). isbn: 1595935185. https:\/\/doi.org\/10.1145\/1180405.1180432","DOI":"10.1145\/1180405.1180432"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), 28:1\u201328:94 (2020). https:\/\/doi.org\/10.1145\/3402457","DOI":"10.1145\/3402457"},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1109\/18.841169","volume":"46","author":"B Chor","year":"2000","unstructured":"Chor, B., et al.: Tracing traitors. IEEE Trans. Inf. Theory 46(3), 893\u2013910 (2000). https:\/\/doi.org\/10.1109\/18.841169","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: Hartmanis, J. (ed.) Proceedings of the 18th Annual ACM Symposium on Theory of Computing, Berkeley, California, USA, 28\u201330 May 1986, pp. 364\u2013369. ACM (1986). https:\/\/doi.org\/10.1145\/12130.12168","DOI":"10.1145\/12130.12168"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Dziembowski, S., Faust, S., Lizurej, T.: Individual cryptography. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, 20\u201324 August 2023, Proceedings, Part II. LNCS, vol. 14082, pp. 547\u2013579. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_18","DOI":"10.1007\/978-3-031-38545-2_18"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Dziembowski, S., et al.: Secret sharing with snitching. In: Luo, B., et al. (eds.) Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, CCS 2024, Salt Lake City, UT, USA, 14\u201318 October 2024, pp. 840\u2013853. ACM (2024). https:\/\/doi.org\/10.1145\/3658644.3690296","DOI":"10.1145\/3658644.3690296"},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/S00145-001-0006-7","volume":"14","author":"A Fiat","year":"2001","unstructured":"Fiat, A., Tassa, T.: Dynamic traitor tracing. J. Cryptol. 14(3), 211\u2013223 (2001). https:\/\/doi.org\/10.1007\/S00145-001-0006-7","journal-title":"J. Cryptol."},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"MJ Fischer","year":"1986","unstructured":"Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. Distrib. Comput. 1(1), 26\u201339 (1986). https:\/\/doi.org\/10.1007\/BF01843568","journal-title":"Distrib. Comput."},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 1: Basic Techniques. Cambridge University Press (2001). isbn: 0-521-79172-3. https:\/\/doi.org\/10.1017\/CBO9780511546891","DOI":"10.1017\/CBO9780511546891"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Gong, T., et al.: More is merrier: relax the non-collusion assumption in multi-server PIR. In: IEEE Symposium on Security and Privacy, SP 2024, San Francisco, CA, USA, 19\u201323 May 2024, pp. 4348\u2013 4366. IEEE (2024). https:\/\/doi.org\/10.1109\/SP54263.2024.00095","DOI":"10.1109\/SP54263.2024.00095"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Goyal, R., Koppula, V., Waters, B.: Collusion resistant traitor tracing from learning with errors. SIAM J. Comput. 49(5) (2020). https:\/\/doi.org\/10.1137\/18M1197825","DOI":"10.1137\/18M1197825"},{"key":"10_CR20","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":"10_CR21","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, 3rd edn. Chapman & Hall\/CRC Cryptography and Network Security Series. CRC Press (2020). isbn: 9781351133029"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Kurosawa, K., Desmedt, Y.: Optimum traitor tracing and asymmetric schemes. In: Nyberg, K. (ed.) Advances in Cryptology - EUROCRYPT \u201998, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, 31 May\u20134 June 1998, Proceeding. LNCS, vol. 1403, pp. 145\u2013157. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFB0054123","DOI":"10.1007\/BFB0054123"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Lepinski, M., Micali, S., Shelat, A.: Collusion-free protocols. In: Gabow, H.N., Fagin, R. (eds.) Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, 22\u201324 May 2005, pp. 543\u2013552. ACM (2005). https:\/\/doi.org\/10.1145\/1060590.1060671","DOI":"10.1145\/1060590.1060671"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press (2005). isbn: 0521835402","DOI":"10.1017\/CBO9780511813603"},{"issue":"6","key":"10_CR25","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/S10207-010-0121-2","volume":"9","author":"M Naor","year":"2010","unstructured":"Naor, M., Pinkas, B.: Efficient trace and revoke schemes. Int. J. Inf. Secur. 9(6), 411\u2013424 (2010). https:\/\/doi.org\/10.1007\/S10207-010-0121-2","journal-title":"Int. J. Inf. Secur."},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"Naor, M., Pinkas, B.: Threshold traitor tracing. In: Krawczyk, H. (ed.) Advances in Cryptology - CRYPTO \u201998, 18th Annual International Cryptology Conference, Santa Barbara, California, USA, 23\u201327 August 1998, Proceedings. LNCS, vol. 1462, pp. 502\u2013517. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFB0055750","DOI":"10.1007\/BFB0055750"},{"key":"10_CR27","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"},{"issue":"11","key":"10_CR28","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). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"10_CR29","doi-asserted-by":"publisher","unstructured":"Shelat, A.: Collusion-free protocols. In: Dror, M., Sosic, G. (eds.) Proceedings of the Behavioral and Quantitative Game Theory - Conference on Future Directions, BQGT \u201910, Newport Beach, California, USA, 14\u201316 May 2010, vol. 91, p. 1. ACM (2010). https:\/\/doi.org\/10.1145\/1807406.1807497","DOI":"10.1145\/1807406.1807497"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T09:31:14Z","timestamp":1755336674000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01884-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018830","9783032018847"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01884-7_10","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"}}]}}