Name
Abstract | ||
|---|---|---|
A k-Times Anonymous Authentication (k-TAA) scheme allows users to be authenticated anonymously so long as the number of times that they are authenticated is within an allowable number. Some promising applications are e-voting, e-cash, e-coupons, and trial browsing of contents. However, the previous schemes are not efficient in the case where the allowable number k is large, since they require both users and verifiers to compute O(k) exponentiation in each authentication. We propose a k-TAA scheme where the numbers of exponentiations required for the entities in an authentication are independent of k. Moreover, we propose a notion of public detectability in a k-TAA scheme and present an efficient publicly verifiable k-TAA scheme, where the number of modular exponentiations required for the entities is O(log(k)). |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11745853_34 | Public Key Cryptography |
Keywords | Field | DocType |
k-taa scheme,modular exponentiation,allowable number,k-times anonymous authentication,previous scheme,public detectability,verifiable k-taa scheme,promising application,allowable number k,constant proving cost,efficiency | Public verifiability,Authentication,Computer science,Theoretical computer science,Electronic funds transfer,Verifiable secret sharing,Anonymity,Modular design,Exponentiation,Public-key cryptography,Distributed computing | Conference |
Volume | ISSN | ISBN |
3958 | 0302-9743 | 3-540-33851-9 |
Citations | PageRank | References |
26 | 1.14 | 30 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Isamu Teranishi | 1 | 264 | 11.57 |
| Kazue Sako | 2 | 1197 | 80.51 |