Welcome to the resource topic for 2005/168
Title:
Dynamic k-Times Anonymous Authentication
Authors: Lan Nguyen, 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.
ePrint: https://eprint.iacr.org/2005/168
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .