Back to Search Start Over

Interactive Physical ZKP for Connectivity: Applications to Nurikabe and Hitori

Authors :
Léo Robert
Daiki Miyahara
pascal lafourcade
Takaaki Mizuki
Robert, Léo
Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS)
Ecole Nationale Supérieure des Mines de St Etienne-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne)
Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA)
Graduate School of Information Sciences [Sendaï]
Tohoku University [Sendai]
National Institute of Advanced Industrial Science and Technology (AIST)
Cyberscience Center, Tohoku University
Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne)
Source :
CiE, CiE, Jul 2021, à distance, Belgium, HAL, Computability in Europe Conference (CiE), Computability in Europe Conference (CiE), Jul 2021, à distance, Belgium

Abstract

International audience; During the last years, many Physical Zero-knowledge Proof (ZKP) protocols for Nikoli's puzzles ‡ have been designed. In this paper, we propose two ZKP protocols for the two Nikoli's puzzles called Nurikabe and Hitori. These two puzzles have some similarities, since in their rules at least one condition requires that some cells are connected to each other, horizontally or vertically. The novelty in this paper is to propose two techniques that allow us to prove such connectivity without leaking any information about a solution.

Details

Language :
English
Database :
OpenAIRE
Journal :
CiE, CiE, Jul 2021, à distance, Belgium, HAL, Computability in Europe Conference (CiE), Computability in Europe Conference (CiE), Jul 2021, à distance, Belgium
Accession number :
edsair.dedup.wf.001..0925e53c4a77fa7427942bab6b292828