- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Search this article
Description
In a k-Times Anonymous Authentication (k-TAA) scheme, Application Providers (APs) authenticates each group member in k times. A user can preserve his/her own privacy and an AP can restrict the number of used services to just k-times, since users are identified if they access an AP more than k times. In all previous schemes, each AP assumes the same k for all users. Added to this, total anonymity of unlinkability requires large computation amount such as pairing computations compared with non-anonymous schemes. In this paper, we propose a selectable k-TAA scheme with relaxed anonymity. Relaxed anonymity is an intermediate level of privacy required between total anonymity and linkability, where authentication executions for the same AP are linkable, but an authentication execution with an AP v0 and an authentication execution with an AP v1 (v0 ≠ v1) are unlinkable. Our authentication algorithm is efficient than existing ones thanks to this relaxed notion.
The 10th International Workshop on Information Security Applications, WISA 2009, Busan, Korea, August 25-27, 2009.
identifier:https://dspace.jaist.ac.jp/dspace/handle/10119/9066
Journal
-
- Lecture Notes in Computer Science
-
Lecture Notes in Computer Science 5932/2009 281-295, 2009
Springer
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1050001337537339136
-
- NII Article ID
- 120002260313
-
- ISSN
- 03029743
-
- Web Site
- http://hdl.handle.net/10119/9066
-
- Text Lang
- en
-
- Article Type
- journal article
-
- Data Source
-
- IRDB
- CiNii Articles
- OpenAIRE