Paper 2005/168

Dynamic k-Times Anonymous Authentication

Lan Nguyen and Rei Safavi-Naini

Abstract

k-times anonymous authentication (k-TAA) schemes allow members of a group to be anonymously authenticated by application providers for a bounded number of times. k-TAA has application in e-voting, e-cash, electronic coupons and anonymous trial browsing of content. In this paper, we extend k-TAA model to dynamic k-TAA in which application providers can independently grant or revoke users from their own groups and so have the required control on their clients. We give a formal model for dynamic k-TAA, propose a dynamic k-times anonymous authentication scheme from bilinear pairing, and prove its security. We also construct an ordinary k-TAA from the dynamic scheme and show communication efficiency of the schemes compared to the previously proposed schemes.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. An improved version on security and efficiency of the paper presented in ACNS'05.
Keywords
privacy and anonymity
Contact author(s)
ldn01 @ uow edu au
History
2005-06-27: last of 2 revisions
2005-06-06: received
See all versions
Short URL
https://ia.cr/2005/168
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/168,
      author = {Lan Nguyen and Rei Safavi-Naini},
      title = {Dynamic k-Times Anonymous Authentication},
      howpublished = {Cryptology ePrint Archive, Paper 2005/168},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/168}},
      url = {https://eprint.iacr.org/2005/168}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.