k-Times Anonymous Authentication (Extended Abstract)

Teranishi, Isamu; Furukawa, Yoshihiro; Sako, Kazue

doi:10.1007/978-3-540-30539-2_22

Cited by 115 publications

(117 citation statements)

References 29 publications

Supporting

Mentioning

117

Contrasting

Order By: Relevance

“…Moreover, we propose and formalize a stronger variant of the detectability requirement [TFS04] called the public detectability. It requires that anyone can verify that the AP indeed provided a fair limit to all users regarding the number of accesses to their service.…”

Section: Our Contributionsmentioning

confidence: 99%

“…First, we present the previous mechanism of detecting over-timed users [TFS04] at the cost of O(k) exponentiations. We then show how this could be decreased to O(log k) and to O(1).…”

Section: Key Ideasmentioning

confidence: 99%

“…A k-Times Anonymous Authentication (k-TAA) scheme [TFS04,NN05] allows users to be authenticated anonymously so long as the number of times that they are authenticated is within an allowable number. The scheme not only offers a time restriction mechanism to well-known group signature schemes [CH91,ACJT00,BBS04,BSZ05,CG04,KY05], but provides stronger properties of anonymity and traceability.…”

Section: Introductionmentioning

confidence: 99%

“…Regarding traceability, any verifier can trace a malicious "over-time" user (that is, a user who exceeds the time restriction) from an authentication log in a k-TAA scheme, whereas in a group signature scheme it is only the authority who has this capability. There are many applications of the k-TAA scheme, such as e-voting [SK94,OMAFO99,DJ01,FS01, Neff01], e-cash [CP92,B93,AF96,CFT98,PBF99], e-coupon [OO98,NHS99], and trial browsing of contents [TFS04]. Moreover, these various application services can be offered based on a single secret key issued to users at the joining phase.…”

Section: Introductionmentioning

confidence: 99%

“…A problem with the previous k-TAA schemes [TFS04,NN05] is that they require large computation when the number k becomes large, since O(k) exponentiation is necessary for both users and AP.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

k-Times Anonymous Authentication with a Constant Proving Cost

Teranishi¹,

Sako²

2006

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

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)).

show abstract

Section: Our Contributionsmentioning

confidence: 99%

“…First, we present the previous mechanism of detecting over-timed users [TFS04] at the cost of O(k) exponentiations. We then show how this could be decreased to O(log k) and to O(1).…”

Section: Key Ideasmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

k-Times Anonymous Authentication with a Constant Proving Cost

Teranishi¹,

Sako²

2006

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

Privacy‐preserving authentication protocols with efficient verification in VANETs

Zhang

2013

Int J Communication

View full text Add to dashboard Cite

SUMMARYAs an important component of intelligent transportation systems, vehicular ad hoc networks can provide safer and more comfortable driving circumstance for the drivers. However, communication security and privacy issues present practical concerns to the deployment of vehicular ad hoc networks. Although recent related studies have already addressed most of these issues, most of them have only considered a posteriori countermeasures or a priori countermeasures to prevent the attacks of an adversary. To the best of our knowledge, up to now, only two privacy‐preserving authentication schemes can provide a posteriori countermeasures and a priori countermeasures. But, the computational cost of verifying a signature is relatively high or security proof of the scheme is loose in the two schemes. In this paper, we propose two novel privacy‐preserving authentication schemes. The first one cannot only provide a posteriori and a priori countermeasures, but also has low computational cost in the verification phase and tight security proof. The second one can achieve batch verification on multiple messages. Comparison with Wu et al.'s scheme and Chen et al's scheme, our scheme shows higher efficiency in terms of the computational cost of verifying signature.Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

PCM: a privacy‐preserving detection mechanism in mobile ad hoc networks

Zhu

Ren

Wang

et al. 2009

Security Comm Networks

View full text Add to dashboard Cite

Although extensive research work has been undertaken to secure mobile ad hoc networks, till recently, researchers began to pay attention to the anonymity issue, and this issue was investigated mainly in terms of secure routing and data forwarding. We indicate that, in mobile ad hoc networks, there is an increasing interest in providing anonymity for the witnesses, i.e., those users who share their knowledge in detecting either malicious or selfish users. On the other hand, it is also a challenging problem to prevent the misuse of anonymous sources. In this paper, we propose the PlainClothesMan (PCM) protocol to provide anonymity for the witness who helps identify malicious or selfish users. Once there are more than a certain number of claims from distinct users against the same user, she is identified as a malicious or selfish user. Moreover, in PCM, the misuse of the witness anonymity is prevented in such a way that any malicious user who broadcasts multiple invalid claims against the same user for the same reason can be identified. Two exemplary scenarios are designed and simulated to model the necessities of witness anonymity in mobile ad hoc networks. Simulation results show that witness anonymity is very important for ensuring proper and efficient executions of fundamental functionalities of mobile ad hoc networks, e.g., certificate revocation and fairness, and PCM is both effective and efficient in providing such a type of anonymity.

show abstract

k-Times Anonymous Authentication (Extended Abstract)

Cited by 115 publications

References 29 publications

k-Times Anonymous Authentication with a Constant Proving Cost

k-Times Anonymous Authentication with a Constant Proving Cost

Privacy‐preserving authentication protocols with efficient verification in VANETs

PCM: a privacy‐preserving detection mechanism in mobile ad hoc networks

Contact Info

Product

Resources

About