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

Category / Keywords: cryptographic protocols / privacy, anonymity, k-times anonymous authentication

Publication Info: Full version of the paper published in VietCrypt 2006

Date: received 4 Jan 2007

Contact author: Lan Nguyen at winmagic com

Available format(s): PDF | BibTeX Citation

Version: 20070107:114602 (All versions of this report)

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]