The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
지금까지 많은 취소 가능한 그룹 서명 체계가 제안되었습니다. 취소 가능한 체계의 한 유형에서 서명 및/또는 확인 알고리즘은 다음과 같습니다. O(N) 또는 O(R) 복잡성, 여기서 N 그룹 규모와 R 해임된 회원의 수입니다. 반면 Camenisch-Lysyanskaya 방식과 추종자에서는 서명 및 검증 알고리즘이 O(1) 복잡성. 그러나 서명하기 전에 비밀 키를 업데이트해야 합니다. 복잡성은 O(R) 최악의 경우. 본 논문에서는 서명과 검증을 통해 취소 가능한 방식을 제안한다. O(1) 비밀 키 업데이트가 필요하지 않은 복잡성. 보상은 다음의 긴 공개 키입니다. O(N). 또한, 우리는 이를 다음과 같은 계획으로 확장합니다. O(
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.
부
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
부
@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},}
부
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 -