A group signature scheme with efficient membership revocation for reasonable groups

Toru Nakanishi, Yuji Sugiyama

Research output: Contribution to journalArticle

11 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(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.

Original languageEnglish
Pages (from-to)336-347
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3108
Publication statusPublished - 2004

Fingerprint

Group Signature
Revocation
Group Scheme
Signature Scheme
Joining
Modulus

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{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",
language = "English",
volume = "3108",
pages = "336--347",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

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

M3 - Article

AN - SCOPUS:24144495867

VL - 3108

SP - 336

EP - 347

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -