Publisher
Springer Science and Business Media LLC
Reference34 articles.
1. Andersson D (2007) HIROIMONO is NP-complete. In: Proceedings of the 4th international conference on fun with algorithms (FUN), pp 30–39
2. Bultel X, Dreier J, Dumas J-G, Lafourcade P (2016) Physical zero-knowledge proofs for Akari, Takuzu, Kakuro and KenKen. In: Proceedings of the 8th international conference on fun with algorithms (FUN), pp 8:1–8:20
3. Bultel X, Dreier J, Dumas J-G, Lafourcade P, Miyahara D, Mizuki T, Nagao A, Sasaki T, Shinagawa K, Sone H (2018) Physical zero-knowledge proof for Makaro. In: Proceedings of the 20th international symposium on stabilization, safety, and security of distributed systems (SSS), pp 111–125
4. Chien Y-F, Hon W-K (2010) Cryptographic and physical zero-knowledge proof: from sudoku to nonogram. In: Proceedings of the 5th international conference on fun with algorithms (FUN), pp 102–112
5. Dumas J-G, Lafourcade P, Miyahara D, Mizuki T, Sasaki T, Sone H (2019) Interactive physical zero-knowledge proof for Norinori. In: Proceedings of the 25th international computing and combinatorics conference (COCOON), pp 166–177
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献