Revocable group signatures with compact revocation list using accumulators

Toru Nakanishi, Nobuo Funabiki

Research output: Contribution to journalArticle

2 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

Fingerprint

Group Signature
Revocation
Costs
Communication
Group Scheme
Subset
Public key
Certificate
Signature Scheme
Signed
Signature

Keywords

  • Accumulators
  • Anonymity
  • Group signatures
  • Revocations

ASJC Scopus subject areas

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

Cite this

@article{01fcdc03feff47469160978ba049155b,
title = "Revocable group signatures with compact revocation list using accumulators",
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.",
keywords = "Accumulators, Anonymity, Group signatures, Revocations",
author = "Toru Nakanishi and Nobuo Funabiki",
year = "2015",
month = "1",
day = "1",
doi = "10.1587/transfun.E98.A.117",
language = "English",
volume = "E98A",
pages = "117--131",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "1",

}

TY - JOUR

T1 - Revocable group signatures with compact revocation list using accumulators

AU - Nakanishi, Toru

AU - Funabiki, Nobuo

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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.

AB - 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.

KW - Accumulators

KW - Anonymity

KW - Group signatures

KW - Revocations

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

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

U2 - 10.1587/transfun.E98.A.117

DO - 10.1587/transfun.E98.A.117

M3 - Article

VL - E98A

SP - 117

EP - 131

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 1

ER -