|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/9066
|
| タイトル: | A Selectable k-Times Relaxed Anonymous Authentication Scheme |
| 著者: | Emura, Keita
Miyaji, Atsuko
Omote, Kazumasa |
| キーワード: | Anonymous Authentication |
| 発行日: | 2009 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 5932/2009 |
| 開始ページ: | 281 |
| 終了ページ: | 295 |
| DOI: | 10.1007/978-3-642-10838-9_21 |
| 抄録: | 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. |
| Rights: | This is the author-created version of Springer, Keita Emura, Atsuko Miyaji, and Kazumasa Omote, Lecture Notes in Computer Science, 5932/2009, 2009, 281-295. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-10838-9_21 |
| URI: | http://hdl.handle.net/10119/9066 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 14528-1.pdf | | 274Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
