A practical solution to clone problem in anonymous information system

被引:4
|
作者
Lian, Bin [1 ]
Chen, Gongliang [2 ]
Wang, Lang [1 ]
Cui, Jialin [1 ]
Yu, Ping [1 ]
He, Dake [3 ]
机构
[1] Zhejiang Univ, Ningbo Inst Technol, Ningbo, Peoples R China
[2] Shanghai Jiao Tong Univ, Sch Informat Secur Engn, Shanghai, Peoples R China
[3] Southwest Jiaotong Univ, Sch Informat Sci & Technol, Chengdu, Peoples R China
基金
中国国家自然科学基金;
关键词
Cloning identity; Anonymous system; Unlinkable login; Identification of clone behavior/user; Revocation of clone user's credential; Denying clone user access; EFFICIENT REVOCATION; SHORT SIGNATURES; E-CASH; AUTHENTICATION; KNOWLEDGE; PROTOCOLS; PROOFS;
D O I
10.1016/j.ins.2019.12.014
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cloning users identity is always a thorny problem for an information system, especially for an anonymous system. With the development of big data applications, clone behaviors sometimes even become attacks on these systems. But until now, there has been no very satisfactory anti-clone scheme in the anonymous system. After analyzing the problems in existing anti-clone schemes, without any assumptions about physical security, we provide a practical solution to the clone problem in anonymous authentication system. In our scheme, the authentication is not only related to user's private key, but also related to user's current state, which is constantly updated by the system. Therefore, the authentication trajectories of user and clone will inevitably overlap, and it results in information leakage so as to indentify clone behaviors and revoke clone user's credential. Meanwhile, we prove that honest users are truly anonymous and their login behaviors are unlinkable with complete security proofs. According to the analysis of the system function and the system efficiency, our scheme is much more efficient and has the best anti-clone properties comparing with the existing schemes. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页码:158 / 191
页数:34
相关论文
共 50 条