{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:08:04Z","timestamp":1768345684250,"version":"3.49.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031786785","type":"print"},{"value":"9783031786792","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-031-78679-2_8","type":"book-chapter","created":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T05:44:12Z","timestamp":1739771052000},"page":"140-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Proactive Refresh for\u00a0Accountable Threshold Signatures"],"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":[[2025,2,16]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Almansa, J.F., Damg\u00e5rd, I., Nielsen, J.B.: Simplified threshold RSA with adaptive and proactive security. In: Advances in Cryptology \u2013 EUROCRYPT\u2019 06, pp. 593\u2013611 (2006)","DOI":"10.1007\/11761679_35"},{"key":"8_CR2","unstructured":"Andresen, G.: Bitcoin $$m$$-of-$$n$$ standard transactions (2011). BIP-0011"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Bagherzandi, A., Cheon, J.H., Jarecki, S.: Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM CCS 2008, pp. 449\u2013458. ACM Press (Oct 2008). https:\/\/doi.org\/10.1145\/1455770.1455827","DOI":"10.1145\/1455770.1455827"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Barak, B., Herzberg, A., Naor, D., Shai, E.: The proactive security toolkit and applications. In: Motiwalla, J., Tsudik, G. (eds.) ACM CCS 99, pp. 18\u201327. ACM Press (Nov 1999). https:\/\/doi.org\/10.1145\/319709.319713","DOI":"10.1145\/319709.319713"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Crites, E., Komlo, C., Maller, M., Tessaro, S., Zhu, C.: Better than advertised security for non-interactive threshold signatures. In: CRYPTO\u201922. Springer-Verlag (2022)","DOI":"10.1007\/978-3-031-15985-5_18"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: CCS\u201906, pp. 390\u2013399. ACM (2006)","DOI":"10.1145\/1180405.1180453"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Bellare, M., Neven, G.: Identity-based multi-signatures from RSA. In: Topics in Cryptology - CT-RSA 2007, pp. 145\u2013162 (2007)","DOI":"10.1007\/11967668_10"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Advances in Cryptology \u2013 EUROCRYPT \u201906, pp. 409\u2013426 (2006)","DOI":"10.1007\/11761679_25"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Benaloh, J., de\u00a0Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: Advances in Cryptology \u2013 EUROCRYPT \u201993, pp. 274\u2013285 (1993)","DOI":"10.1007\/3-540-48285-7_24"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36288-6_3","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"A Boldyreva","year":"2003","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-diffie-hellman-group signature scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31\u201346. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_3"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: Batching techniques for accumulators with applications to IOPs and stateless blockchains. In: Advances in Cryptology \u2013 CRYPTO \u201919, pp. 561\u2013586 (2019)","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Boneh, D., Drijvers, M., Neven, G.: Compact multi-signatures for smaller blockchains. In: ASIACRYPT\u201918, pp. 435\u2013463 (2018)","DOI":"10.1007\/978-3-030-03329-3_15"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416\u2013432. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_26"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Boneh, D., Komlo, C.: Threshold signatures with private accountability. In: CRYPTO\u201922. LNCS, vol. 13509. Springer (2022)","DOI":"10.1007\/978-3-031-15985-5_19"},{"key":"8_CR15","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":"8_CR16","unstructured":"Boneh, D., Partap, A., Rotem, L.: Proactive refresh for accountable threshold signatures. Cryptology ePrint Archive, Paper 2022\/1656 (2022). link"},{"key":"8_CR17","unstructured":"Boneh, D., Partap, A., Waters, B.: Accountable multi-signatures with constant size public keys. Cryptol. ePrint Arch. Paper 2023\/1793 (2023). link"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous verifiable secret sharing and proactive cryptosystems. In: Atluri, V. (ed.) ACM CCS 2002, pp. 88\u201397. ACM Press (Nov 2002). https:\/\/doi.org\/10.1145\/586110.586124","DOI":"10.1145\/586110.586124"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Advances in Cryptology \u2013 CRYPTO \u201902, pp. 61\u201376 (2002)","DOI":"10.1007\/3-540-45708-9_5"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Canetti, R., Gennaro, R., Goldfeder, S., Makriyannis, N., Peled, U.: UC non-interactive, proactive, threshold ECDSA with identifiable aborts. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 1769\u20131787. ACM Press (Nov 2020). https:\/\/doi.org\/10.1145\/3372297.3423367","DOI":"10.1145\/3372297.3423367"},{"key":"8_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":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"Frankel, Y., Gemmell, P., MacKenzie, P.D., Yung, M.: Optimal resilience proactive public-key cryptosystems. In: 38th FOCS, pp. 384\u2013393. IEEE Computer Society Press (Oct 1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646127","DOI":"10.1109\/SFCS.1997.646127"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Frankel, Y., Gemmell, P., MacKenzie, P.D., Yung, M.: Proactive RSA. In: Kaliski Jr., B.S. (ed.) CRYPTO\u201997. LNCS, vol.\u00a01294, pp. 440\u2013454. Springer, Heidelberg (Aug 1997). https:\/\/doi.org\/10.1007\/BFb0052254","DOI":"10.1007\/BFb0052254"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-48000-6_15","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"Y Frankel","year":"1999","unstructured":"Frankel, Y., MacKenzie, P., Yung, M.: Adaptively-secure optimal-resilience proactive RSA. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 180\u2013194. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48000-6_15"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Guillou, L.C., Quisquater, J.J.: A \u201cparadoxical\u201d indentity-based signature scheme resulting from zero-knowledge. In: Advances in Cryptology \u2013 CRYPTO \u201988, pp. 216\u2013231 (1988)","DOI":"10.1007\/0-387-34799-2_16"},{"key":"8_CR27","doi-asserted-by":"publisher","unstructured":"Herzberg, A., Jakobsson, M., Jarecki, S., Krawczyk, H., Yung, M.: Proactive public key and signature systems. In: Graveman, R., Janson, P.A., Neuman, C., Gong, L. (eds.) ACM CCS 97, pp. 100\u2013110. ACM Press (Apr 1997). https:\/\/doi.org\/10.1145\/266420.266442","DOI":"10.1145\/266420.266442"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","author":"A Herzberg","year":"1995","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: how to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339\u2013352. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_27"},{"key":"8_CR29","unstructured":"Itakura, K., Nakamura, K.: A public-key cryptosystem suitable for digital multisignatures. NEC Res. dev. 71, 1\u2013 8 (1983)"},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-540-85230-8_20","volume-title":"Financial Cryptography and Data Security","author":"S Jarecki","year":"2008","unstructured":"Jarecki, S., Olsen, J.: Proactive RSA with non-interactive signing. In: Tsudik, G. (ed.) FC 2008. LNCS, vol. 5143, pp. 215\u2013230. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85230-8_20"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Komlo, C., Goldberg, I.: FROST: flexible round-optimized schnorr threshold signatures. In: Selected Areas in Cryptography, pp. 34\u201365 (2020)","DOI":"10.1007\/978-3-030-81652-0_2"},{"key":"8_CR32","unstructured":"Kondi, Y., Magri, B., Orlandi, C., Shlomovits, O.: Refresh when you wake up: proactive threshold wallets with offline devices. Cryptol. ePrint Arch. Paper 2019\/1328 (2019). https:\/\/eprint.iacr.org\/2019\/1328"},{"key":"8_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.02.031","volume":"645","author":"B Libert","year":"2016","unstructured":"Libert, B., Joye, M., Yung, M.: Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares. Theor. Comput. Sci. 645, 1\u201324 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR34","unstructured":"Lindell, Y.: Simple three-round multiparty schnorr signing with full simulatability. IACR Cryptol. ePrint Arch. (2022). https:\/\/eprint.iacr.org\/2022\/374"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Micali, S., Ohta, K., Reyzin, L.: Accountable-subgroup multisignatures: extended abstract. In: CCS\u201901, pp. 245\u2013254. ACM (2001)","DOI":"10.1145\/501983.502017"},{"key":"8_CR36","doi-asserted-by":"publisher","unstructured":"Micali, S., Ohta, K., Reyzin, L.: Accountable-subgroup multisignatures: extended abstract. In: Reiter, M.K., Samarati, P. (eds.) ACM CCS 2001, pp. 245\u2013254. ACM Press (Nov 2001). https:\/\/doi.org\/10.1145\/501983.502017","DOI":"10.1145\/501983.502017"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Nick, J., Ruffing, T., Seurin, Y.: MuSig2: simple two-round schnorr multi-signatures. In: Advances in Cryptology \u2013 CRYPTO\u2019 21, pp. 189\u2013221 (2021)","DOI":"10.1007\/978-3-030-84242-0_8"},{"key":"8_CR38","doi-asserted-by":"publisher","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks (extended abstract). In: Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, pp. 51\u201359. PODC \u201991, Association for Computing Machinery, New York, NY, USA (1991). https:\/\/doi.org\/10.1145\/112600.112605","DOI":"10.1145\/112600.112605"},{"key":"8_CR39","doi-asserted-by":"publisher","unstructured":"Rabin, T.: A simplified approach to threshold and proactive RSA. In: Krawczyk, H. (ed.) CRYPTO\u201998. LNCS, vol.\u00a01462, pp. 89\u2013104. Springer, Heidelberg (Aug 1998). https:\/\/doi.org\/10.1007\/BFb0055722","DOI":"10.1007\/BFb0055722"},{"key":"8_CR40","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Advances in Cryptology \u2013 CRYPTO \u201989, pp. 239\u2013252 (1989)","DOI":"10.1007\/0-387-34805-0_22"},{"key":"8_CR41","unstructured":"Smith, C.: Ethereum proof of stake (2022). link"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78679-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T05:44:25Z","timestamp":1739771065000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78679-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031786785","9783031786792"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78679-2_8","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":"16 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Willemstad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cura\u00e7ao","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":"5 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc24.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}