## CryptoDB

### Paper: Bandwidth-Efficient Threshold EC-DSA

Authors: Guilhem Castagnos Dario Catalano Fabien Laguillaumie Federico Savasta Ida Tucker DOI: 10.1007/978-3-030-45388-6_10 Search ePrint Search Google 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.
##### BibTeX
@article{pkc-2020-30312,
title={Bandwidth-Efficient Threshold EC-DSA},
booktitle={Public-Key Cryptography – PKC 2020},
series={Public-Key Cryptography – PKC 2020},
publisher={Springer},
volume={12111},
pages={266-296},
doi={10.1007/978-3-030-45388-6_10},
author={Guilhem Castagnos and Dario Catalano and Fabien Laguillaumie and Federico Savasta and Ida Tucker},
year=2020
}