TY - GEN
T1 - Hide a Liar
T2 - 17th Annual Conference on Theory and Applications of Models of Computation, TAMC 2022
AU - Robert, Léo
AU - Miyahara, Daiki
AU - Lafourcade, Pascal
AU - Mizuki, Takaaki
N1 - Funding Information:
Acknowledgements. We thank the anonymous referees, whose comments have helped us to improve the presentation of the paper. This work was supported in part by JSPS KAKENHI Grant Numbers JP21K11881 and JP18H05289. This study was partially supported by the French ANR project ANR-18-CE39-0019 (MobiS5). Other programs also fund to write this paper, namely the French government research program “Investissements d′Avenir” through the IDEX-ISITE initiative 16-IDEX-0001 (CAP 20-25) and the IMobS3 Laboratory of Excellence (ANR-10-LABX-16-01). Finally, the French ANR project DECRYPT (ANR-18-CE39-0007) and SEVERITAS (ANR-20-CE39-0009) also subsidize this work.
Publisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2022
Y1 - 2022
N2 - A Zero-Knowledge Proof (ZKP) protocol allows a participant to prove the knowledge of some secret without revealing any information about it. While such protocols are typically executed by computers, there exists a line of research proposing physical instances of ZKP protocols. Up to now, many card-based ZKP protocols for pen-and-pencil puzzles, like Sudoku, have been designed. Those games, mostly edited by Nikoli, have simple rules, yet designing them in card-based ZKP protocols is non-trivial. This is partly due to the fact that the solution should not be leaked during the protocol. In this work, we propose a card-based protocol for Usowan, a Nikoli game. In Usowan, for each room of a puzzle instance, there is exactly one piece of false information. The goal of the game is to detect this wrong data amongst the correct data and also to satisfy the other rules. Designing a card-based ZKP protocol to deal with the property of detecting a liar has never been done. In some sense, we propose a physical ZKP for hiding of a liar.
AB - A Zero-Knowledge Proof (ZKP) protocol allows a participant to prove the knowledge of some secret without revealing any information about it. While such protocols are typically executed by computers, there exists a line of research proposing physical instances of ZKP protocols. Up to now, many card-based ZKP protocols for pen-and-pencil puzzles, like Sudoku, have been designed. Those games, mostly edited by Nikoli, have simple rules, yet designing them in card-based ZKP protocols is non-trivial. This is partly due to the fact that the solution should not be leaked during the protocol. In this work, we propose a card-based protocol for Usowan, a Nikoli game. In Usowan, for each room of a puzzle instance, there is exactly one piece of false information. The goal of the game is to detect this wrong data amongst the correct data and also to satisfy the other rules. Designing a card-based ZKP protocol to deal with the property of detecting a liar has never been done. In some sense, we propose a physical ZKP for hiding of a liar.
KW - Card-based cryptography
KW - Pencil puzzle
KW - Usowan
KW - Zero-knowledge proof
UR - http://www.scopus.com/inward/record.url?scp=85147852116&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85147852116&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-20350-3_17
DO - 10.1007/978-3-031-20350-3_17
M3 - Conference contribution
AN - SCOPUS:85147852116
SN - 9783031203497
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 201
EP - 217
BT - Theory and Applications of Models of Computation - 17th Annual Conference, TAMC 2022, Proceedings
A2 - Du, Ding-Zhu
A2 - Du, Donglei
A2 - Wu, Chenchen
A2 - Xu, Dachuan
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 16 September 2022 through 18 September 2022
ER -