, 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
URL : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.319.3690&rep=rep1&type=pdf
, 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.7938
, 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
, A Technical Overview of Digital Credentials, 2002.
, 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
, One-Way Accumulators: A Decentralized Alternative to Digital Sinatures (Extended Abstract), In: EUROCRYPT, pp.274-285, 1993.
DOI : 10.1007/3-540-48285-7_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.1111
, 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
, Internet x.509 public key infrastructure certificate and certificate revocation list (crl) profile, 2002.
DOI : 10.17487/rfc3280
, A Practical System for Globally Revoking the Unlinkable Pseudonyms of Unknown Users, Lecture Notes in Computer Science, vol.4586, pp.400-415, 2007.
DOI : 10.1007/978-3-540-73458-1_29
, A Formal Model of Identity Mixer, Formal Methods for Industrial Critical Systems, vol.4, issue.3, pp.198-214, 2010.
DOI : 10.1007/BF00196725
, Mixing Identities with Ease, IFIP Working Conference on Policies & Research in Identity Management (IDMAN '10), pp.1-17, 2010.
DOI : 10.1007/978-3-642-17303-5_1
URL : https://hal.archives-ouvertes.fr/hal-01054404
, Practical verifiable encryption and decryption of discrete logarithms Advances in Cryptology, pp.3-126, 2003.
, Anonymous yet accountable access control, Proceedings of the 2005 ACM workshop on Privacy in the electronic society , WPES '05, pp.40-46, 2005.
DOI : 10.1145/1102199.1102208
, Solving revocation with efficient update of anonymous credentials. Security and Cryptography for Networks, pp.454-471, 2011.
DOI : 10.1007/978-3-642-15317-4_28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.1881
, Revocable group signature schemes with constant costs for signing and verifying, Public Key Cryptography?PKC, pp.463-480, 2009.
, Dynamic accumulators and application to efficient revocation of anonymous credentials Advances in Cryptology, pp.2-101, 2002.
, Accumulators from Bilinear Pairings and Applications, Topics in Cryptology?CT- RSA 2005, pp.275-292, 2005.
DOI : 10.1007/978-3-540-30574-3_19
, An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials, Public Key Cryptography?PKC, vol.4, issue.3, pp.481-500, 2009.
DOI : 10.1007/3-540-36413-7_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.7852
, 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.8033
, Quasi-Efficient Revocation of Group Signatures, Proceedings of the 6th international conference on Financial cryptography, pp.183-197, 2002.
DOI : 10.1007/3-540-36504-4_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.7973
, Group Testing and Batch Verification, Theoretic Security: 4th International Conference, p.140, 2009.
DOI : 10.1007/978-3-642-14496-7_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.4710
, Direct anonymous attestation, Proceedings of the 11th ACM conference on Computer and communications security , CCS '04, pp.132-145, 2004.
DOI : 10.1145/1030083.1030103
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.5041
, 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
, An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials, Lecture Notes in Computer Science, vol.4, issue.3, pp.481-500, 2009.
DOI : 10.1007/3-540-36413-7_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.7852
, How to prove list membership in logarithmic time, CW Reports, vol.470, 2006.
, Fast batch verification for modular exponentiation and digital signatures, Advances in Cryptology -EUROCRYPT '98, p.236, 1998.
DOI : 10.1007/BFb0054130
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.7156
, 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.8796
, Performance analysis of accumulatorbased revocation mechanisms, Security and Privacy Silver Linings in the Cloud. Volume 330 of IFIP Advances in Information and Communication Technology, pp.289-301, 2010.
DOI : 10.1007/978-3-642-15257-3_26
URL : https://hal.archives-ouvertes.fr/hal-01054508
, 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
, U-Prove Cryptographic Specification V1.0, 2010.