Cryptology ePrint Archive: Report 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.

Category / Keywords: public-key cryptography / privacy and anonymity

Publication Info: An improved version on security and efficiency of the paper presented in ACNS'05.

Date: received 6 Jun 2005, last revised 27 Jun 2005

Contact author: ldn01 at uow edu au

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20050627:091402 (All versions of this report)

Short URL: ia.cr/2005/168