{"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}
引用次数: 0
Abstract
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.
期刊介绍:
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.