A group signature scheme with efficient membership revocation for reasonable groups

Toru Nakanishi; Yuji Sugiyama

doi:10.1007/978-3-540-27800-9_29

A group signature scheme with efficient membership revocation for reasonable groups

Toru Nakanishi, Yuji Sugiyama

Graduate School of Natural Science and Technology

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

13 Citations (Scopus)

Abstract

Though group signature schemes with efficient membership revocation were proposed, the previous schemes force a member to obtain a public membership information of 0(l_nN) bits, where l_n., is the length of the RSA modulus and N is the number of members joining and removed. In the scheme proposed in this paper, the public membership information has only K bits, where K is the number of members' joining. Then, for groups with a reasonable size that is comparable to the RSA modulus size (e.g., 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.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Huaxiong Wang, Josef Pieprzyk, Vijay Varadharajan
Publisher	Springer Verlag
Pages	336-347
Number of pages	12
ISBN (Print)	9783540223795
DOIs	https://doi.org/10.1007/978-3-540-27800-9_29
Publication status	Published - 2004

Publication series

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

Keywords

Group signature scheme
Membership revocation
Strong RSA assumption
Zero-knowledge proof of integer relations

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-27800-9_29

Cite this

Nakanishi, T., & Sugiyama, Y. (2004). A group signature scheme with efficient membership revocation for reasonable groups. In H. Wang, J. Pieprzyk, & V. Varadharajan (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 336-347). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3108). Springer Verlag. https://doi.org/10.1007/978-3-540-27800-9_29

A group signature scheme with efficient membership revocation for reasonable groups. / Nakanishi, Toru; Sugiyama, Yuji.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Huaxiong Wang; Josef Pieprzyk; Vijay Varadharajan. Springer Verlag, 2004. p. 336-347 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3108).

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

Nakanishi, T & Sugiyama, Y 2004, A group signature scheme with efficient membership revocation for reasonable groups. in H Wang, J Pieprzyk & V Varadharajan (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3108, Springer Verlag, pp. 336-347. https://doi.org/10.1007/978-3-540-27800-9_29

Nakanishi T, Sugiyama Y. A group signature scheme with efficient membership revocation for reasonable groups. In Wang H, Pieprzyk J, Varadharajan V, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 336-347. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-27800-9_29

Nakanishi, Toru ; Sugiyama, Yuji. / A group signature scheme with efficient membership revocation for reasonable groups. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Huaxiong Wang ; Josef Pieprzyk ; Vijay Varadharajan. Springer Verlag, 2004. pp. 336-347 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{228d864dfab845dbbc0c8e7124832850,

title = "A group signature scheme with efficient membership revocation for reasonable groups",

abstract = "Though group signature schemes with efficient membership revocation were proposed, the previous schemes force a member to obtain a public membership information of 0(lnN) bits, where ln., is the length of the RSA modulus and N is the number of members joining and removed. In the scheme proposed in this paper, the public membership information has only K bits, where K is the number of members' joining. Then, for groups with a reasonable size that is comparable to the RSA modulus size (e.g., 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 = "Group signature scheme, Membership revocation, Strong RSA assumption, Zero-knowledge proof of integer relations",

author = "Toru Nakanishi and Yuji Sugiyama",

year = "2004",

doi = "10.1007/978-3-540-27800-9_29",

language = "English",

isbn = "9783540223795",

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

publisher = "Springer Verlag",

pages = "336--347",

editor = "Huaxiong Wang and Josef Pieprzyk and Vijay Varadharajan",

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

}

TY - CHAP

T1 - A group signature scheme with efficient membership revocation for reasonable groups

AU - Nakanishi, Toru

AU - Sugiyama, Yuji

PY - 2004

Y1 - 2004

N2 - Though group signature schemes with efficient membership revocation were proposed, the previous schemes force a member to obtain a public membership information of 0(lnN) bits, where ln., is the length of the RSA modulus and N is the number of members joining and removed. In the scheme proposed in this paper, the public membership information has only K bits, where K is the number of members' joining. Then, for groups with a reasonable size that is comparable to the RSA modulus size (e.g., 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.

AB - Though group signature schemes with efficient membership revocation were proposed, the previous schemes force a member to obtain a public membership information of 0(lnN) bits, where ln., is the length of the RSA modulus and N is the number of members joining and removed. In the scheme proposed in this paper, the public membership information has only K bits, where K is the number of members' joining. Then, for groups with a reasonable size that is comparable to the RSA modulus size (e.g., 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.

KW - Group signature scheme

KW - Membership revocation

KW - Strong RSA assumption

KW - Zero-knowledge proof of integer relations

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

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

U2 - 10.1007/978-3-540-27800-9_29

DO - 10.1007/978-3-540-27800-9_29

M3 - Chapter

AN - SCOPUS:24144495867

SN - 9783540223795

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

SP - 336

EP - 347

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

A2 - Wang, Huaxiong

A2 - Pieprzyk, Josef

A2 - Varadharajan, Vijay

PB - Springer Verlag

ER -

A group signature scheme with efficient membership revocation for reasonable groups

Abstract

Publication series

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this