S. Agrawal, D. Boneh, and X. Boyen, Efficient Lattice (H)IBE in the Standard Model, Proc. of EUROCRYPT, pp.553-572, 2010.
DOI : 10.1007/978-3-642-13190-5_28

J. Alwen and C. Peikert, Generating Shorter Bases for Hard Random Lattices, Theory of Computing Systems, vol.26, issue.5, pp.535-553, 2011.
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, Proceedings of Crypto 2000, number 1880 in LNCS, 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, pp.614-629, 2003.
DOI : 10.1007/3-540-39200-9_38

M. Bellare and G. Neven, Multi-signatures in the plain public-Key model and a general forking lemma, Proceedings of the 13th ACM conference on Computer and communications security , CCS '06, pp.390-399, 2006.
DOI : 10.1145/1180405.1180453

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

D. Boneh and X. Boyen, Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles, Proceedings of Eurocrypt 2004, pp.223-238, 2004.
DOI : 10.1007/978-3-540-24676-3_14

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

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

X. Boyen and B. Waters, Compact Group Signatures Without Random Oracles, Proceedings of Eurocrypt 2006, pp.427-444, 2006.
DOI : 10.1007/11761679_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.1318

X. Boyen and B. Waters, Full-Domain Subgroup Hiding and Constant-Size Group Signatures, Proceedings of PKC 2007, 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
DOI : 10.1145/2488608.2488680
URL : https://hal.archives-ouvertes.fr/hal-00922194

E. Brickell, An efficient protocol for anonymously providing assurance of the container of a private key, apr, 2003.

J. Camenisch and A. Lysyanskaya, Dynamic accumulators and application to efficient revoca-tion of anonymous credentials, Crypto'02, pp.61-76, 2002.

J. Camenisch and A. Lysyanskaya, A Signature Scheme with Efficient Protocols, Security in Communication Networks, pp.268-289, 2002.
DOI : 10.1007/3-540-36413-7_20

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

J. Camenisch, G. Neven, and M. Rückert, Fully Anonymous Attribute Tokens from Lattices, Proceedings of SCN 2012, pp.57-75, 2012.
DOI : 10.1007/978-3-642-32928-9_4

D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert, Bonsai trees, or how to delegate a lattice basis, Proc. of EUROCRYPT, 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

S. Garg, C. Gentry, and S. Halevi, Candidate multilinear maps from ideal lattices and applications, Proc. of EURO- CRYPT, 2013.
DOI : 10.1007/978-3-642-38348-9_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.6312

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. D. Gordon, J. Katz, and V. Vaikuntanathan, A Group Signature Scheme from Lattice Assumptions, Proc. of ASI- ACRYPT, pp.395-412, 2010.
DOI : 10.1007/978-3-642-17373-8_23

J. Groth, Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures, Asiacrypt'06, pp.444-459, 2006.
DOI : 10.1007/11935230_29

J. Groth, Fully Anonymous Group Signatures Without Random Oracles, Asiacrypt07, pp.164-180, 2007.
DOI : 10.1007/978-3-540-76900-2_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.6315

J. Groth, R. Ostrovsky, and A. Sahai, Perfect Non-interactive Zero Knowledge for NP, Eurocrypt'06, pp.339-358, 2006.
DOI : 10.1007/11761679_21

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

S. Hohenberger and B. Waters, Short and Stateless Signatures from the RSA Assumption, Proc. of CRYPTO, pp.654-670, 2009.
DOI : 10.1007/978-3-642-03356-8_38

A. Kiayias and M. Yung, Secure scalable group signature with dynamic joins and separable authorities, International Journal of Security and Networks, vol.1, issue.1/2, pp.24-45, 2006.
DOI : 10.1504/IJSN.2006.010821

V. Lyubashevsky, Lattice-based identification schemes secure unde active attacks, Proceedings of PKC 2008, pp.162-179, 2008.
DOI : 10.1007/978-3-540-78440-1_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.3518

V. Lyubashevsky, Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures, Proc. of ASI- ACRYPT, pp.598-616, 2009.
DOI : 10.1007/978-3-642-10366-7_35

V. Lyubashevsky, Lattice Signatures without Trapdoors, Proc. of EUROCRYPT, pp.738-755, 2012.
DOI : 10.1007/978-3-642-29011-4_43
URL : https://hal.archives-ouvertes.fr/hal-00864308

V. Lyubashevsky and D. Micciancio, Generalized Compact Knapsacks Are Collision Resistant, Proc. of ICALP, pp.144-155, 2006.
DOI : 10.1007/11787006_13

V. Lyubashevsky and D. Micciancio, Asymptotically Efficient Lattice-Based Digital Signatures, Proc. of TCC, pp.37-54, 2008.
DOI : 10.1007/978-3-540-78524-8_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.1767

V. Lyubashevsky, C. Peikert, and O. Regev, On ideal lattices and learning with errors over rings, Proc. of EUROCRYPT, pp.1-23, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00921792

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

D. Micciancio and S. Vadhan, Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More, CRYPTO2003, pp.282-298, 2003.
DOI : 10.1007/978-3-540-45146-4_17

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 and A. Rosen, Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices, Proc. of TCC, pp.145-166, 2006.
DOI : 10.1007/11681878_8

C. Peikert and V. Vaikuntanathan, Non-interactive statistical zero-knowledge proofs for lattice problems, Proceedings of Crypto'08, volume LNCS, pp.536-553, 2008.
DOI : 10.1007/978-3-540-85174-5_30

O. Regev, On lattices, learning with errors, random linear codes, and cryptography, J. ACM, vol.56, issue.6, 2009.