k-Times Anonymous Authentication with a constant proving cost

Isamu Teranishi*, Kazue Sako

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

研究成果: Conference contribution

44 被引用数 (Scopus)

抄録

A k-Times Anonymous Authentication (k-TAA) scheme allows users to be authenticated anonymously so long as the number of times that they are authenticated is within an allowable number. Some promising applications are e-voting, e-cash, e-coupons, and trial browsing of contents. However, the previous schemes are not efficient in the case where the allowable number k is large, since they require both users and verifiers to compute O(k) exponentiation in each authentication. We propose a k-TAA scheme where the numbers of exponentiations required for the entities in an authentication are independent of k. Moreover, we propose a notion of public detectability in a k-TAA scheme and present an efficient publicly verifiable k-TAA scheme, where the number of modular exponentiations required for the entities is O(log(k)).

本文言語English
ホスト出版物のタイトルPublic Key Cryptography - PKC 2006 - 9th International Conference on Theory and Practice in Public-Key Cryptography, Proceedings
ページ525-542
ページ数18
DOI
出版ステータスPublished - 2006
外部発表はい
イベント9th International Conference on Theory and Practice in Public-Key Cryptography, PKC 2006 - New York, NY, United States
継続期間: 2006 4月 242006 4月 26

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
3958 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

Conference9th International Conference on Theory and Practice in Public-Key Cryptography, PKC 2006
国/地域United States
CityNew York, NY
Period06/4/2406/4/26

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「k-Times Anonymous Authentication with a constant proving cost」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル