{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:48:25Z","timestamp":1765370905318,"version":"3.46.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032133007","type":"print"},{"value":"9783032133014","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-13301-4_18","type":"book-chapter","created":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:12:37Z","timestamp":1765357957000},"page":"417-441","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Traceable Bottom-Up Secret Sharing and\u00a0Law and\u00a0Order on\u00a0Community Social Key Recovery"],"prefix":"10.1007","author":[{"given":"Rittwik","family":"Hajra","sequence":"first","affiliation":[]},{"given":"Subha","family":"Kar","sequence":"additional","affiliation":[]},{"given":"Pratyay","family":"Mukherjee","sequence":"additional","affiliation":[]},{"given":"Soumit","family":"Pal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,11]]},"reference":[{"key":"18_CR1","unstructured":"Argent: How to recover my wallet with guardians on-chain (complete guide) (2025). https:\/\/support.argent.xyz\/hc\/en-us\/articles\/360007338877-How-to-recover-my-wallet-with-guardians-onchain-complete-guide"},{"key":"18_CR2","unstructured":"Baghery, K., Ebrahimi, E., Mirzamohammadi, O., Sedaghat, M.: Traceable verifiable secret sharing and applications. Cryptology ePrint Archive, Paper 2025\/318 (2025). https:\/\/eprint.iacr.org\/2025\/318"},{"key":"18_CR3","unstructured":"Baird, L., et al.: Threshold signatures in the multiverse. Cryptology ePrint Archive, Paper 2023\/063 (2023). https:\/\/eprint.iacr.org\/2023\/063"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Dai, W., Rogaway, P.: Reimagining secret sharing: creating a safer and more versatile primitive by adding authenticity, correcting errors, and reducing randomness requirements. Cryptology ePrint Archive, Paper 2020\/800 (2020). https:\/\/eprint.iacr.org\/2020\/800","DOI":"10.2478\/popets-2020-0082"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Bhattacharyya, R., Bormet, J., Faust, S., Mukherjee, P., Othman, H.: CCA-secure traceable threshold (ID-based) encryption and application. Cryptology ePrint Archive, Paper 2025\/341 (2025). https:\/\/eprint.iacr.org\/2025\/341","DOI":"10.1145\/3719027.3744876"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: 1979 International Workshop on Managing Requirements Knowledge (MARK), pp. 313\u2013318 (1899). https:\/\/api.semanticscholar.org\/CorpusID:38199738","DOI":"10.1109\/MARK.1979.8817296"},{"key":"18_CR7","first-page":"338","volume-title":"CRYPTO 1999","author":"D Boneh","year":"1999","unstructured":"Boneh, D., Franklin, M.: An efficient public key traitor tracing scheme. In: Wiener, M. (ed.) CRYPTO 1999, pp. 338\u2013353. Springer, Heidelberg (1999)"},{"key":"18_CR8","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 2008, pp. 501\u2013510. Association for Computing Machinery, New York (2008). https:\/\/doi.org\/10.1145\/1455770.1455834","DOI":"10.1145\/1455770.1455834"},{"key":"18_CR9","doi-asserted-by":"crossref","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","DOI":"10.1007\/978-3-031-68388-6_9"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Boneh, D., Partap, A., Rotem, L.: Traceable verifiable random functions. Cryptology ePrint Archive, Paper 2025\/312 (2025). https:\/\/eprint.iacr.org\/2025\/312","DOI":"10.1007\/978-3-032-01878-6_7"},{"key":"18_CR11","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":"18_CR12","first-page":"452","volume-title":"CRYPT0 1995","author":"D Boneh","year":"1995","unstructured":"Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. In: Coppersmith, D. (ed.) CRYPT0 1995, pp. 452\u2013465. Springer, Heidelberg (1995)"},{"issue":"4","key":"18_CR13","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1007\/s00453-016-0242-8","volume":"79","author":"D Boneh","year":"2017","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. Algorithmica 79(4), 1233\u20131285 (2017). https:\/\/doi.org\/10.1007\/s00453-016-0242-8","journal-title":"Algorithmica"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Bormet, J., Dziembowski, S., Faust, S., Lizurej, T., Mielniczuk, M.: Strong secret sharing with snitching. Cryptology ePrint Archive, Paper 2025\/1119 (2025). https:\/\/eprint.iacr.org\/2025\/1119","DOI":"10.1007\/978-3-032-01884-7_10"},{"key":"18_CR15","unstructured":"Bormet, J., Hofmann, J., Othman, H.: Traceable threshold encryption without trusted dealer. Cryptology ePrint Archive, Paper 2025\/342 (2025). https:\/\/eprint.iacr.org\/2025\/342"},{"key":"18_CR16","unstructured":"Buterin, V.: Why we need wide adoption of social recovery wallets (2021). https:\/\/vitalik.eth.limo\/general\/2021\/01\/11\/recovery.html"},{"key":"18_CR17","unstructured":"Chatzigiannis, P., Chalkias, K., Kate, A., Mangipudi, E.V., Minaei, M., Mondal, M.: SoK: Web3 recovery mechanisms. Cryptology ePrint Archive, Paper 2023\/1575 (2023). https:\/\/eprint.iacr.org\/2023\/1575"},{"key":"18_CR18","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"},{"issue":"3","key":"18_CR19","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1109\/18.841169","volume":"46","author":"B Chor","year":"2000","unstructured":"Chor, B., Fiat, A., Naor, M., Pinkas, B.: 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":"18_CR20","unstructured":"Dodis, Y., Fazio, N.: Public key trace and revoke scheme secure against adaptive chosen ciphertext attack. Cryptology ePrint Archive, Paper 2003\/095 (2003). https:\/\/eprint.iacr.org\/2003\/095"},{"key":"18_CR21","doi-asserted-by":"publisher","unstructured":"Dziembowski, S., Faust, S., Lizurej, T., Mielniczuk, M.: Secret sharing with snitching. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, CCS 2024, pp. 840\u2013853. Association for Computing Machinery, New York (2024). https:\/\/doi.org\/10.1145\/3658644.3690296","DOI":"10.1145\/3658644.3690296"},{"key":"18_CR22","unstructured":"Farr\u00e0s, O., Guiot, M.: Traceable secret sharing schemes for general access structures. Cryptology ePrint Archive, Paper 2025\/1120 (2025). https:\/\/eprint.iacr.org\/2025\/1120"},{"key":"18_CR23","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":"18_CR24","doi-asserted-by":"publisher","unstructured":"Garg, S., Kumarasubramanian, A., Sahai, A., Waters, B.: Building efficient fully collusion-resilient traitor tracing and revocation schemes. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, CCS 2010, pp. 121\u2013130. Association for Computing Machinery, New York (2010). https:\/\/doi.org\/10.1145\/1866307.1866322","DOI":"10.1145\/1866307.1866322"},{"key":"18_CR25","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":"18_CR26","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-031-91092-0_2","volume-title":"EUROCRYPT 2025","author":"T Gong","year":"2025","unstructured":"Gong, T., Kate, A., Maji, H.K., Nguyen, H.H.: Disincentivize collusion in verifiable secret sharing. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT 2025, pp. 34\u201364. Springer, Cham (2025)"},{"key":"18_CR27","doi-asserted-by":"publisher","unstructured":"Goyal, R., Koppula, V., Waters, B.: Collusion resistant traitor tracing from learning with errors. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, pp. 660\u2013670. Association for Computing Machinery, New York (2018). https:\/\/doi.org\/10.1145\/3188745.3188844","DOI":"10.1145\/3188745.3188844"},{"key":"18_CR28","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":"18_CR29","doi-asserted-by":"publisher","unstructured":"Guruswami, V.: Improved decoding of reed-solomon and algebraic-geometric codes, vol.\u00a045, pp. 28\u201337 (1998). https:\/\/doi.org\/10.1109\/SFCS.1998.743426","DOI":"10.1109\/SFCS.1998.743426"},{"key":"18_CR30","unstructured":"Hoffmann, C.: Traceable secret sharing based on the Chinese remainder theorem. Cryptology ePrint Archive, Paper 2024\/811 (2024). https:\/\/eprint.iacr.org\/2024\/811"},{"key":"18_CR31","unstructured":"Kate, A., Mukherjee, P., Saleem, H., Sarkar, P., Roberts, B.: ANARKey: a new approach to (socially) recover keys. Cryptology ePrint Archive, Paper 2025\/551 (2025). https:\/\/eprint.iacr.org\/2025\/551"},{"key":"18_CR32","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":"18_CR33","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":"18_CR34","unstructured":"Lindell, Y.: Cryptography and MPC in coinbase wallet as a service (WAAS) (2023). https:\/\/www.coinbase.com\/en-in\/blog\/digital-asset-management-with-mpc-whitepaper"},{"key":"18_CR35","unstructured":"Little, R., Qin, L., Varia, M.: Secure account recovery for a privacy-preserving web service. Cryptology ePrint Archive, Paper 2024\/962 (2024). https:\/\/eprint.iacr.org\/2024\/962"},{"key":"18_CR36","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.) Cryptography, pp. 371\u2013375. Springer, Heidelberg (1983)"},{"key":"18_CR37","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":"18_CR38","doi-asserted-by":"publisher","unstructured":"Pedin, A.B., Siasi, N., Sameni, M.: Smart contract-based social recovery wallet management scheme for digital assets. In: Proceedings of the 2023 ACM Southeast Conference, ACMSE 2023, pp. 177\u2013181. Association for Computing Machinery, New York (2023). https:\/\/doi.org\/10.1145\/3564746.3587016","DOI":"10.1145\/3564746.3587016"},{"issue":"11","key":"18_CR39","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":"18_CR40","unstructured":"Times, T.N.Y.: Tens of billions worth of bitcoin have been locked by people who forgot their key (2021). https:\/\/www.nytimes.com\/2021\/01\/13\/business\/tens-of-billions-worth-of-bitcoin-have-been-locked-by-people-who-forgot-their-key.html"},{"key":"18_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-030-64375-1_8","volume-title":"Theory of Cryptography","author":"H Wee","year":"2020","unstructured":"Wee, H.: Functional encryption for quadratic functions from k-Lin, revisited. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 210\u2013228. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_8"},{"key":"18_CR42","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: New techniques for traitor tracing: Size $$n^{1\/3}$$ and more from pairings. Cryptology ePrint Archive, Paper 2020\/954 (2020). https:\/\/eprint.iacr.org\/2020\/954","DOI":"10.1007\/978-3-030-56784-2_22"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-13301-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:12:46Z","timestamp":1765357966000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-13301-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,11]]},"ISBN":["9783032133007","9783032133014"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-13301-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,11]]},"assertion":[{"value":"11 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneshwar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"14 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}