A group signature scheme with efficient membership revocation for reasonable groups

Toru Nakanishi, Yuji Sugiyama

Research output: Chapter in Book/Report/Conference proceedingChapter

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
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsHuaxiong Wang, Josef Pieprzyk, Vijay Varadharajan
PublisherSpringer Verlag
Pages336-347
Number of pages12
ISBN (Print)9783540223795
DOIs
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3108
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)

Fingerprint Dive into the research topics of 'A group signature scheme with efficient membership revocation for reasonable groups'. Together they form a unique fingerprint.

Cite this