A. Becker, A. Joux, A. May, and A. Meurer, Decoding Random Binary Linear Codes in 2 n/20: How 1???+???1???=???0 Improves Information Set Decoding, Advances in Cryptology EUROCRYPT 2012, pp.520-536, 2012.
DOI : 10.1007/978-3-642-29011-4_31

M. Bellare, D. Micciancio, and B. Warinschi, Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions, Cryptology EUROCRYPT 2003, pp.614-629, 2003.
DOI : 10.1007/3-540-39200-9_38

M. Bellare, H. Shi, and C. Zhang, Foundations of Group Signatures: The Case of Dynamic Groups, Topics in Cryptology CT-RSA 2005, pp.136-153, 2005.
DOI : 10.1007/978-3-540-30574-3_11

E. Berlekamp, R. J. Mceliece, and H. C. Van-tilborg, On the inherent intractability of certain coding problems (corresp.). Information Theory, IEEE Transactions on, vol.24, issue.3, pp.384-386, 1978.

O. Blazy, Preuves de connaissance interactives et non-interactives. Part 1, Chapter 3, 2012.

M. Blum, P. Feldman, and S. Micali, Non-interactive zeroknowledge and its applications, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC '88, pp.103-112, 1988.
DOI : 10.1145/62212.62222

D. Boneh, X. Boyen, and H. Shacham, Short Group Signatures, Lecture Notes in Computer Science, vol.3152, pp.41-55, 2004.
DOI : 10.1007/978-3-540-28628-8_3

D. Boneh and H. Shacham, Group signatures with verifier-local revocation, Proceedings of the 11th ACM conference on Computer and communications security , CCS '04, pp.168-177, 2004.
DOI : 10.1145/1030083.1030106

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Camenisch and A. Lysyanskaya, Signature Schemes and Anonymous Credentials from Bilinear Maps, pp.56-72, 2004.
DOI : 10.1007/978-3-540-28628-8_4

D. Chaum and E. Van-heyst, Group Signatures, Advances in Cryptology EUROCRYPT 91, pp.257-265, 1991.
DOI : 10.1007/3-540-46416-6_22

N. Courtois, M. Finiasz, and N. Sendrier, How to Achieve a McEliece-Based Digital Signature Scheme, Advances in Cryptology -ASI- ACRYPT 2001, pp.157-174, 2001.
DOI : 10.1007/3-540-45682-1_10

URL : https://hal.archives-ouvertes.fr/inria-00072511

C. Delerablee and D. Pointcheval, Dynamic Fully Anonymous Short Group Signatures, Progress in Cryptology -VI- ETCRYPT 2006, pp.193-210, 2006.
DOI : 10.1007/11958239_13

J. Faugère, V. Gauthier, A. Otmani, L. Perret, and J. Tillich, A distinguisher for high rate McEliece cryptosystems, ITW 2011, pp.282-286, 2011.

A. Fiat and A. Shamir, How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Proceedings on Advances in cryptology?CRYPTO '86, pp.186-194, 1987.
DOI : 10.1007/3-540-47721-7_12

M. Finiasz and N. Sendrier, Security Bounds for the Design of Code-Based Cryptosystems, Advances in Cryptology ASIACRYPT 2009, pp.88-105, 2009.
DOI : 10.1007/978-3-642-10366-7_6

S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems, SIAM Journal on Computing, vol.18, issue.1, pp.186-208, 1989.
DOI : 10.1137/0218012

S. , D. Gordon, J. Katz, and V. Vaikuntanathan, A group signature scheme from lattice assumptions, Advances in Cryptology -ASIACRYPT 2010, pp.395-412, 2010.

J. Groth, Fully Anonymous Group Signatures Without Random Oracles, ASIACRYPT 2007, pp.164-180, 2007.
DOI : 10.1007/978-3-540-76900-2_10

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. Kiayias, Y. Tsiounis, and M. Yung, Traceable Signatures, Advances in Cryptology -EUROCRYPT 2004, pp.571-589, 2004.
DOI : 10.1007/978-3-540-24676-3_34

F. Laguillaumie, A. Langlois, B. Libert, and D. Stehl, Lattice-Based Group Signatures with Logarithmic Signature Size, Advances in Cryptology -ASIACRYPT 2013, pp.41-61, 2013.
DOI : 10.1007/978-3-642-42045-0_3

URL : https://hal.archives-ouvertes.fr/hal-00920420

A. Langlois, S. Ling, K. Nguyen, and H. Wang, Lattice-Based Group Signature Scheme with Verifier-Local Revocation, Public-Key Cryptography PKC 2014, pp.345-361, 2014.
DOI : 10.1007/978-3-642-54631-0_20

URL : https://hal.archives-ouvertes.fr/hal-00983084

B. Libert and M. Yung, Efficient Traceable Signatures in the Standard Model, Pairing-Based Cryptography Pairing, pp.187-205, 2009.
DOI : 10.1007/11426639_7

F. J. Macwilliams and N. J. Sloane, The Theory of Error-Correcting Codes, 1978.

Q. Phong, J. Nguyen, Z. Zhang, and . Zhang, Simpler efficient group signatures from lattices

K. Nguyen, S. Ling, and H. Wang, Group signatures from lattices: simpler, tighter, shorter, ring-based, PKC 2015

J. Stern, A new identification scheme based on syndrome decoding, Advances in Cryptology CRYPTO 93, pp.13-21, 1994.
DOI : 10.1007/3-540-48329-2_2

A. Vardy, The intractability of computing the minimum distance of a code Information Theory, IEEE Transactions on, vol.43, issue.6, pp.1757-1766, 1997.