Revocable group signatures with compact revocation list using accumulators

Toru Nakanishi, Nobuo Funabiki

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

A group signature scheme allows a group member to anonymously sign a message on behalf of the group. One of the important issues is the member revocation, and lots of revocable schemes have been proposed so far. A scheme recently proposed by Libert et al. Achieves that O(1) or O(log N) efficiency of communication and computation except for the revocation list size (also the revocation cost), for the total number of members N and the number of revoked members R. However, since a signature is required for each subset separated from the set of non-revoked members, the size is about 900R Bytes in the 128-bit security. In the case of R = 100, 000, it amounts to about 80MB. In this paper, we extend the scheme to reduce the revocation list (also the revocation cost), by accumulating T subsets, which is signed for the revocation list. The revocation list size is reduced by 1/T. Unfortunately, the public key size, membership certificate size and the cost of a witness computation needed for signing increase related to T.

Original languageEnglish
Pages (from-to)117-131
Number of pages15
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE98A
Issue number1
DOIs
Publication statusPublished - Jan 1 2015

Keywords

  • Accumulators
  • Anonymity
  • Group signatures
  • Revocations

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Revocable group signatures with compact revocation list using accumulators'. Together they form a unique fingerprint.

Cite this