M. Biro and C. Schmidt, Computational complexity and bounds for Norinori and LITS, Proceedings of the 33rd European Workshop on Computational Geometry, pp.29-32, 2017.

X. Bultel, J. Dreier, J. G. Dumas, and P. Lafourcade, Physical zero-knowledge proofs for Akari, Takuzu, Kakuro and KenKen, 8th International Conference on Fun with Algorithms, FUN 2016, vol.49, p.20, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01326059

X. Bultel, J. Dreier, J. Dumas, P. Lafourcade, D. Miyahara et al., Physical zero-knowledge proof for Makaro, Stabilization, Safety, and Security of Distributed Systems -20th International Symposium, pp.111-125, 2018.
DOI : 10.1007/978-3-030-03232-6_8
URL : https://hal.archives-ouvertes.fr/hal-01898048

Y. F. Chien and W. K. Hon, Cryptographic and physical zero-knowledge proof: From Sudoku to Nonogram, Fun with Algorithms, 5th International Conference, FUN 2010, vol.6099, pp.102-112, 2010.
DOI : 10.1007/978-3-642-13122-6_12

E. D. Demaine, Playing games with algorithms: Algorithmic combinatorial game theory, Mathematical Foundations of Computer Science, vol.2136, pp.18-32, 2001.
DOI : 10.1007/3-540-44683-4_3
URL : http://arxiv.org/pdf/cs/0106019

O. Goldreich, S. Micali, and A. Wigderson, How to prove all NP-Statements in zero-knowledge, and a methodology of cryptographic protocol design, Advances in Cryptology -CRYPTO '86, vol.263, pp.171-185

. Springer, , 1987.

R. Gradwohl, M. Naor, B. Pinkas, and G. N. Rothblum, Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles, Proceedings. Lecture Notes in Computer Science, vol.4475, pp.166-182, 2007.

R. Ishikawa, E. Chida, and T. Mizuki, Efficient card-based protocols for generating a hidden random permutation without fixed points, Unconventional Computation and Natural Computation -14th International Conference, vol.9252, pp.215-226, 2015.
DOI : 10.1007/978-3-319-21819-9_16

H. Ito, S. Leonardi, and L. Pagli, 9th International Conference on Fun with Algorithms, FUN 2018, vol.100, 2018.

C. Iwamoto, M. Haruishi, T. Ibusuki, and . Ito, Herugolf and Makaro are NP-complete, vol.24, p.11

G. Kendall, A. J. Parkes, and K. Spoerer, A survey of NP-complete puzzles, ICGA Journal, vol.31, issue.1, pp.13-34, 2008.
DOI : 10.3233/icg-2008-31103
URL : http://www.cs.nott.ac.uk/~gxk/papers/icga2008_preprint.pdf

A. Koch and S. Walzer, Foundations for actively secure card-based cryptography. IACR Cryptology ePrint Archive, vol.423, 2017.

:. Nikoli and . Norinori,

A. Nishimura, Y. Hayashi, T. Mizuki, and H. Sone, Pile-shifting scramble for cardbased protocols, IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, vol.101, issue.9, pp.1494-1502, 2018.

T. Sasaki, T. Mizuki, H. Sone, and . Ito, Card-based zero-knowledge proof for Sudoku, vol.29, pp.1-29