A. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, and M. Ohkubo, Structure-preserving signatures and commitments to group elements, LNCS, vol.6223, pp.209-236, 2010.

M. Abe, J. Groth, K. Haralambiev, and M. Ohkubo, Optimal structurepreserving signatures in asymmetric bilinear groups, LNCS, vol.6841, pp.649-666, 2011.

M. Abe, J. Groth, M. Ohkubo, and T. Tango, Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups, CRYPTO 2014, Part I, pp.241-260, 2014.
DOI : 10.1007/978-3-662-44371-2_14

A. M. Ho-au, W. Susilo, and Y. Mu, Constant-size dynamic k-TAA, LNCS, vol.4116, pp.111-125, 2006.

D. Boneh and X. Boyen, Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups, Journal of Cryptology, vol.84, issue.5, pp.149-177, 2004.
DOI : 10.1007/s00145-007-9005-7

F. Ernest, L. Camenisch, and . Chen, Direct anonymous attestation, ACM CCS 04, pp.132-145, 2004.

G. Bcn-+-10-camenisch, N. P. Neven, B. Smart, and . Warinschi, Get shorty via group signatures without encryption, LNCS, vol.10, issue.6280, pp.381-398, 2010.

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

B. Bernhard, G. Fuchsbauer, E. Ghadafi, N. P. Smart, and B. Warinschi, Anonymous attestation with user-controlled linkability, International Journal of Information Security, vol.13, issue.3, pp.219-249, 2013.
DOI : 10.1007/s10207-013-0191-z

D. Boneh, C. Gentry, B. Lynn, and H. Shacham, Aggregate and Verifiably Encrypted Signatures from Bilinear Maps, LNCS, vol.2656, pp.416-432, 2003.
DOI : 10.1007/3-540-39200-9_26

F. Baldimtsi and A. Lysyanskaya, Anonymous credentials light, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, pp.1087-1098, 2013.
DOI : 10.1145/2508859.2516687

N. Bari and B. Pfitzmann, Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees, EUROCRYPT'97, pp.480-494, 1997.
DOI : 10.1007/3-540-69053-0_33

M. Bellare and P. Rogaway, Random oracles are practical, Proceedings of the 1st ACM conference on Computer and communications security , CCS '93, pp.62-73, 1993.
DOI : 10.1145/168588.168596

J. Camenisch and T. Groß, Efficient attributes for anonymous credentials, ACM Trans. Inf. Syst. Secur, vol.15, issue.1, pp.4-2012

J. Camenisch and A. Lysyanskaya, An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation, LNCS, vol.2045, pp.93-118, 2001.
DOI : 10.1007/3-540-44987-6_7

J. Camenisch and A. Lysyanskaya, A Signature Scheme with Efficient Protocols, LNCS, vol.2576, pp.268-289, 2003.
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

S. Canard and R. Lescuyer, Protecting privacy by sanitizing personal data, Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security, ASIA CCS '13, pp.381-392, 2013.
DOI : 10.1145/2484313.2484363
URL : https://hal.archives-ouvertes.fr/hal-01002501

S. Chatterjee, A. Menezes, C. M. Chase, S. Meiklejohn, and G. Zaverucha, Type 2 structure-preserving signature schemes revisited Cryptology ePrint Archive Algebraic MACs and keyed-verification anonymous credentials On the design and implementation of an efficient DAA scheme, ACM CCS 14 CPS10. Liqun Chen, Dan Page, and Nigel P. Smart Smart Card Research and Advanced Application, pp.1205-1216, 2010.

S. Canard, D. Pointcheval, O. Sanders, and J. Traoré, Divisible E-cash made practical, PKC 2015 Cv91. David Chaum and Eugène van Heyst. Group signatures EURO- CRYPT'91, pp.77-100, 1991.
URL : https://hal.archives-ouvertes.fr/hal-01134006

Y. Dodis, E. Kiltz, K. Pietrzak, and D. Wichs, Message Authentication, Revisited, EUROCRYPT 2012, pp.355-374, 2012.
DOI : 10.1007/978-3-642-29011-4_22

D. , N. Desmoulins, R. Lescuyer, O. Sanders, and J. Traoré, Direct anonymous attestations with dependent basename opening, LNCS, vol.14, issue.8813, pp.206-221, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01091165

C. Delerablée and D. Pointcheval, Dynamic Fully Anonymous Short Group Signatures, Progress in Cryptology -VIETCRYPT 06, pp.193-210, 2006.
DOI : 10.1007/11958239_13

S. Goldwasser, S. Micali, and R. L. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, SIAM Journal on Computing, vol.17, issue.2, pp.281-308, 1988.
DOI : 10.1137/0217017

S. D. Galbraith, K. G. Paterson, and N. P. Smart, Pairings for cryptographers, Discrete Applied Mathematics, vol.156, issue.16, pp.3113-3121, 2008.
DOI : 10.1016/j.dam.2007.12.010

J. Groth, Fully Anonymous Group Signatures Without Random Oracles, LNCS, vol.4833, 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 Structure-preserving signatures on equivalence classes and their application to anonymous credentials, Palash Sarkar and Tetsu Iwata ASI- ACRYPT 2014, pp.415-432, 2008.

H. Hinterwälder, C. T. Zenger, F. Baldimtsi, A. Lysyanskaya, C. Paar et al., Efficient E-Cash in Practice: NFC-Based Payments for Public Transportation Systems, Privacy Enhancing Technologies -13th International Symposium, PETS 2013, pp.40-59, 2013.
DOI : 10.1007/978-3-642-39077-7_3

A. Joux, A one round protocol for tripartite diffie-hellman Aggregating CL-signatures revisited: Extended functionality and better efficiency, ANTS, volume 1838 of Lecture Notes in Computer Science, pp.385-394, 2000.

A. Lysyanskaya, S. Micali, L. Reyzin, and H. Shacham, Sequential Aggregate Signatures from Trapdoor Permutations, LNCS, vol.3027, pp.74-90, 2004.
DOI : 10.1007/978-3-540-24676-3_5

L. Lu, R. Ostrovsky, A. Sahai, H. Shacham, and B. Waters, Sequential Aggregate Signatures and Multisignatures Without Random Oracles, LNCS, vol.4004, pp.465-485, 2006.
DOI : 10.1007/11761679_28

A. Lysyanskaya, R. L. Rivest, A. Sahai, and S. Wolf, Pseudonym Systems, SAC 1999, pp.184-199, 2000.
DOI : 10.1007/3-540-46513-8_14

P. Torben and . Pedersen, Non-interactive and information-theoretic secure verifiable secret sharing, CRYPTO'91, pp.129-140, 1992.

C. Schnorr, Efficient identification and signatures for smart cards, LNCS, vol.435, issue.89, pp.239-252, 1990.

V. Sho97 and . Shoup, Lower bounds for discrete logarithms and related problems, EUROCRYPT'97, pp.256-266, 1997.