M. Abe and T. Okamoto, Provably Secure Partially Blind Signatures, LNCS, vol.1880, pp.271-286, 2000.
DOI : 10.1007/3-540-44598-6_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.6004

D. Boneh and X. Boyen, Short Signatures Without Random Oracles, LNCS, vol.3027, pp.56-73, 2004.
DOI : 10.1007/978-3-540-24676-3_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5374

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

M. Belenkiy, J. Camenisch, M. Chase, M. Kohlweiss, A. Lysyanskaya et al., Randomizable Proofs and Delegatable Anonymous Credentials, CRYPTO 2009, pp.108-125, 2009.
DOI : 10.1007/978-3-642-03356-8_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.4084

A. Boldyreva, M. Fischlin, A. Palacio, and B. Warinschi, A Closer Look at PKI: Security and Efficiency, PKC 2007, pp.458-475, 2007.
DOI : 10.1007/978-3-540-71677-8_30

M. Bellare and A. Palacio, The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols, LNCS, vol.3152, pp.273-289, 2004.
DOI : 10.1007/978-3-540-28628-8_17

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

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

X. Boyen and B. Waters, Full-domain subgroup hiding and constant-size group signatures Divisible e-cash systems can be truly anonymous, PKC 2007CG07] Sébastien Canard and Aline Gouget, pp.1-15, 2007.

S. Canard and A. Gouget, Anonymity in Transferable E-cash, ACNS 08, pp.207-223, 2008.
DOI : 10.1007/978-3-540-68914-0_13
URL : https://hal.archives-ouvertes.fr/hal-01110485

D. Chaum, Blind Signatures for Untraceable Payments, CRYPTO'82, pp.199-203, 1983.
DOI : 10.1007/978-1-4757-0602-4_18

D. Chaum, Blind Signature System, p.153, 1984.
DOI : 10.1007/978-1-4684-4730-9_14

D. Chaum and T. P. Pedersen, Transferred Cash Grows in Size, EURO- CRYPT'92, pp.390-407, 1992.
DOI : 10.1007/3-540-47555-9_32

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

I. Damgård, Towards Practical Public Key Systems Secure Against Chosen Ciphertext attacks, CRYPTO'91, pp.445-456, 1992.
DOI : 10.1007/3-540-46766-1_36

W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-654, 1976.
DOI : 10.1109/TIT.1976.1055638

T. Eng and T. Okamoto, Single-term divisible electronic coins, EURO- CRYPT'94, pp.306-319, 1994.
DOI : 10.1007/BFb0053446

G. Fuchsbauer and D. Pointcheval, Encrypting proofs on pairings and its application to anonymity for signatures. Cryptology ePrint Archive, Report, vol.528, 2008.

A. Fiat and A. Shamir, How To Prove Yourself: Practical Solutions to Identification and Signature Problems, LNCS, vol.263, issue.86, pp.186-194, 1987.
DOI : 10.1007/3-540-47721-7_12

J. Groth, R. Ostrovsky, and A. Sahai, Non-interactive Zaps and New Techniques for NIZK, LNCS, vol.4117, pp.97-111, 2006.
DOI : 10.1007/11818175_6

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

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

E. Kiltz, Chosen-Ciphertext Security from Tag-Based Encryption, LNCS, vol.3876, pp.581-600, 2006.
DOI : 10.1007/11681878_30

T. Nakanishi, N. Haruna, and Y. Sugiyama, Unlinkable Electronic Coupon Protocol with Anonymity Control, ISW'99, pp.37-46, 1999.
DOI : 10.1007/3-540-47790-X_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.7832

T. Okamoto, Efficient Blind and Partially Blind Signatures Without Random Oracles, LNCS, vol.3876, pp.80-99, 2006.
DOI : 10.1007/11681878_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.3771

T. Okamoto and K. Ohta, Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash, LNCS, vol.89, issue.435, pp.481-496, 1990.
DOI : 10.1007/0-387-34805-0_43

T. Okamoto and K. Ohta, Universal Electronic Cash, LNCS, vol.576, issue.91, pp.324-337, 1992.
DOI : 10.1007/3-540-46766-1_27

D. Pointcheval and J. Stern, Security arguments for digital signatures and blind signatures [Sch90] Claus-Peter Schnorr. Efficient identification and signatures for smart cards [Sho97] Victor Shoup. Lower bounds for discrete logarithms and related problems, EURO- CRYPT'97, pp.361-396, 1990.
DOI : 10.1007/s001450010003
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.8213

M. Stadler, J. Piveteau, and J. Camenisch, Fair Blind Signatures, EUROCRYPT'95, pp.209-219, 1995.
DOI : 10.1007/3-540-49264-X_17

H. Sebastiaan, D. Solms, and . Naccache, On blind signatures and perfect crimes, Computers & Security, vol.11, issue.6, pp.581-583, 1992.

R. Brent and . Waters, Efficient identity-based encryption without random oracles, EURO- CRYPT 2005, pp.114-127, 2005.