Skip to Main content Skip to Navigation
Conference papers

Bandwidth-Efficient Threshold EC-DSA

Guilhem Castagnos 1 Dario Catalano 2 Fabien Laguillaumie 3 Federico Savasta 2, 4 Ida Tucker 3
1 LFANT - Lithe and fast algorithmic number theory
IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
3 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Threshold Signatures allow n parties to share the power of issuing digital signatures so that any coalition of size at least t+1 can sign, whereas groups of t or less players cannot. Over the last few years many schemes addressed the question of realizing efficient threshold variants for the specific case of EC-DSA signatures. In this paper we present new solutions to the problem that aim at reducing the overall bandwidth consumption. Our main contribution is a new variant of the Gennaro and Goldfeder protocol from ACM CCS 2018 that avoids all the required range proofs, while retaining provable security against malicious adversaries in the dishonest majority setting. Our experiments show that-for all levels of security-our signing protocol reduces the bandwidth consumption of best previously known secure protocols for factors varying between 4.4 and 9, while key generation is consistently two times less expensive. Furthermore compared to these same protocols, our signature generation is faster for 192-bits of security and beyond.
Document type :
Conference papers
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download
Contributor : Guilhem Castagnos Connect in order to contact the contributor
Submitted on : Monday, September 21, 2020 - 5:10:45 PM
Last modification on : Saturday, December 4, 2021 - 3:43:57 AM
Long-term archiving on: : Thursday, December 3, 2020 - 3:21:21 PM


Files produced by the author(s)




Guilhem Castagnos, Dario Catalano, Fabien Laguillaumie, Federico Savasta, Ida Tucker. Bandwidth-Efficient Threshold EC-DSA. PKC 2020 - 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Jun 2020, Edinburgh / Virtual, United Kingdom. pp.266-296, ⟨10.1007/978-3-030-45388-6_10⟩. ⟨hal-02944825⟩



Les métriques sont temporairement indisponibles