Dynamic k-Times Anonymous Authentication

Nguyen, Lan

doi:10.1007/11496137_22

Cited by 79 publications

(79 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As previously explained in [7,11], most related schemes (e.g., e-cash, digital credentials) cannot be employed as privacy-protecting unsplittable MCS s because they have different usage patterns [15,1], are inefficient in this setup [12], or lack at least one of the required properties [3], in particular unsplittability. Some e-cash systems can be used as unlinkable or at least anonymous MCS s (e.g.…”

Section: Related Workmentioning

confidence: 99%

A Privacy-Protecting Multi-Coupon Scheme with Stronger Protection Against Splitting

Chen

Escalante

Löhr

et al. 2007

Financial Cryptography and Data Security

View full text Add to dashboard Cite

Abstract.A multi-coupon (MC ) represents a collection of k coupons that a user can redeem to a vendor in exchange for some goods or services. Nguyen (FC 2006), deepening the ideas of Chen et al. (FC 2005), introduced an unforgeable privacy-protecting MC system with constant complexity for issuing and redemption of MCs, that discourages sharing of coupons through a property called weak unsplittability, where sharing of a single coupon implies sharing of the whole multi-coupon (all-ornothing sharing). Both schemes still lack some features required by many applications in practice, and also stronger forms of unsplittability are desirable. In this paper, we propose a new security model for MC systems with stronger definitions, followed by a concrete realization where single coupons within a MC may represent different goods or services, have independent validity periods, and must be redeemed sequentially ensuring a stronger version of unsplittability compared to all-or-nothing sharing. The complexity of the proposed scheme is linear in k for the generation of multi-coupons and constant for each redeemed single coupon.

show abstract

Section: Related Workmentioning

confidence: 99%

A Privacy-Protecting Multi-Coupon Scheme with Stronger Protection Against Splitting

Chen

Escalante

Löhr

et al. 2007

Financial Cryptography and Data Security

View full text Add to dashboard Cite

show abstract

“…In the schemes of [TFS04,NN05], a user prove this using the 'OR proof', that is, a user proves that one of τ = r 1 x , τ = r 2 x , . .…”

Section: Key Ideasmentioning

confidence: 99%

“…We note that Nguyen and Naini [NN05] also adopt the definition which allows an AP to publish its own public information, but they do not adopt the other two modifications.…”

Section: Modified Pointsmentioning

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%

“…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 2 more Smart Citations

k-Times Anonymous Authentication with a Constant Proving Cost

Teranishi¹,

Sako²

2006

Lecture Notes in Computer Science

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

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

Dynamic k-Times Anonymous Authentication

Cited by 79 publications

References 11 publications

A Privacy-Protecting Multi-Coupon Scheme with Stronger Protection Against Splitting

A Privacy-Protecting Multi-Coupon Scheme with Stronger Protection Against Splitting

k-Times Anonymous Authentication with a Constant Proving Cost

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

Contact Info

Product

Resources

About