Abstract
To reduce the damage of key exposures, forward-secure group signature schemes have been first proposed by Song. In the forwardsecure 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(log T).
| Original language | English |
|---|---|
| Pages (from-to) | 2007-2016 |
| Number of pages | 10 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E93-A |
| Issue number | 11 |
| DOIs | |
| Publication status | Published - Nov 2010 |
Fingerprint
Keywords
- Anonymity
- Forward-security
- Group signatures
- Pairings
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Computer Graphics and Computer-Aided Design
- Applied Mathematics
- Signal Processing
Cite this
Forward-secure group signatures from pairings. / Nakanishi, Toru; Hira, Yuta; Funabiki, Nobuo.
In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E93-A, No. 11, 11.2010, p. 2007-2016.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Forward-secure group signatures from pairings
AU - Nakanishi, Toru
AU - Hira, Yuta
AU - Funabiki, Nobuo
PY - 2010/11
Y1 - 2010/11
N2 - To reduce the damage of key exposures, forward-secure group signature schemes have been first proposed by Song. In the forwardsecure 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(log T).
AB - To reduce the damage of key exposures, forward-secure group signature schemes have been first proposed by Song. In the forwardsecure 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(log T).
KW - Anonymity
KW - Forward-security
KW - Group signatures
KW - Pairings
UR - http://www.scopus.com/inward/record.url?scp=78049504518&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78049504518&partnerID=8YFLogxK
U2 - 10.1587/transfun.E93.A.2007
DO - 10.1587/transfun.E93.A.2007
M3 - Article
VL - E93-A
SP - 2007
EP - 2016
JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
SN - 0916-8508
IS - 11
ER -