Physical zero-knowledge proof for makaro

Xavier Bultel, Jannik Dreier, Jean Guillaume Dumas, Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Atsuki Nagao, Tatsuya Sasaki, Kazumasa Shinagawa, Hideaki Sone

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

28 Citations (Scopus)

Abstract

Makaro is a logic game similar to Sudoku. In Makaro, a grid has to be filled with numbers such that: given areas contain all the numbers up to the number of cells in the area, no adjacent numbers are equal and some cells provide restrictions on the largest adjacent number. We propose a proven secure physical algorithm, only relying on cards, to realize a zero-knowledge proof of knowledge for Makaro. It allows a player to show that he knows a solution without revealing it.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings
EditorsTaisuke Izumi, Petr Kuznetsov
PublisherSpringer Verlag
Pages111-125
Number of pages15
ISBN (Print)9783030032319
DOIs
Publication statusPublished - 2018
Event20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018 - Tokyo, Japan
Duration: 2018 Nov 42018 Nov 7

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11201 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018
Country/TerritoryJapan
CityTokyo
Period18/11/418/11/7

Keywords

  • Card-based secure two-party protocols
  • Makaro
  • Privacy
  • Puzzle
  • Zero-knowledge proofs

Fingerprint

Dive into the research topics of 'Physical zero-knowledge proof for makaro'. Together they form a unique fingerprint.

Cite this