Fast Multiparty Threshold ECDSA with Fast Trustless Setup

被引：155
作者：
Gennaro, Rosario [1 ]
Goldfeder, Steven [2 ]
机构：
[1] CUNY, New York, NY 10021 USA
[2] Princeton Univ, Princeton, NJ 08544 USA
来源：
PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'18) | 2018年
基金：
美国国家科学基金会;
关键词：
SECURE;
D O I：
10.1145/3243734.3243859
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A threshold signature scheme enables distributed signing among n players such that any subgroup of size t + 1 can sign, whereas any group with t or fewer players cannot. While there exist previous threshold schemes for the ECDSA signature scheme, we are the first protocol that supports multiparty signatures for any t = n with an efficient dealerless key generation. Our protocol is faster than previous solutions and significantly reduces the communication complexity as well. We prove our scheme secure against malicious adversaries with a dishonest majority. We implemented our protocol, demonstrating its efficiency and suitability to be deployed in practice.
引用
收藏
页码：1179 / 1194
页数：16
相关论文
共 33 条
[1]  
Bar-Ilan J., 1989, Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, P201, DOI 10.1145/72981.72995
[2]  
Baric N., 1997, Advances in Cryptology - EUROCRYPT '97. International Conference on the Theory and Application of Cryptographic Techniques Proceedings, P480
[3]  
Boneh D., 2011, Encyclopedia of Cryptography and Security, P347, DOI [10.1007/978-1-4419-5906-5_145, DOI 10.1007/978-1-4419-5906-5_145]
[4]  
Boudot F, 2000, LECT NOTES COMPUT SC, V1807, P431
[5]  
Canetti R., 1999, Advances in Cryptology - CRYPTO'99. 19th Annual International Cryptology Conference. Proceedings, P98
[6]  
Canetti R, 1999, LECT NOTES COMPUT SC, V1592, P90
[7]  
Damgard Ivan, 2012, Security and Cryptography for Networks. Proceedings of the 8th International Conference (SCN 2012), P241, DOI 10.1007/978-3-642-32928-9_14
[8]  
Damgard Ivan., 2003, STOC, P426
[9]  
Dan Boneh, 2017, LATINCRYPT
[10]  
Di Crescenzo G, 2001, LECT NOTES COMPUT SC, V2045, P40
1234