Forward-secure group signatures from pairings

Toru Nakanishi; Yuta Hira; Nobuo Funabiki

doi:10.1007/978-3-642-03298-1_12

Forward-secure group signatures from pairings

Toru Nakanishi, Yuta Hira, Nobuo Funabiki

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

13 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 language	English
Title of host publication	Pairing-Based Cryptography - Pairing 2009 - Third International Conference, Proceedings
Pages	171-186
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-03298-1_12
Publication status	Published - 2009
Event	3rd International Conference on Pairing-Based Cryptography, Pairing 2009 - Palo Alto, CA, United States Duration: Aug 12 2009 → Aug 14 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5671 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	3rd International Conference on Pairing-Based Cryptography, Pairing 2009
Country/Territory	United States
City	Palo Alto, CA
Period	8/12/09 → 8/14/09

Keywords

Anonymity
Forward-security
Group signatures
Pairings

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-03298-1_12

Cite this

Nakanishi, T., Hira, Y., & Funabiki, N. (2009). Forward-secure group signatures from pairings. In Pairing-Based Cryptography - Pairing 2009 - Third International Conference, Proceedings (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

Forward-secure group signatures from pairings. / Nakanishi, Toru; Hira, Yuta; Funabiki, Nobuo.
Pairing-Based Cryptography - Pairing 2009 - Third International Conference, Proceedings. 2009. p. 171-186 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5671 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Nakanishi, T, Hira, Y & Funabiki, N 2009, Forward-secure group signatures from pairings. in Pairing-Based Cryptography - Pairing 2009 - Third International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5671 LNCS, pp. 171-186, 3rd International Conference on Pairing-Based Cryptography, Pairing 2009, Palo Alto, CA, United States, 8/12/09. https://doi.org/10.1007/978-3-642-03298-1_12

@inproceedings{800cf4b0cd844024850210807d5cc03f,

title = "Forward-secure group signatures from pairings",

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

keywords = "Anonymity, Forward-security, Group signatures, Pairings",

author = "Toru Nakanishi and Yuta Hira and Nobuo Funabiki",

year = "2009",

doi = "10.1007/978-3-642-03298-1_12",

language = "English",

isbn = "3642032974",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "171--186",

booktitle = "Pairing-Based Cryptography - Pairing 2009 - Third International Conference, Proceedings",

note = "3rd International Conference on Pairing-Based Cryptography, Pairing 2009 ; Conference date: 12-08-2009 Through 14-08-2009",

}

TY - GEN

T1 - Forward-secure group signatures from pairings

AU - Nakanishi, Toru

AU - Hira, Yuta

AU - Funabiki, Nobuo

PY - 2009

Y1 - 2009

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

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

KW - Anonymity

KW - Forward-security

KW - Group signatures

KW - Pairings

UR - http://www.scopus.com/inward/record.url?scp=69949177579&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=69949177579&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-03298-1_12

DO - 10.1007/978-3-642-03298-1_12

M3 - Conference contribution

AN - SCOPUS:69949177579

SN - 3642032974

SN - 9783642032974

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 171

EP - 186

BT - Pairing-Based Cryptography - Pairing 2009 - Third International Conference, Proceedings

T2 - 3rd International Conference on Pairing-Based Cryptography, Pairing 2009

Y2 - 12 August 2009 through 14 August 2009

ER -

Forward-secure group signatures from pairings

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this