]. M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, and M. Ohkubo, Structure-Preserving Signatures and Commitments to Group Elements, Crypto'10, pp.209-236, 2010.

N. Akagi, Y. Manabe, and T. Okamoto, An Efficient Anonymous Credential System, FC '08, pp.272-286, 2008.
DOI : 10.1007/978-3-540-85230-8_25

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

M. Au, W. Susilo, and Y. Mu, Constant-Size Dynamic k-TAA, SNC '06, pp.111-125, 2006.
DOI : 10.1007/11832072_8

N. Baric and B. Pfitzmann, Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees, Eurocrypt'97, pp.480-494, 1997.

M. Belenkiy, M. Chase, M. Kohlweiss, and A. Lysyanskaya, P-signatures and non-interactive anonymous credentials, TCC'08, pp.356-374, 2008.
DOI : 10.1007/978-3-540-78524-8_20
URL : https://lirias.kuleuven.be/bitstream/123456789/228640/2/article-1004.pdf

M. Bellare, A. Boldyreva, K. Kurosawa, and J. Staddon, Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security, IEEE Transactions on Information Theory, vol.53, issue.11, pp.3927-3943, 2007.
DOI : 10.1109/TIT.2007.907471

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 Get Shorty via Group Signatures without Encryption, CT-RSA'05 SCN'10, pp.136-153, 2005.

D. Boneh and X. Boyen, Short Signatures Without Random Oracles, Eurocrypt'04, pp.56-73, 2004.
DOI : 10.1007/978-3-540-24676-3_4

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

J. Camenisch, M. Dubovitskaya, and G. Neven, Oblivious transfer with access control, Proceedings of the 16th ACM conference on Computer and communications security, CCS '09, pp.131-140, 2009.
DOI : 10.1145/1653662.1653679

J. Camenisch, S. Hohenberger, and A. Lysyanskaya, Compact E-Cash, Eurocrypt'05, pp.302-321, 2005.
DOI : 10.1007/11426639_18

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

J. Camenisch and A. Lysyanskaya, A Signature Scheme with Efficient Protocols, SCN'04, 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, Crypto'04, pp.56-72, 2004.
DOI : 10.1007/978-3-540-28628-8_4

J. Camenisch and G. Zaverucha, Private Intersection of Certified Sets, FC '09, pp.108-127, 2009.
DOI : 10.1007/978-3-642-03549-4_7

D. Chaum, Security without identification: transaction systems to make big brother obsolete, Communications of the ACM, vol.28, issue.10, pp.1030-1044, 1985.
DOI : 10.1145/4372.4373

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

R. Cramer, Modular Design of Secure, yet Practical Cryptographic Protocols, 1996.

R. Cramer, I. Damgård, and P. Mackenzie, Efficient Zero-Knowledge Proofs of Knowledge without Intractability Assumptions, PKC'00, pp.354-372, 2000.
DOI : 10.1007/978-3-540-46588-1_24

R. Cramer and V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, Crypto'98, pp.13-25, 1994.
DOI : 10.1007/BFb0055717

I. Damgård, Efficient Concurrent Zero-Knowledge in the Auxiliary String Model, Eurocrypt'00, pp.418-430, 2000.
DOI : 10.1007/3-540-45539-6_30

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

A. Fiat and A. Shamir, How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Crypto'86, pp.186-194, 2003.
DOI : 10.1007/3-540-47721-7_12

D. Freeman, Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups, Eurocrypt'10, pp.44-61, 2010.
DOI : 10.1007/978-3-642-13190-5_3

J. Garay, P. Mackenzie, and K. Yang, Strengthening Zero-Knowledge Protocols Using Signatures, Eurocrypt'03, pp.177-194, 2003.

J. Groth, Fully Anonymous Group Signatures Without Random Oracles, Asiacrypt'07, 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'08, pp.415-432, 2008.
DOI : 10.1007/978-3-540-78967-3_24

M. Gerbush, A. Lewko, A. O. Neill, and B. Waters, Dual Form Signatures: An Approach for Proving Security from Static Assumptions, Asiacrypt'12, pp.25-42, 2012.
DOI : 10.1007/978-3-642-34961-4_4

C. Jutla and A. Roy, Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces, Asiacrypt '13, pp.1-20, 2013.
DOI : 10.1007/s00145-016-9243-7

C. Jutla and A. Roy, Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces, Crypto'14, pp.295-312, 2014.
DOI : 10.1007/978-3-662-44381-1_17

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

J. Katz and N. Wang, Efficiency improvements for signature schemes with tight security reductions, Proceedings of the 10th ACM conference on Computer and communication security , CCS '03, pp.155-164, 2003.
DOI : 10.1145/948109.948132

J. Kiltz and H. Wee, Quasi-Adaptive NIZK for Linear Subspaces, pp.101-128, 2015.
DOI : 10.1007/978-3-662-46803-6_4
URL : https://hal.archives-ouvertes.fr/hal-01220192

B. Libert, T. Peters, M. Joye, and M. Yung, Linearly Homomorphic Structure-Preserving Signatures and Their Applications, Crypto'13, pp.289-307, 2013.
DOI : 10.1007/s10623-015-0079-1

B. Libert, T. Peters, M. Joye, and M. Yung, Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures, Eurocrypt'14, pp.514-532, 2014.
DOI : 10.1007/978-3-642-55220-5_29
URL : https://hal.archives-ouvertes.fr/hal-00983147

B. Libert, T. Peters, and M. Yung, Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions, Crypto'15, pp.296-316, 2015.
DOI : 10.1007/978-3-662-48000-7_15
URL : https://hal.archives-ouvertes.fr/hal-01225353

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

T. Nakanishi, H. Fujii, Y. Hira, and N. Funabiki, Revocable Group Signature Schemes with Constant Costs for Signing and Verifying, PKC '09, pp.463-480, 2009.

M. Naor and O. Reingold, Number-theoretic constructions of efficient pseudo-random functions, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.458-467, 1997.
DOI : 10.1109/SFCS.1997.646134

T. Okamoto, Efficient Blind and Partially Blind Signatures Without Random Oracles, TCC '06, pp.80-99, 2006.
DOI : 10.1007/11681878_5

D. Pointcheval and O. Sanders, Short Randomizable Signatures. To appear in CT-RSA'16, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01377997

D. Pointcheval and J. Stern, Security Arguments for Digital Signatures and Blind Signatures, Journal of Cryptology, vol.13, issue.3, pp.361-396, 2000.
DOI : 10.1007/s001450010003

V. Shoup and R. Gennaro, Securing Threshold Cryptosystems against Chosen Ciphertext Attack, Eurocrypt'98, pp.1-16, 1998.

T. Yuen, S. Chow, C. Zhang, and S. Yiu, Exponent-inversion Signatures and IBE under Static Assumptions, Cryptology ePrint Archive, vol.2014