Interactive Physical Zero-Knowledge Proof for Norinori
Norinori is a logic game similar to Sudoku. In Norinori, a grid of cells has to be filled with either black or white cells so that the given areas contain exactly two black cells, and every black cell shares an edge with exactly one other black cell. We propose a secure interactive physical algorith...
Saved in:
Published in | Computing and Combinatorics pp. 166 - 177 |
---|---|
Main Authors | , , , , , |
Format | Book Chapter |
Language | English |
Published |
Cham
Springer International Publishing
01.01.2019
|
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Norinori is a logic game similar to Sudoku. In Norinori, a grid of cells has to be filled with either black or white cells so that the given areas contain exactly two black cells, and every black cell shares an edge with exactly one other black cell. We propose a secure interactive physical algorithm, relying only on cards, to realize a zero-knowledge proof of knowledge for Norinori. It allows a player to show that he or she knows a solution without revealing it. For this, we show in particular that it is possible to physically prove that a particular element is present in a list, without revealing any other value in the list, and without revealing the actual position of that element in the list. |
---|---|
ISBN: | 9783030261757 3030261751 |
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/978-3-030-26176-4_14 |