Efficient Dynamic k-Times Anonymous Authentication

Lan Nguyen

Paper 2007/006

Efficient Dynamic k-Times Anonymous Authentication

Lan Nguyen

Abstract

In k-times anonymous authentication (k-TAA) schemes, members of a group can be anonymously authenticated to access applications for a bounded number of times determined by application providers. Dynamic $k$ -TAA allows application providers to independently grant or revoke group members from accessing their applications. Dynamic -TAA can be applied in several scenarios, such as -show anonymous credentials, digital rights management, anonymous trial of Internet services, e-voting, e-coupons etc. This paper proposes the first provably secure dynamic -TAA scheme, where authentication costs do not depend on . This efficiency is achieved by using a technique called ``efficient provable e-tag'', proposed in \cite{Nguyen06}, which could be applicable to other e-tag systems.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. Full version of the paper published in VietCrypt 2006
Keywords: privacy anonymity k-times anonymous authentication
Contact author(s): Lan Nguyen @ winmagic com
History: 2007-01-07: received
Short URL: https://ia.cr/2007/006
License: CC BY

BibTeX

@misc{cryptoeprint:2007/006,
      author = {Lan Nguyen},
      title = {Efficient Dynamic k-Times Anonymous Authentication},
      howpublished = {Cryptology {ePrint} Archive, Paper 2007/006},
      year = {2007},
      url = {https://eprint.iacr.org/2007/006}
}