A Group Signature Scheme with Efficient Membership Revocation for Middle-Scale Groups

Toru NAKANISHI; Yuji SUGIYAMA

doi:10.1093/ietfec/e88-a.5.1224

A Group Signature Scheme with Efficient Membership Revocation for Middle-Scale Groups

Toru NAKANISHI, Yuji SUGIYAMA

Full Text Views

0

Share
Cite this

Summary :

This paper proposes a group signature scheme with efficient membership revocation. Though group signature schemes with efficient membership revocation based on a dynamic accumulator were proposed, the previous schemes force a member to change his secret key whenever he makes a signature. Furthermore, for the modification, the member has to obtain a public membership information of O(_nN) bits, where _n is the length of the RSA modulus and N is the total number of joining members and removed members. In our scheme, the signer needs no modification of his secret, and the public membership information has only K bits, where K is the maximal number of members. Then, for middle-scale groups with the size that is comparable to the RSA modulus size (e.g., up to about 1000 members for 1024 bit RSA modulus), the public membership information is a single small value only, while the signing/verification also remains efficient.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.5 pp.1224-1233

Publication Date: 2005/05/01

Publicized

Online ISSN

DOI: 10.1093/ietfec/e88-a.5.1224

Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)

Category

Cite this

Copy

Toru NAKANISHI, Yuji SUGIYAMA, "A Group Signature Scheme with Efficient Membership Revocation for Middle-Scale Groups" in IEICE TRANSACTIONS on Fundamentals, vol. E88-A, no. 5, pp. 1224-1233, May 2005, doi: 10.1093/ietfec/e88-a.5.1224.
Abstract: This paper proposes a group signature scheme with efficient membership revocation. Though group signature schemes with efficient membership revocation based on a dynamic accumulator were proposed, the previous schemes force a member to change his secret key whenever he makes a signature. Furthermore, for the modification, the member has to obtain a public membership information of O(_nN) bits, where _n is the length of the RSA modulus and N is the total number of joining members and removed members. In our scheme, the signer needs no modification of his secret, and the public membership information has only K bits, where K is the maximal number of members. Then, for middle-scale groups with the size that is comparable to the RSA modulus size (e.g., up to about 1000 members for 1024 bit RSA modulus), the public membership information is a single small value only, while the signing/verification also remains efficient.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.5.1224/_p

Copy

@ARTICLE{e88-a_5_1224,
author={Toru NAKANISHI, Yuji SUGIYAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Group Signature Scheme with Efficient Membership Revocation for Middle-Scale Groups},
year={2005},
volume={E88-A},
number={5},
pages={1224-1233},
abstract={This paper proposes a group signature scheme with efficient membership revocation. Though group signature schemes with efficient membership revocation based on a dynamic accumulator were proposed, the previous schemes force a member to change his secret key whenever he makes a signature. Furthermore, for the modification, the member has to obtain a public membership information of O(_nN) bits, where _n is the length of the RSA modulus and N is the total number of joining members and removed members. In our scheme, the signer needs no modification of his secret, and the public membership information has only K bits, where K is the maximal number of members. Then, for middle-scale groups with the size that is comparable to the RSA modulus size (e.g., up to about 1000 members for 1024 bit RSA modulus), the public membership information is a single small value only, while the signing/verification also remains efficient.},
keywords={},
doi={10.1093/ietfec/e88-a.5.1224},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - A Group Signature Scheme with Efficient Membership Revocation for Middle-Scale Groups
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1224
EP - 1233
AU - Toru NAKANISHI
AU - Yuji SUGIYAMA
PY - 2005
DO - 10.1093/ietfec/e88-a.5.1224
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2005
AB - This paper proposes a group signature scheme with efficient membership revocation. Though group signature schemes with efficient membership revocation based on a dynamic accumulator were proposed, the previous schemes force a member to change his secret key whenever he makes a signature. Furthermore, for the modification, the member has to obtain a public membership information of O(_nN) bits, where _n is the length of the RSA modulus and N is the total number of joining members and removed members. In our scheme, the signer needs no modification of his secret, and the public membership information has only K bits, where K is the maximal number of members. Then, for middle-scale groups with the size that is comparable to the RSA modulus size (e.g., up to about 1000 members for 1024 bit RSA modulus), the public membership information is a single small value only, while the signing/verification also remains efficient.
ER -