A Zero-Knowledge-Proof-Based Anonymous and Revocable Scheme for Cross-Domain Authentication

Author:

Zhao Xinjian1,Xia Fei1,Xia Hanning2,Mao Yunlong2,Chen Shi1

Affiliation:

1. Information & Telecommunication Branch State Grid Jiangsu Electric Power Co., Ltd., Nanjing 210024, China

2. Computer Science and Technology Department, Nanjing University, Nanjing 210023, China

Abstract

Authentication is a crucial security service on the Internet. In real-world applications, multiple independent trust domains often exist, with each recognizing only certain identities within their own systems. During cross-domain access, users cannot directly use their original certificates, which presents a cross-domain authentication problem. Traditional centralized schemes typically employ a trusted third party (TTP) to facilitate the transfer of identity trust across domains. These schemes inevitably inherit the vulnerabilities associated with single points of failure. In contrast, blockchain-based decentralized schemes effectively eliminate the potential threats posed by TTPs. However, the openness and transparency of the blockchain also bring new security issues, such as privacy leakage. In this paper, we propose a zk-SNARK-based anonymous scheme on the blockchain for cross-domain authentication. Specifically, our scheme adopts an authorization-then-proof structure, which strikes a delicate balance between anonymity and revocability. We provide theoretical proofs for the security of our scheme and explain how it achieves proactive revocability. Experimental evaluation results demonstrated that our scheme is both secure and efficient, and the revocation could be accomplished by introducing only 64 bytes of on-chain storage with one hash comparison.

Funder

State Grid Jiangsu Electric Power Corporation Project

Publisher

MDPI AG

Reference26 articles.

1. Nakamoto, S. (2024, July 08). Bitcoin: A Peer-to-Peer Electronic Cash System. Available online: http://www.bitcoin.org/bitcoin.pdf.

2. A Next Generation Smart Contract & Decentralized Application Platform;Buterin;White Paper,2015

3. Goldwasser, S., Micali, S., and Rackoff, C. (1985, January 5–8). The knowledge complexity of interactive proof-systems. Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, New York, NY, USA.

4. Fischlin, M., and Coron, J.S. (2016, January 8–12). On the Size of Pairing-Based Non-interactive Arguments. Proceedings of the Advances in Cryptology—Eurocrypt, Vienna, Austria.

5. Polk, W., and Hastings, N. (2001, January 18–20). Bridge certification authorities: Connecting B2B public key infrastructures. Proceedings of the 16th IST Mobile and Wireless Communications Summit, West Point, NY, USA.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3