Interactive Physical Zero-Knowledge Proof for Norinori

26Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Dumas, J. G., Lafourcade, P., Miyahara, D., Mizuki, T., Sasaki, T., & Sone, H. (2019). Interactive Physical Zero-Knowledge Proof for Norinori. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11653 LNCS, pp. 166–177). Springer Verlag. https://doi.org/10.1007/978-3-030-26176-4_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free