This survey presents an overview and a comparative analysis of the state of art in post-quantum identification schemes based on lattices. Furthermore, we propose an adaptation of the HB family of identification in a lattice context. The aspects taken into account in such comparison are performance, security, communication costs, underlying hard-problem, completeness, soundness, and key sizes.7903/04/15729748Blum, A., Kalai, A., Wasserman, H., Noise-tolerant learning, the parity problem, and the statistical query model (2003) J. ACM, 50 (4), pp. 506-519Cayrel, P.-L., Lindner, R., Rückert, M., Silva, R., Improved zero-knowledge identification with lattices (2010) ProvSec 2010, pp. 1-17Cayrel, P.-L., Lindner, R., Rückert, M., Silva, R., A lattice-based threshold ring signature scheme (2010) LatinCrypt 2010, pp. 255-272Cayrel, P.-L., Véron, P., El Yousfi Alaoui, S.M., Improved code-based identification scheme (2010) SAC 2010, , http://arxiv.org/abs/1001.3017v1Fiat, A., Shamir, A., How to prove yourself: Practical solutions to identification and signature problems (1986) CRYPTO, pp. 186-194. , volume 263 of Lecture Notes in Computer Science, (Andrew M. Odlyzko, ed.), SpringerFossorier, M.P.C., Mihaljevic, M.J., Imai, H., Cui, Y., Matsuura, K., An algorithm for solving the LPN problem and its application to security evaluation of the HB protocols for RFID authentication (2006) INDOCRYPT, pp. 48-62. , volume 4329 of Lecture Notes in Computer Science, (Rana Barua and Tanja Lange, eds.), SpringerHalevi, S., Micali, S., Practical and provably-secure commitment schemes from collision-free hashing (1996) CRYPTO, pp. 201-215. , volume 1109 of Lecture Notes in Computer Science, (Neal Koblitz, ed.), SpringerHirschhorn, P., Hoffstein, J., Howgrave-Graham, N., Whyte, W., Choosing NT- RUEncrypt parameters in light of combined lattice reduction and MITM approaches (2009) Applied Cryptography and Network Security, pp. 437-455. , SpringerHopper, N.J., Blum, M., Secure human identification protocols (2001) ASIACRYPT, pp. 52-66. , volume 2248 of Lecture Notes in Computer Science, (Colin Boyd, ed.), SpringerJuels, A., Weis, S.A., Authenticating pervasive devices with human protocols (2005) CRYPTO, pp. 293-308. , volume 3621 of Lecture Notes in Computer Science, (Victor Shoup, ed.), SpringerKatz, J., Shin, J.S., Parallel and concurrent security of the HB and HB+Protocols (2006) EUROCRYPT, pp. 73-87. , volume 4004 of Lecture Notes in Computer Science, (Serge Vaudenay, ed.), SpringerKawachi, A., Tanaka, K., Xagawa, K., Concurrently secure identification schemes based on the worst-case hardness of lattice problems (2008) ASIACRYPT '08: Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security, pp. 372-389. , Springer-Verlag, Berlin, HeidelbergLi, Z., Gong, G., Qin, Z., (2009) Secure and Efficient HB-CM Entity Authentication Protocol, , http://eprint.iacr.org/Lindner, R., Peikert, C., Better key sizes (and attacks) for LWE-based encryption (2011) CT-RSA, pp. 319-339. , volume 6558 of Lecture Notes in Computer Science, (Aggelos Kiayias, ed.), SpringerLyubashevsky, V., Lattice-based identification schemes secure under active attacks (2008) Public Key Cryptography, pp. 162-179. , volume 4939 of Lecture Notes in Computer Science, (Ronald Cramer, ed.), SpringeLyubashevsky, V., Fiat-Shamir with aborts: Applications to lattice and factoring- based signatures (2009) ASIACRYPT, pp. 598-616. , volume 5912 of Lecture Notes in Computer Science, (Mitsuru Matsui, ed.), SpringerOkamoto, T., Provably secure and practical identification schemes and corresponding signature schemes (1993) CRYPTO, pp. 31-53. , volume 740 of Lecture Notes in Computer Science, (Ernest F. Brickell, ed.), SpringerOuafi, K., Overbeck, R., Vaudenay, S., On the security of HB# against a man-in-the-middle attack (2008) ASIACRYPT, pp. 108-124. , volume 5350 of Lecture Notes in Computer Science, (Josef Pieprzyk, ed.), SpringerPeikert, C., Public-key cryptosystems from the worst-case shortest vector problem: Extended abstract (2009) STOC, pp. 333-342. , (Michael Mitzenmacher, ed.), ACMRegev, O., On lattices, learning with errors, random linear codes, and cryptography (2009) J. ACM, 566Rückert, M., Schneider, M., Estimating the security of lattice-based cryptosystems (2010) IACR Cryptology EPrint Archive, 137Shor, P.W., Polynominal time algorithms for discrete logarithms and factoring on a quantum computer (1994) ANTS, p. 289. , volume 877 of Lecture Notes in Computer Science, (Leonard M. Adleman and Ming-Deh A. Huang, eds.), SpringerSilva, R., Campello, A., Dahab, R., LWE-based identification schemes (2011) CoRR, , abs/1109.0631Stern, J., A new identification scheme based on syndrome decoding (1993) CRYPTO, pp. 13-21. , volume 773 of Lecture Notes in Computer Science, (Douglas R. Stinson, ed.), SpringerVéron, P., Improved identification schemes based on error-correcting codes (1996) Appl. Algebra Eng. Commun. Comput., 81, pp. 57-69Xagawa, K., Tanaka, K., Zero-knowledge protocols for NTRU: Application to identification and proof of plaintext knowledge (2009) ProvSec, pp. 198-213. , volume 5848 of Lecture Notes in Computer Science, (Josef Pieprzyk and Fangguo Zhang, eds.), Springer