GROUP AUTHENTICATION SCHEME BASED ON ZERO-KNOWLEDGE PROOF

被引:0
作者
Shliakhtina, E. A. [1 ]
Gamayunov, D. Y. [1 ]
机构
[1] Lomonosov Moscow State Univ, Moscow, Russia
来源
PRIKLADNAYA DISKRETNAYA MATEMATIKA | 2021年 / 51期
关键词
authentication; zero-knowledge proof; decentralized communications; EFFICIENT;
D O I
10.17223/20710410/51/3
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we address the problem of mutual authentication in user groups in decentralized messaging systems without trusted third party. We propose a mutual authentication algorithm for groups using zero-knowledge proof. Using the algorithm, which is based on trust chains existing in decentralized network, users are able to authenticate each other without establishing a shared secret over side channel. The proposed algorithm is based on Democratic Group Signature protocol (DGS) and Communication-Computation Efficient Group Key algorithm for large and dynamic groups (CCEGK). We have performed security analysis of the proposed mutual authentication scheme against several attacks including Sybil attack and have made complexity estimation for the algorithm. The algorithm is implemented in an experimental P2P group messaging application, and using this implementation we estimate overhead of the authentication scheme and convergence time for several initial configurations of user groups and trust chains.
引用
收藏
页码:68 / 84
页数:17
相关论文
共 18 条
[11]  
Kim Y, 2001, INT FED INFO PROC, V65, P229
[12]  
Korosteleva M. V., 2014, PROBLEMY INFORM BEZO, P74
[13]  
Leskovec J., 2008, P 17 INT C WORLD WID, P915, DOI DOI 10.1145/1367497.1367620
[14]  
Nguen K. K, 2018, DOKAZATELSTVO S NULE
[15]   DENIABLE GROUP COMMUNICATIONS IN THE PRESENCE OF GLOBAL UNLIMITED ADVERSARY [J].
Sheidaev, V. F. ;
Gamayunov, D. Y. .
PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2018, (40) :72-86
[16]   Chord: A scalable peer-to-peer lookup service for Internet applications [J].
Stoica, I ;
Morris, R ;
Karger, D ;
Kaashoek, MF ;
Balakrishnan, H .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2001, 31 (04) :149-160
[17]  
Ugander Johan, 2011, ARXIV PREPRINT ARXIV
[18]   A communication-computation efficient group key algorithm for large and dynamic groups [J].
Zheng, Shanyu ;
Manz, David ;
Alves-Foss, Jim .
COMPUTER NETWORKS, 2007, 51 (01) :69-93