验证第一个非零项:ABC 的物理 ZKPs End View、Goishi Hiroi 和 Toichika

IF 0.9 4区 数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Journal of Combinatorial Optimization Pub Date : 2024-05-05 DOI:10.1007/s10878-024-01170-6
Suthee Ruangwises
{"title":"验证第一个非零项:ABC 的物理 ZKPs End View、Goishi Hiroi 和 Toichika","authors":"Suthee Ruangwises","doi":"10.1007/s10878-024-01170-6","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we propose a physical protocol to verify the first nonzero term of a sequence using a deck of cards. The protocol lets a prover show the value of the first nonzero term of a given sequence to a verifier without revealing which term it is. Our protocol uses <span>\\(\\varTheta (1)\\)</span> shuffles, which is asymptotically lower than that of an existing protocol of Fukusawa and Manabe which uses <span>\\(\\varTheta (n)\\)</span> shuffles, where <i>n</i> is the length of the sequence. We also apply our protocol to construct zero-knowledge proof protocols for three well-known logic puzzles: ABC End View, Goishi Hiroi, and Toichika. These protocols enable a prover to physically show that he/she know solutions of the puzzles without revealing them.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"26 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Verifying the first nonzero term: physical ZKPs for ABC End View, Goishi Hiroi, and Toichika\",\"authors\":\"Suthee Ruangwises\",\"doi\":\"10.1007/s10878-024-01170-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we propose a physical protocol to verify the first nonzero term of a sequence using a deck of cards. The protocol lets a prover show the value of the first nonzero term of a given sequence to a verifier without revealing which term it is. Our protocol uses <span>\\\\(\\\\varTheta (1)\\\\)</span> shuffles, which is asymptotically lower than that of an existing protocol of Fukusawa and Manabe which uses <span>\\\\(\\\\varTheta (n)\\\\)</span> shuffles, where <i>n</i> is the length of the sequence. We also apply our protocol to construct zero-knowledge proof protocols for three well-known logic puzzles: ABC End View, Goishi Hiroi, and Toichika. These protocols enable a prover to physically show that he/she know solutions of the puzzles without revealing them.</p>\",\"PeriodicalId\":50231,\"journal\":{\"name\":\"Journal of Combinatorial Optimization\",\"volume\":\"26 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-05-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10878-024-01170-6\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-024-01170-6","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们提出了一种使用扑克牌验证序列第一个非零项的物理协议。该协议可以让验证者向验证者展示给定序列的第一个非零项的值,而无需透露它是哪个项。我们的协议使用了 \(\varTheta (1)\) 次洗牌,这比福泽(Fukusawa)和真锅(Manabe)的现有协议使用 \(\varTheta (n)\) 次洗牌的次数要少,其中 n 是序列的长度。我们还应用我们的协议为三个著名的逻辑谜题构建了零知识证明协议:ABC End View、Goishi Hiroi 和 Toichika。通过这些协议,证明者可以在不透露谜题解的情况下物理证明他/她知道谜题的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Verifying the first nonzero term: physical ZKPs for ABC End View, Goishi Hiroi, and Toichika

In this paper, we propose a physical protocol to verify the first nonzero term of a sequence using a deck of cards. The protocol lets a prover show the value of the first nonzero term of a given sequence to a verifier without revealing which term it is. Our protocol uses \(\varTheta (1)\) shuffles, which is asymptotically lower than that of an existing protocol of Fukusawa and Manabe which uses \(\varTheta (n)\) shuffles, where n is the length of the sequence. We also apply our protocol to construct zero-knowledge proof protocols for three well-known logic puzzles: ABC End View, Goishi Hiroi, and Toichika. These protocols enable a prover to physically show that he/she know solutions of the puzzles without revealing them.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization 数学-计算机:跨学科应用
CiteScore
2.00
自引率
10.00%
发文量
83
审稿时长
6 months
期刊介绍: The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
期刊最新文献
Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity A novel arctic fox survival strategy inspired optimization algorithm Dynamic time window based full-view coverage maximization in CSNs Different due-window assignment scheduling with deterioration effects An upper bound for neighbor-connectivity of graphs
×
引用
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