M. Abdalla and B. Warinschi, On the Minimal Assumptions of Group Signature Schemes, ICICS 2004, pp.1-13, 2004.
DOI : 10.1007/978-3-540-30191-2_1

J. Alwen and C. Peikert, Generating Shorter Bases for Hard Random Lattices, STACS'09, 2009.
DOI : 10.1007/s00224-010-9278-3
URL : https://hal.archives-ouvertes.fr/inria-00359718

G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik, A Practical and Provably Secure Coalition-Resistant Group Signature Scheme, Crypto'00, pp.255-270, 2000.
DOI : 10.1007/3-540-44598-6_16

W. Banaszczyk, New bounds in some transference theorems in the geometry of numbers, Mathematische Annalen, vol.68, issue.1, pp.625-635, 1993.
DOI : 10.1007/BF01445125

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

F. Benhamouda, J. Camenisch, S. Krenn, V. Lyubashevsky, and G. Neven, Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures, Asiacrypt'14, number 8873 in LNCS, pp.551-572, 2014.
DOI : 10.1007/978-3-662-45611-8_29
URL : https://hal.archives-ouvertes.fr/hal-01084737

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

D. Boneh and M. Franklin, Identity-based encryption from the weil pairing, LNCS, vol.2139, pp.213-229, 2001.

X. Boyen, Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More, PKC 2010, pp.499-517, 2010.
DOI : 10.1007/978-3-642-13013-7_29

X. Boyen and B. Waters, Compact Group Signatures Without Random Oracles, Eurocrypt'06, pp.427-444, 2006.
DOI : 10.1007/11761679_26

X. Boyen and B. Waters, Full-Domain Subgroup Hiding and Constant-Size Group Signatures, PKC 2010, pp.1-15, 2007.
DOI : 10.1007/978-3-540-71677-8_1

Z. Brakerski, A. Langlois, C. Peikert, O. Regev, and D. Stehlé, Classical hardness of learning with errors, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC '13, pp.575-584, 2013.
DOI : 10.1145/2488608.2488680
URL : https://hal.archives-ouvertes.fr/hal-00922194

E. Brickell, D. Pointcheval, S. Vaudenay, and M. Yung, Design Validations for Discrete Logarithm Based Signature Schemes, PKC 2000, pp.276-292, 2000.
DOI : 10.1007/978-3-540-46588-1_19

R. Canetti, S. Halevi, and J. Katz, Chosen-Ciphertext Security from Identity-Based Encryption, Eurocrypt, pp.207-222, 2004.
DOI : 10.1007/978-3-540-24676-3_13

D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert, Bonsai trees, or how to delegate a lattice basis, Eurocrypt'10, pp.523-552, 2010.

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

Y. Desmedt and Y. Frankel, Threshold cryptosystems, LNCS, vol.435, pp.307-315, 1989.

M. F. Ezerman, H. T. Lee, S. Ling, K. Nguyen, and H. Wang, A Provably Secure Group Signature Scheme from Code-Based Assumptions, Asiacrypt'15, 2015.
DOI : 10.1007/978-3-662-48797-6_12

C. Gentry, Fully homomorphic encryption using ideal lattices, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.169-178, 2009.
DOI : 10.1145/1536414.1536440

C. Gentry, C. Peikert, and V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.197-206, 2008.
DOI : 10.1145/1374376.1374407

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

S. D. Gordon, J. Katz, and V. Vaikuntanathan, A Group Signature Scheme from Lattice Assumptions, Asiacrypt 2010, pp.395-412, 2010.
DOI : 10.1007/978-3-642-17373-8_23

J. Groth, Evaluating Security of Voting Schemes in the Universal Composability Framework, ACNS, pp.46-60, 2004.
DOI : 10.1007/978-3-540-24852-1_4

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

J. Groth and A. Sahai, Efficient Non-interactive Proof Systems for Bilinear Groups, Eurocrypt, pp.415-432, 2008.
DOI : 10.1007/978-3-540-78967-3_24

A. Jain, S. Krenn, K. Pietrzak, and A. Tentes, Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise, Asiacrypt'12, pp.663-680, 2012.
DOI : 10.1007/978-3-642-34961-4_40

A. Kawachi, K. Tanaka, and K. Xagawa, Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems, Asiacrypt'08, pp.372-389, 2008.
DOI : 10.1007/978-3-540-30144-8_28

A. Kiayias, Y. Tsiounis, and M. Yung, Traceable Signatures, Eurocrypt'04, 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, Asiacrypt 2013, pp.41-61, 2013.
DOI : 10.1007/978-3-642-42045-0_3
URL : https://hal.archives-ouvertes.fr/hal-00920420

B. Libert and M. Joye, Group Signatures with Message-Dependent Opening in the Standard Model, CT-RSA'14, 2014.
DOI : 10.1007/978-3-319-04852-9_15

B. Libert, S. Ling, F. Mouhartem, K. Nguyen, and H. Wang, Signature schemes with efficient protocols and dynamic group signatures from lattice assumptions. Cryptology ePrint Archive, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01267123

B. Libert, S. Ling, K. Nguyen, and H. Wang, Zero-knowledge arguments for latticebased accumulators: Logarithmic-size ring signatures and group signatures without trapdoors, Eurocrypt 2016, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01314642

S. Ling, K. Nguyen, D. Stehlé, and H. Wang, Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications, 2013.
DOI : 10.1007/978-3-642-36362-7_8
URL : https://hal.archives-ouvertes.fr/hal-00767548

S. Ling, K. Nguyen, and H. Wang, Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based, PKC'15, 2015.
DOI : 10.1007/978-3-662-46447-2_19

D. Micciancio and C. Peikert, Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller, Eurocrypt'12, pp.700-718, 2012.
DOI : 10.1007/978-3-642-29011-4_41

P. Q. Nguyen, J. Zhang, and Z. Zhang, Simpler Efficient Group Signatures from Lattices, PKC 2015, pp.401-426, 2015.
DOI : 10.1007/978-3-662-46447-2_18
URL : https://hal.archives-ouvertes.fr/hal-01256013

K. Ohara, Y. Sakai, K. Emura, and G. Hanaoka, A group signature scheme with unbounded message-dependent opening, Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security, ASIA CCS '13, 2013.
DOI : 10.1145/2484313.2484382

C. Peikert, Public-key cryptosystems from the worst-case shortest vector problem, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.333-342, 2009.
DOI : 10.1145/1536414.1536461

C. Peikert, A decade of lattice cryptography. Cryptology ePrint Archive, 2015.

C. Peikert and V. Vaikuntanathan, Non-interactive statistical zero-knowledge proofs for lattice problems, Crypto'08, pp.536-553, 2008.

O. Regev, On lattices, learning with errors, random linear codes, and cryptography, STOC'05, pp.84-93, 2005.