4.7 Article

A practical solution to clone problem in anonymous information system

期刊

INFORMATION SCIENCES
卷 516, 期 -, 页码 158-191

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2019.12.014

关键词

Cloning identity; Anonymous system; Unlinkable login; Identification of clone behavior/user; Revocation of clone user's credential; Denying clone user access

资金

  1. Zhejiang Provincial Natural Science Foundation of China [LY16F010019, LQ15D010002]
  2. National Natural Science Foundation of China [61972350]
  3. National key research and development plan [2017YFB0802505]
  4. Natural Science Foundation of Ningbo [2019A610084]

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据