Batch Range Proof: How to Make Threshold ECDSA More Efficient

作者：Guofeng Tang, Shuai Han, Li Lin, Changzheng Wei, Ying Yan · 年份：2024 · DOI：10.1145/3658644.3670287 · 被引用次数：6 · 研究领域：Cryptography and Data Security、Complexity and Algorithms in Graphs、Privacy-Preserving Technologies in Data

With the demand of cryptocurrencies, threshold ECDSA recently regained popularity. So far, several methods have been proposed to construct threshold ECDSA, including the usage of OT and homomorphic encryptions (HE). Due to the mismatch between the plaintext space and the signature space, HE-based threshold ECDSA always requires zero-knowledge range proofs, such as Paillier and Joye-Libert (JL) encryptions. However, the overhead of range proofs constitutes a major portion of the total cost.