Efficient dynamic k-times anonymous authentication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4341 LNCS, Issue , 2006, Pages 81-98

  Nguyen, Lan ^a,b  

^a CSIRO   (Australia)

^b Win Magic   (Canada)

Author keywords

Anonymity; Dynamic k times anonymous authentication; E tag; K show anonymous credentials; Privacy

Indexed keywords

AUTHENTICATION; COPYRIGHTS; DATA PRIVACY; ELECTRONIC VOTING;

ACCESS APPLICATIONS; ANONYMITY; ANONYMOUS AUTHENTICATION; ANONYMOUS CREDENTIAL; APPLICATION PROVIDERS; AUTHENTICATION COST; DIGITAL RIGHTS MANAGEMENT; K-TIMES ANONYMOUS AUTHENTICATION (K-TAA);

CRYPTOGRAPHY;

EID: 84887271407     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11958239_6     Document Type: Conference Paper

References (15)

1. D. Boneh and X. Boyen. Short Signatures Without Random Oracles. EUROCRYPT 2004, Springer-Verlag, LNCS 3027, pp. 56-73.
2. D. Boneh and X. Boyen. Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles. EUROCRYPT 2004, Springer-Verlag, LNCS 3027, pp. 223-238.
3. J. Camenisch, and A. Lysyanskaya. Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. CRYPTO 2002, Springer-Verlag, LNCS 2442, pp. 61-76.
4. J. Camenisch and A. Lysyanskaya. A Signature Scheme with Efficient Protocols. SCN 2002, Springer-Verlag, LNCS 2576.
5. J. Camenisch, S. Hohenberger, and A. Lysyanskaya. Compact E-Cash. EUROCRYPT 2005, Springer-Verlag, LNCS 3494, pp. 302-321, 2005.
6. L. Chen, M. Enzmann, A. Sadeghi, M. Schneider, and M. Steiner. A Privacy-Protecting Coupon System. Financial Cryptography 2005, Springer-Verlag, LNCS 3570, pp. 93-109.
7. Y. Dodis and A. Yampolskiy. A Verifiable Random Function with Short Proofs and Keys. Public Key Cryptography 2005, Springer-Verlag, LNCS 3386, pp. 416-431.
8. A. Fiat, and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. CRYPTO 1986, Springer-Verlag, LNCS 263, pp. 186-194.
9. R. Granger, D. Page, and M. Stam. A Comparison of CEILIDH and XTR. Algorithmic Number Theory, 6th International Symposium, ANTS-VI, pages 235-249. Springer, June 2004.
10. A. Kiayias, and Moti Yung. Group Signatures: Provable Security, Efficient Constructions and Anonymity from Trapdoor-Holders. Cryptology ePrint Archive: Report 2004/076.
11. Lan Nguyen. Privacy-Protecting Coupon System Revisited. Financial Cryptography Conference (FC) 2006, LNCS, Springer, 2006.
12. L. Nguyen and R. Safavi-Naini. Dynamic k-Times Anonymous Authentication. Applied Cryptography and Network Security (ACNS) 2005, Springer-Verlag, LNCS 3531, 2005.
13. I. Teranisi, J. Furukawa, and K. Sako. k-Times Anonymous Authentication. ASI-ACRYPT 2004, Springer-Verlag, LNCS 3329, pp. 308-322, 2004.
14. I. Teranishi and K. Sako. k-Times Anonymous Authentication with a Constant Proving Cost. Public Key Cryptography 2006, Springer-Verlag, LNCS 3958, pp. 525-542, 2006.
15. V. Wei. Tracing-by-Linking Group Signatures. Information Security Conference (ISC) 2005, Springer-Verlag, LNCS 3650, pp. 149-163, 2005.