IEICE TRANSACTIONS on Fundamentals
k-Times Anonymous Authentication
Summary :
We propose an authentication scheme in which users can be authenticated anonymously so long as times that they are authenticated is within an allowable number. The proposed scheme has two features: 1) no one, not even an authority, can identify users who have been authenticated within the allowable number, 2) anyone can trace, without help from the authority, dishonest users who have been authenticated beyond the allowable number by using the records of these authentications. Our scheme can be applied to e-voting, e-cash, electronic coupons, and trial browsing of content. In these applications, our scheme, unlike the previous one, conceals users' participation from protocols and guarantees that they will remain anonymous to everyone.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E92-A No.1 pp.147-165
- Publication Date
- 2009/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E92.A.147
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- Category
- Secure Protocol
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Isamu TERANISHI, Jun FURUKAWA, Kazue SAKO, "k-Times Anonymous Authentication" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 1, pp. 147-165, January 2009, doi: 10.1587/transfun.E92.A.147.
Abstract: We propose an authentication scheme in which users can be authenticated anonymously so long as times that they are authenticated is within an allowable number. The proposed scheme has two features: 1) no one, not even an authority, can identify users who have been authenticated within the allowable number, 2) anyone can trace, without help from the authority, dishonest users who have been authenticated beyond the allowable number by using the records of these authentications. Our scheme can be applied to e-voting, e-cash, electronic coupons, and trial browsing of content. In these applications, our scheme, unlike the previous one, conceals users' participation from protocols and guarantees that they will remain anonymous to everyone.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.147/_p
Copy
@ARTICLE{e92-a_1_147,
author={Isamu TERANISHI, Jun FURUKAWA, Kazue SAKO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={k-Times Anonymous Authentication},
year={2009},
volume={E92-A},
number={1},
pages={147-165},
abstract={We propose an authentication scheme in which users can be authenticated anonymously so long as times that they are authenticated is within an allowable number. The proposed scheme has two features: 1) no one, not even an authority, can identify users who have been authenticated within the allowable number, 2) anyone can trace, without help from the authority, dishonest users who have been authenticated beyond the allowable number by using the records of these authentications. Our scheme can be applied to e-voting, e-cash, electronic coupons, and trial browsing of content. In these applications, our scheme, unlike the previous one, conceals users' participation from protocols and guarantees that they will remain anonymous to everyone.},
keywords={},
doi={10.1587/transfun.E92.A.147},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - k-Times Anonymous Authentication
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 147
EP - 165
AU - Isamu TERANISHI
AU - Jun FURUKAWA
AU - Kazue SAKO
PY - 2009
DO - 10.1587/transfun.E92.A.147
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2009
AB - We propose an authentication scheme in which users can be authenticated anonymously so long as times that they are authenticated is within an allowable number. The proposed scheme has two features: 1) no one, not even an authority, can identify users who have been authenticated within the allowable number, 2) anyone can trace, without help from the authority, dishonest users who have been authenticated beyond the allowable number by using the records of these authentications. Our scheme can be applied to e-voting, e-cash, electronic coupons, and trial browsing of content. In these applications, our scheme, unlike the previous one, conceals users' participation from protocols and guarantees that they will remain anonymous to everyone.
ER -
English
