J. Camenisch and E. V. Herreweghen, anonymous credential system, Proceedings of the 9th ACM conference on Computer and communications security , CCS '02, pp.21-30, 2002.
DOI : 10.1145/586110.586114

S. Brands, A Technical Overview of Digital Credentials, 2002.

J. Camenisch and A. Lysyanskaya, Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials, Lecture Notes in Computer Science, vol.2442, pp.61-76, 2002.
DOI : 10.1007/3-540-45708-9_5

L. Nguyen, Accumulators from Bilinear Pairings and Applications, Lecture Notes in Computer Science, vol.3376, pp.275-292, 2005.
DOI : 10.1007/978-3-540-30574-3_19

J. Camenisch, M. Kohlweiss, and C. Soriente, An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials, Lecture Notes in Computer Science, vol.5443, pp.481-500, 2009.
DOI : 10.1007/978-3-642-00468-1_27

D. Boneh and H. Shacham, Group signatures with verifier-local revocation, Proceedings of the 11th ACM conference on Computer and communications security , CCS '04, pp.168-177, 2004.
DOI : 10.1145/1030083.1030106

J. C. Benaloh and M. De-mare, One-Way Accumulators: A Decentralized Alternative to Digital Sinatures (Extended Abstract), In: EUROCRYPT, pp.274-285, 1993.

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

C. Papamanthou, R. Tamassia, and N. Triandopoulos, Authenticated hash tables, Proceedings of the 15th ACM conference on Computer and communications security, CCS '08, pp.437-448, 2008.
DOI : 10.1145/1455770.1455826

C. Tartary, Ensuring Authentication of Digital Information Using Cryptographic Accumulators, Lecture Notes in Computer Science, vol.5888, pp.315-333, 2009.
DOI : 10.1007/978-3-642-10433-6_21

J. Li, N. Li, and R. Xue, Universal Accumulators with Efficient Nonmembership Proofs, Lecture Notes in Computer Science, vol.4521, pp.253-269, 2007.
DOI : 10.1007/978-3-540-72738-5_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.4339

I. Damgard and N. Tri, Opoulos: Supporting Non-membership Proofs with Bilinear-map Accumulators, p.538, 2008.

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

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

E. Bangerter, J. Camenisch, and A. Lysyanskaya, A Cryptographic Framework for the Controlled Release of Certified Data, Lecture Notes in Computer Science, vol.17, issue.2, pp.20-42, 2004.
DOI : 10.1007/3-540-45682-1_31

G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik, A Practical and Provably Secure Coalition-Resistant Group Signature Scheme, Lecture Notes in Computer Science, vol.1880, pp.255-270, 2000.
DOI : 10.1007/3-540-44598-6_16

J. Camenisch and A. Lysyanskaya, A Signature Scheme with Efficient Protocols, Lecture Notes in Computer Science, vol.2576, pp.268-289, 2002.
DOI : 10.1007/3-540-36413-7_20

L. Nguyen and R. Safavi-naini, Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings, Lecture Notes in Computer Science, vol.3329, pp.372-386, 2004.
DOI : 10.1007/978-3-540-30539-2_26

J. Camenisch and A. Lysyanskaya, Signature Schemes and Anonymous Credentials from Bilinear Maps, pp.56-72
DOI : 10.1007/978-3-540-28628-8_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.2381

M. H. Au, W. Susilo, and Y. Mu, Constant-Size Dynamic k-TAA, Lecture Notes in Computer Science, vol.4116, pp.111-125, 2006.
DOI : 10.1007/11832072_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.2240

J. Camenisch and M. Stadler, Efficient Group Signature Schemes for Large Groups (Extended Abstract), In: CRYPTO, pp.410-424, 1997.

A. Fiat and A. Shamir, How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Lecture Notes in Computer Science, vol.263, pp.186-194, 1986.
DOI : 10.1007/3-540-47721-7_12

J. H. Cheon, Security Analysis of the Strong Diffie-Hellman Problem, Lecture Notes in Computer Science, vol.4004, pp.1-11, 2006.
DOI : 10.1007/11761679_1

M. K. Franklin, Advances in Cryptology -CRYPTO, 24th Annual International CryptologyConference Proceedings, 2004.