K-times anonymous authentication

Isamu Teranishi*, Jun Furukawa, Kazue Sako

*この研究の対応する著者

研究成果: Article査読

9 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)147-165
ページ数19
ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E92-A
1
DOI
出版ステータスPublished - 2009 1月
外部発表はい

ASJC Scopus subject areas

  • 信号処理
  • コンピュータ グラフィックスおよびコンピュータ支援設計
  • 電子工学および電気工学
  • 応用数学

フィンガープリント

「K-times anonymous authentication」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル