Forward-secure group signatures from pairings

Toru Nakanishi, Yuta Hira, Nobuo Funabiki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

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).

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages171-186
Number of pages16
Volume5671 LNCS
DOIs
Publication statusPublished - 2009
Event3rd International Conference on Pairing-Based Cryptography, Pairing 2009 - Palo Alto, CA, United States
Duration: Aug 12 2009Aug 14 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5671 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

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

    Fingerprint

Keywords

  • Anonymity
  • Forward-security
  • Group signatures
  • Pairings

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Nakanishi, T., Hira, Y., & Funabiki, N. (2009). Forward-secure group signatures from pairings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5671 LNCS, pp. 171-186). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5671 LNCS). https://doi.org/10.1007/978-3-642-03298-1_12