New Complex Sinusoidal Waveform-Based Zero-Knowledge Proof Systems for Efficient Anonymous Authentication

IF 8.6 1区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS IEEE Transactions on Systems Man Cybernetics-Systems Pub Date : 2024-09-30 DOI:10.1109/TSMC.2024.3460801
Youhyun Kim;Ongee Jeong;Kevin Choi;Inkyu Moon;Bahram Javidi
{"title":"New Complex Sinusoidal Waveform-Based Zero-Knowledge Proof Systems for Efficient Anonymous Authentication","authors":"Youhyun Kim;Ongee Jeong;Kevin Choi;Inkyu Moon;Bahram Javidi","doi":"10.1109/TSMC.2024.3460801","DOIUrl":null,"url":null,"abstract":"Zero-knowledge proof systems based on Feige-Fiat–Shamir (FFS) protocol are an interactive protocol between two anonymous authentication parties. However, they require heavy computations because of many iterations for reducing the probability that an attacker can trick a remote server. The algorithm’s time complexity rapidly increases with the total number of the challenge values, which should be unpredictable. Hence, the FFS protocol is not suitable for practical zero-knowledge proof systems. In this study, we propose new zero-knowledge proof systems based on phase mask generation that are complex sinusoidal waveform versions of the FFS algorithm for efficient anonymous authentication in the diverse interactive systems. The proposed anonymous authentication schemes need a single iteration only, allowing for efficient uses of a random challenge mask with large bit-depth. The proposed schemes allow the verifier to verify that the prover knows the secret mask, such as binary pattern, visual image, or hologram, which are the prover’s secrets, without revealing any information about it to anyone else, including the verifier. Various numerical simulations demonstrate the proposed schemes’ feasibility and robustness.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"54 12","pages":"7710-7720"},"PeriodicalIF":8.6000,"publicationDate":"2024-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Systems Man Cybernetics-Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10697935/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Zero-knowledge proof systems based on Feige-Fiat–Shamir (FFS) protocol are an interactive protocol between two anonymous authentication parties. However, they require heavy computations because of many iterations for reducing the probability that an attacker can trick a remote server. The algorithm’s time complexity rapidly increases with the total number of the challenge values, which should be unpredictable. Hence, the FFS protocol is not suitable for practical zero-knowledge proof systems. In this study, we propose new zero-knowledge proof systems based on phase mask generation that are complex sinusoidal waveform versions of the FFS algorithm for efficient anonymous authentication in the diverse interactive systems. The proposed anonymous authentication schemes need a single iteration only, allowing for efficient uses of a random challenge mask with large bit-depth. The proposed schemes allow the verifier to verify that the prover knows the secret mask, such as binary pattern, visual image, or hologram, which are the prover’s secrets, without revealing any information about it to anyone else, including the verifier. Various numerical simulations demonstrate the proposed schemes’ feasibility and robustness.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用于高效匿名身份验证的基于复杂正弦波形的新型零知识证明系统
基于费格-菲亚特-沙米尔(FFS)协议的零知识证明系统是两个匿名验证方之间的交互式协议。然而,由于需要多次迭代以降低攻击者欺骗远程服务器的概率,因此需要大量计算。该算法的时间复杂度随着挑战值总数的增加而迅速增加,而挑战值是不可预测的。因此,FFS 协议并不适用于实际的零知识证明系统。在本研究中,我们提出了基于相位掩码生成的新型零知识证明系统,该系统是 FFS 算法的复正弦波版本,可用于多样化交互系统中的高效匿名身份验证。所提出的匿名验证方案只需要一次迭代,从而可以高效地使用大位深度的随机挑战掩码。所提出的方案允许验证者验证证明者是否知道秘密掩码,如二进制图案、可视图像或全息图,这些都是证明者的秘密,而不会向包括验证者在内的其他人透露任何相关信息。各种数值模拟证明了建议方案的可行性和稳健性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Systems Man Cybernetics-Systems
IEEE Transactions on Systems Man Cybernetics-Systems AUTOMATION & CONTROL SYSTEMS-COMPUTER SCIENCE, CYBERNETICS
CiteScore
18.50
自引率
11.50%
发文量
812
审稿时长
6 months
期刊介绍: The IEEE Transactions on Systems, Man, and Cybernetics: Systems encompasses the fields of systems engineering, covering issue formulation, analysis, and modeling throughout the systems engineering lifecycle phases. It addresses decision-making, issue interpretation, systems management, processes, and various methods such as optimization, modeling, and simulation in the development and deployment of large systems.
期刊最新文献
Table of Contents Table of Contents Introducing IEEE Collabratec Information For Authors IEEE Transactions on Systems, Man, and Cybernetics publication information
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1