Distributed key generation protocol with a new complaint management strategy

被引:20
作者
Neji, Wafa [1 ]
Blibech, Kaouther [2 ]
Ben Rajeb, Narjes [3 ]
机构
[1] Higher Inst Technol Studies Beja, Gen Directorate Technol Studies, Lab LIP2, Beja, Tunisia
[2] Univ Carthage, Lab LIP2, Higher Inst Environm Town Planning & Bldg Technol, Tunis, Tunisia
[3] Univ Carthage, Natl Inst Appl Sci & Technol, Lab LIP2, Tunis, Tunisia
关键词
distributed key generation (DKG); publicly verifiable secret sharing (PVSS); threshold cryptosystems; THRESHOLD SIGNATURE; SECURE; EFFICIENT; SCHEME;
D O I
10.1002/sec.1651
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A distributed key generation (DKG) protocol is a fundamental building block for many threshold cryptosystems. It allows a set of participants to jointly generate a shared secret key without using a trusted party. In 1991, Pedersen proposed the first DKG protocol called Joint-Feldman DKG. However, it was proved later that this protocol does not guarantee a uniformly random distribution of generated keys. Despite this flaw in the security requirements, Pedersen's DKG protocol has been used for several years as central component to design threshold cryptosystems. Note that most of the solutions proposed in the literature to improve the Pedersen's DKG protocol have several disadvantages. They use private channels, require participants to reveal their secret shares to solve complaints, and use costly computations. This makes them complex and not easy to use in practical situations. In this paper, we present at first an extended version of Joint-Feldman DKG that ensures a uniform distribution of the generated keys. Then we present a DKG protocol with public channels that use a new strategy to manage complaints without revealing the shares of the secrets held by honest participants and that clearly identifies dishonest participants. We prove that our solution satisfies the security requirements of DKG protocols. Copyright (C) 2016 John Wiley & Sons, Ltd.
引用
收藏
页码:4585 / 4595
页数:11
相关论文
共 21 条
[1]  
Assia BS, 2012, P 7 C NETW INF SYST
[2]  
Budurushi Jurlind, 2013, 2013 International Conference on Availability, Reliability and Security (ARES), P198, DOI 10.1109/ARES.2013.27
[3]  
Canetti R., 1999, Advances in Cryptology - CRYPTO'99. 19th Annual International Cryptology Conference. Proceedings, P98
[4]  
CERECEDO M, 1993, IEICE T FUND ELECTR, VE76A, P532
[5]  
Chaum D., 1993, Advances in Cryptology - CRYPTO '92. 12th Annual International Cryptology Conference Proceedings, P89
[6]   A secure and optimally efficient multi-authority election scheme [J].
Cramer, R ;
Gennaro, R ;
Schoenmakers, B .
EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 1997, 8 (05) :481-490
[7]  
Feldman P., 1987, 28th Annual Symposium on Foundations of Computer Science (Cat. No.87CH2471-1), P427, DOI 10.1109/SFCS.1987.4
[8]  
Fouque PA, 2001, LECT NOTES COMPUT SC, V1992, P300
[9]   A Distributed Approach of a Threshold Certificate-Based Encryption Scheme with No Trusted Entities [J].
Fournaris, Apostolos P. .
INFORMATION SECURITY JOURNAL, 2013, 22 (03) :126-139
[10]  
Gennaro R, 1999, LECT NOTES COMPUT SC, V1592, P295