A Selectable k-Times Relaxed Anonymous Authentication Scheme

DOI 機関リポジトリ

この論文をさがす

説明

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

収録刊行物

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ