Physical Zero-Knowledge Proof for Nonogram Puzzles
碩士 === 國立清華大學 === 資訊工程學系 === 96 === In daily life, we may want to convince others that we know a secret, while at the same time, we do not want to let them know what the secret is. In cryptography, there is a notion of zero-knowledge proof system, in which we can apply to achieve the goal. One may w...
Main Authors: | Yu-Feng Chien, 簡裕峰 |
---|---|
Other Authors: | Wing-Kai Hon |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/64177637153735718328 |
Similar Items
-
The Study and Implementation of the Methods for Solving Nonogram Puzzles
by: Chen, Shiuan-Yi, et al.
Published: (2016) -
An Efficient Algorithm for Solving Nonogram Puzzles by Using Group-Based Fully Probing
by: LIU,YU-CHENG, et al.
Published: (2017) -
Zero-Knowledge Proofs for (N^2−1)-puzzle
by: Tung-Chueh Ko, et al.
Published: (2019) -
An Effcient Successive Line Solver for Nonogram Games
by: JIAN,HONG-AN, et al.
Published: (2019) -
A compressive sensing approach to solving nonograms
by: Lopez, Oscar Fabian
Published: (2013)