International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Efficient Dynamic k-Times Anonymous Authentication

Authors:
Lan Nguyen
Download:
URL: http://eprint.iacr.org/2007/006
Search ePrint
Search Google
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 $k$-TAA can be applied in several scenarios, such as $k$-show anonymous credentials, digital rights management, anonymous trial of Internet services, e-voting, e-coupons etc. This paper proposes the first provably secure dynamic $k$-TAA scheme, where authentication costs do not depend on $k$. 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.
BibTeX
@misc{eprint-2007-13288,
  title={Efficient Dynamic k-Times Anonymous Authentication},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / privacy, anonymity, k-times anonymous authentication},
  url={http://eprint.iacr.org/2007/006},
  note={Full version of the paper published in VietCrypt 2006 Lan.Nguyen@winmagic.com 13518 received 4 Jan 2007},
  author={Lan Nguyen},
  year=2007
}