A Blockchain-Based Privacy-Awareness Authentication Scheme With Efficient Revocation for Multi-Server Architectures

被引:25
作者
Xiong, Ling [1 ,2 ]
Li, Fagen [2 ]
Zeng, Shengke [1 ,2 ]
Peng, Tu [3 ]
Liu, Zhicai [1 ]
机构
[1] Xihua Univ, Sch Comp & Software Engn, Chengdu 610039, Sichuan, Peoples R China
[2] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Chengdu 611731, Sichuan, Peoples R China
[3] Beijing Inst Technol, Sch Software, Beijing 100081, Peoples R China
基金
美国国家科学基金会;
关键词
Blockchain; multi-server; authentication; revocation; CERTIFIED PUBLIC KEYS; USER AUTHENTICATION; PASSWORD AUTHENTICATION; SECURE; AGREEMENT;
D O I
10.1109/ACCESS.2019.2939368
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multi-server authentication technology has become more and more popular with the extensive applications of networks. Although it has brought great convenience to people's life, security becomes a critical issue and attracts lots of attentions in both academia and industry. Over the past two decades, a series of multi-server authentication schemes without communication with the online registration center in each authentication phase using the self-certified public key cryptography have been proposed to enhance security. However, it may cause the single-point failure problem due to the centralized architecture. Besides, user revocation facility is not well resolved in these schemes. To the best of our knowledge, blockchain technology has lots of advantages, bringing a promising solution to the problems of single-point failure and user revocation compared with the traditional cryptography technologies. In this work, we apply the idea of blockchain technology to construct a privacy-awareness authentication scheme for the multi-server environment, which can achieve distributed registry and efficient revocation. Moreover, the proposed scheme not only provides multiple security requirements like mutual authentication, user anonymity and perfect forward secrecy, but also resists various kinds of malicious attacks. The security of the proposed scheme is proved by rigorous formal proof using the random oracle model. Compared with recently related schemes, the proposed scheme has better communication performance, which make it be very suitable for real-life applications.
引用
收藏
页码:125840 / 125853
页数:14
相关论文
共 57 条
[1]  
[Anonymous], 2017, SECRYPT
[2]  
[Anonymous], 2007, Applied cryptography: protocols, algorithms
[3]  
Axon L., 2015, CDT TECH PAPER SER
[4]  
Bellare M, 2000, LECT NOTES COMPUT SC, V1807, P139
[5]  
Bellare M., 1993, P ANN INT CRYPT C, P232, DOI DOI 10.1007/3-540-48329-2_21
[6]   Cryptocurrencies Without Proof of Work [J].
Bentov, Iddo ;
Gabizon, Ariel ;
Mizrahi, Alex .
FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, FC 2016, 2016, 9604 :142-157
[7]  
Bo Q., FUTURE GENER COMPUT
[8]  
Boldyreva A, 2008, CCS'08: PROCEEDINGS OF THE 15TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P417
[9]  
Buterin V., 2013, Github Repository, V1, P22
[10]  
Canetti R, 2001, LECT NOTES COMPUT SC, V2045, P453