Forward-secure group signatures from pairings

Toru Nakanishi, Yuta Hira, Nobuo Funabiki

研究成果

13 被引用数 (Scopus)

抄録

To reduce the damage of key exposures, forward-secure group signature schemes have been first proposed by Song. In the forward-secure schemes, a secret key of a group member is updated by a one-way function every interval and the previous secret key is erased. Thus, even if a secret key is exposed, the signatures produced by the secret keys of previous intervals remain secure. Since the previous forward-secure group signature schemes are based on the strong RSA assumption, the signatures are longer than pairing-based group signatures. In addition, the complexity of the key update or signing/verification is O(T), where T is the total number of intervals. In this paper, a forward-secure group signature scheme from pairings is proposed. The complexity of our key update and signing/verification is O(logT).

本文言語English
ホスト出版物のタイトルPairing-Based Cryptography - Pairing 2009 - Third International Conference, Proceedings
ページ171-186
ページ数16
DOI
出版ステータスPublished - 2009
イベント3rd International Conference on Pairing-Based Cryptography, Pairing 2009 - Palo Alto, CA
継続期間: 8月 12 20098月 14 2009

出版物シリーズ

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

Other

Other3rd International Conference on Pairing-Based Cryptography, Pairing 2009
国/地域United States
CityPalo Alto, CA
Period8/12/098/14/09

ASJC Scopus subject areas

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

フィンガープリント

「Forward-secure group signatures from pairings」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル