{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T07:17:45Z","timestamp":1760426265446,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":34,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819780129"},{"type":"electronic","value":"9789819780136"}],"license":[{"start":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T00:00:00Z","timestamp":1727827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T00:00:00Z","timestamp":1727827200000},"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-981-97-8013-6_11","type":"book-chapter","created":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T09:02:02Z","timestamp":1727859722000},"page":"239-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Mithril: Stake-Based Threshold Multisignatures"],"prefix":"10.1007","author":[{"given":"Pyrros","family":"Chaidos","sequence":"first","affiliation":[]},{"given":"Aggelos","family":"Kiayias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,2]]},"reference":[{"key":"11_CR1","unstructured":"Agrawal, S., Neu, J., Tas, E.N., Zindros, D.: Proofs of proof-of-stake with sublinear complexity. In: Bonneau, J., Weinberg, S.M. (eds.) Advances in Financial Technologies (AFT 2023), pp. 14:1\u201314:24. Schloss Dagstuhl (2023)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Baldimtsi, F., Madathil, V., Scafuro, A., Zhou, L.: Anonymous lottery in the proof-of-stake setting. In: CSF (2020)","DOI":"10.1109\/CSF49147.2020.00030"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Garay, J.A., Rabin, T.: Fast batch verification for modular exponentiation and digital signatures. In: EUROCRYPT (1998)","DOI":"10.1007\/BFb0054130"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Hamburg, M., Krasnova, A., Lange, T.: Elligator: elliptic-curve points indistinguishable from uniform random strings. In: CCS (2013)","DOI":"10.1145\/2508859.2516734"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Drijvers, M., Neven, G.: Compact multi-signatures for smaller blockchains. In: ASIACRYPT (2018)","DOI":"10.1007\/978-3-030-03329-3_15"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: ASIACRYPT (2001)","DOI":"10.1007\/3-540-45682-1_30"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: BulletProofs: short proofs for confidential transactions and more. In: Security and Privacy (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Kiffer, L., Luu, L., Zamani, M.: FlyClient: super-light clients for cryptocurrencies. In: Security and Privacy (2020)","DOI":"10.1109\/SP40000.2020.00049"},{"key":"11_CR9","unstructured":"Chaidos, P., Kiayias, A.: Mithril: Stake-based threshold multisignatures. Cryptology ePrint Archive, Paper 2021\/916 (2021). https:\/\/eprint.iacr.org\/2021\/916"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Chaidos, P., Kiayias, A., Reyzin, L., Zinovyev, A.: Approximate lower bound arguments. In: EUROCRYPT, pp. 55\u201384. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58737-5","DOI":"10.1007\/978-3-031-58737-5"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Chen, J., Micali, S.: Algorand: a secure and efficient distributed ledger. Theor. Comput. Sci. 777, 155\u2013183 (2019)","DOI":"10.1016\/j.tcs.2019.02.001"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","year":"2021","unstructured":"Malkin, T., Peikert, C. (eds.): CRYPTO 2021. LNCS, vol. 12826. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Danezis, G., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A.: Narwhal and tusk: a DAG-based Mempool and efficient BFT consensus. In: EuroSys (2022)","DOI":"10.1145\/3492321.3519594"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Das, S., Camacho, P., Xiang, Z., Nieto, J., B\u00fcnz, B., Ren, L.: Threshold signatures from inner product argument: succinct, weighted, and multi-threshold. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 356\u2013370 (2023)","DOI":"10.1145\/3576915.3623096"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-78375-8_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B David","year":"2018","unstructured":"David, B., Ga\u017ei, P., Kiayias, A., Russell, A.: Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 66\u201398. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_3"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Public Key Cryptography (2005)","DOI":"10.1007\/978-3-540-30580-4_28"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Hirt, M.: Optimally efficient multi-valued byzantine agreement. In: PODC (2006)","DOI":"10.1145\/1146381.1146407"},{"key":"11_CR18","unstructured":"Gabizon, A., et al.: Plumo: towards scalable interoperable blockchains using ultra light validation systems (2020)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Ganesh, C., Orlandi, C., Tschudi, D.: Proof-of-stake protocols for privacy-aware blockchains. In: EUROCRYPT (2019)","DOI":"10.1007\/978-3-030-17653-2_23"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Garg, S., Jain, A., Mukherjee, P., Sinha, R., Wang, M., Zhang, Y.: hinTS: threshold signatures with silent setup. In: 2024 IEEE Symposium on Security and Privacy (SP), pp. 57\u201357. IEEE Computer Society (2023)","DOI":"10.1109\/SP54263.2024.00057"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Ga\u017ei, P., Kiayias, A., Zindros, D.: Proof-of-stake sidechains. In: Security and Privacy (2019)","DOI":"10.1109\/SP.2019.00040"},{"key":"11_CR22","unstructured":"Goldwasser, S., Ostrovsky, R.: Invariant signatures and non-interactive zero-knowledge proofs are equivalent. In: CRYPTO (1992)"},{"key":"11_CR23","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: Poseidon: a new hash function for zero-knowledge proof systems. In: USENIX Security (2021)"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Kerber, T., Kiayias, A., Kohlweiss, M., Zikas, V.: Ouroboros crypsinous: privacy-preserving proof-of-stake. In: Security and Privacy (2019)","DOI":"10.1109\/SP.2019.00063"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-030-51280-4_27","volume-title":"Financial Cryptography and Data Security","author":"A Kiayias","year":"2020","unstructured":"Kiayias, A., Miller, A., Zindros, D.: Non-interactive proofs of proof-of-work. In: Bonneau, J., Heninger, N. (eds.) FC 2020. LNCS, vol. 12059, pp. 505\u2013522. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51280-4_27"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-63688-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"A Kiayias","year":"2017","unstructured":"Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: a provably secure proof-of-stake blockchain protocol. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 357\u2013388. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_12"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Leung, D., Suhl, A., Gilad, Y., Zeldovich, N.: Vault: fast bootstrapping for the algorand cryptocurrency. In: NDSS (2019)","DOI":"10.14722\/ndss.2019.23313"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45708-9_38","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"A Lysyanskaya","year":"2002","unstructured":"Lysyanskaya, A.: Unique signatures and verifiable random functions from the DH-DDH separation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 597\u2013612. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_38"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Micali, S., Reyzin, L., Vlachos, G., Wahby, R.S., Zeldovich, N.: Compact certificates of collective knowledge. In: Security and Privacy (2021)","DOI":"10.1109\/SP40001.2021.00096"},{"key":"11_CR30","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system. Tech. rep. (2008)"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Ristenpart, T., Yilek, S.: The power of proofs-of-possession: Securing multiparty signatures against rogue-key attacks. In: EUROCRYPT (2007)","DOI":"10.1007\/978-3-540-72540-4_13"},{"key":"11_CR32","unstructured":"Smith, C., Beckett, A., Wackerow, P., AlehN: Data availability. https:\/\/ethereum.org\/en\/developers\/docs\/data-availability\/"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Spiegelman, N.G., Giridharan, N., Sonnino, A., Kokoris-Kogias, L.: Bullshark: DAG BFT protocols made practical. CCS (2022)","DOI":"10.1145\/3548606.3559361"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Tibouchi, M.: Elligator squared: uniform points on elliptic curves of prime order as uniform random strings. In: Financial Cryptography (2014)","DOI":"10.1007\/978-3-662-45472-5_10"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-8013-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T00:06:41Z","timestamp":1732838801000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-8013-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,2]]},"ISBN":["9789819780129","9789819780136"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-8013-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,2]]},"assertion":[{"value":"2 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"24 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.cansconference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}