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

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