M. Ben-or, O. Goldreich, S. Goldwasser, J. Håstad, J. Kilian et al., Everything Provable is Provable in Zero-Knowledge, CRYPTO '88, pp.37-56, 1990.
DOI : 10.1007/0-387-34799-2_4

. Marzio-de-biasi, Binary puzzle is NP-complete

M. Blum, P. Feldman, and S. Micali, Non-interactive zeroknowledge and its applications, STOC '88, pp.103-112, 1988.

Y. Chien and W. Hon, Cryptographic and physical zeroknowledge proof: From sudoku to nonogram, Fun with Algorithms, 5th International Conference, pp.102-112, 2010.

E. D. Demaine, Playing games with algorithms: Algorithmic combinatorial game theory, In Mathematical Foundations of Computer Science LNCS, vol.2136, pp.18-32, 2001.

J. Dreier, H. Jonker, and P. Lafourcade, Secure Auctions without Cryptography, Fun with Algorithms, 7th International Conference, pp.158-170, 2014.
DOI : 10.1007/978-3-319-07890-8_14
URL : https://hal.archives-ouvertes.fr/hal-01337414

O. Goldreich and A. Kahan, How To Construct Constant-Round Zero-Knowledge Proof Systems for NP, Journal of Cryptology, vol.9, issue.3, pp.167-189, 1991.
DOI : 10.1007/s001459900010

S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof-systems, STOC '85, pp.291-304, 1985.

R. Gradwohl, M. Naor, B. Pinkas, and G. N. Rothblum, Cryptographic and physical zero-knowledge proof systems for solutions of sudoku puzzles, Fun with Algorithms, 4th International Conference, pp.166-182, 2007.

K. Haraguchi and H. Ono, BlockSum is NP-Complete, IEICE Transactions on Information and Systems, vol.96, issue.3, pp.96-481, 2013.
DOI : 10.1587/transinf.E96.D.481

K. Haraguchi and H. Ono, How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately, Journal of Information Processing, vol.23, issue.3, pp.276-283, 2015.
DOI : 10.2197/ipsjjip.23.276

G. Kendall, A. J. Parkes, and K. Spoerer, A survey of NP-complete puzzles, ICGA Journal, vol.31, issue.1, pp.13-34, 2008.

J. I. Kölker, Efficient Multiparty Computation, Formulaic Secret Sharing and NP-Complete Puzzles, 2005.

A. J. Menezes, S. A. Vanstone, and P. C. Van-oorschot, Handbook of Applied Cryptography, 1996.
DOI : 10.1201/9781439821916

T. Mizuki and H. Shizuya, Practical Card-Based Cryptography, Fun with Algorithms, 7th International Conference, pp.313-324, 2014.
DOI : 10.1007/978-3-319-07890-8_27

M. Naor, Y. Naor, and O. Reingold, Applied kid cryptography or how to convince your children you are not cheating, Eurocrypt'94, pp.1-12, 1999.

J. Quisquater, M. Quisquater, M. Quisquater, M. Quisquater, L. Guillou et al., How to Explain Zero-Knowledge Protocols to Your Children, CRYPTO '89, pp.628-631, 1990.
DOI : 10.1007/0-387-34805-0_60

J. Barkley-rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois Journal of Mathematics, vol.6, pp.64-94, 1962.

D. Shasha, Upstart puzzles, Communications of the ACM, vol.57, issue.11, pp.120-120, 2014.
DOI : 10.1145/2670917

W. Shortz, Easy Kakuro: 100 Addictive Logic Puzzles. St. Martin's Griffin, 2006.

S. Takahiro, The complexities of puzzles, cross sum and their another solution problems(asp) Master's thesis, 2001.

P. Hadi, U. , and R. Pellikaan, Binary puzzles as an erasure decoding problem, Proceedings of the 36th WIC Symposium on Information Theory in the Benelux, pp.129-134, 2015.