Efficient card-based zero-knowledge proof for Sudoku
In 2009, Gradwohl, Naor, Pinkas, and Rothblum proposed physical zero-knowledge proof protocols for Sudoku. That is, for a puzzle instance of Sudoku, their excellent protocols allow a prover to convince a verifier that there is a solution to the Sudoku puzzle and the prover knows it, without revealin...
Saved in:
Published in | Theoretical computer science Vol. 839; pp. 135 - 142 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
02.11.2020
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!