IEICE TRANSACTIONS on Fundamentals
Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
Summary :
Lots of revocable group signature schemes have been proposed so far. In one type of revocable schemes, signing and/or verifying algorithms have O(N) or O(R) complexity, where N is the group size and R is the number of revoked members. On the other hand, in Camenisch-Lysyanskaya scheme and the followers, signing and verifying algorithms have O(1) complexity. However, before signing, the updates of the secret key are required. The complexity is O(R) in the worst case. In this paper, we propose a revocable scheme with signing and verifying of O(1) complexity, where any update of secret key is not required. The compensation is the long public key of O(N). In addition, we extend it to the scheme with O(
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.1 pp.50-62
- Publication Date
- 2010/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E93.A.50
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- Category
- Digital Signature
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Toru NAKANISHI, Hiroki FUJII, Yuta HIRA, Nobuo FUNABIKI, "Revocable Group Signature Schemes with Constant Costs for Signing and Verifying" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 1, pp. 50-62, January 2010, doi: 10.1587/transfun.E93.A.50.
Abstract: Lots of revocable group signature schemes have been proposed so far. In one type of revocable schemes, signing and/or verifying algorithms have O(N) or O(R) complexity, where N is the group size and R is the number of revoked members. On the other hand, in Camenisch-Lysyanskaya scheme and the followers, signing and verifying algorithms have O(1) complexity. However, before signing, the updates of the secret key are required. The complexity is O(R) in the worst case. In this paper, we propose a revocable scheme with signing and verifying of O(1) complexity, where any update of secret key is not required. The compensation is the long public key of O(N). In addition, we extend it to the scheme with O(
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.50/_p
Copy
@ARTICLE{e93-a_1_50,
author={Toru NAKANISHI, Hiroki FUJII, Yuta HIRA, Nobuo FUNABIKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Revocable Group Signature Schemes with Constant Costs for Signing and Verifying},
year={2010},
volume={E93-A},
number={1},
pages={50-62},
abstract={Lots of revocable group signature schemes have been proposed so far. In one type of revocable schemes, signing and/or verifying algorithms have O(N) or O(R) complexity, where N is the group size and R is the number of revoked members. On the other hand, in Camenisch-Lysyanskaya scheme and the followers, signing and verifying algorithms have O(1) complexity. However, before signing, the updates of the secret key are required. The complexity is O(R) in the worst case. In this paper, we propose a revocable scheme with signing and verifying of O(1) complexity, where any update of secret key is not required. The compensation is the long public key of O(N). In addition, we extend it to the scheme with O(
keywords={},
doi={10.1587/transfun.E93.A.50},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 50
EP - 62
AU - Toru NAKANISHI
AU - Hiroki FUJII
AU - Yuta HIRA
AU - Nobuo FUNABIKI
PY - 2010
DO - 10.1587/transfun.E93.A.50
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2010
AB - Lots of revocable group signature schemes have been proposed so far. In one type of revocable schemes, signing and/or verifying algorithms have O(N) or O(R) complexity, where N is the group size and R is the number of revoked members. On the other hand, in Camenisch-Lysyanskaya scheme and the followers, signing and verifying algorithms have O(1) complexity. However, before signing, the updates of the secret key are required. The complexity is O(R) in the worst case. In this paper, we propose a revocable scheme with signing and verifying of O(1) complexity, where any update of secret key is not required. The compensation is the long public key of O(N). In addition, we extend it to the scheme with O(
ER -
English
