Efficient member revocation in group signature schemes

Eun Young Choi, Hyun Jeong Kim, Dong Hoon Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Group signature schemes allow a group member to sign messages anonymously on behalf of the group. During last decade, group signature schemes have been intensively investigated in the literature and applied to various applications. Especially, as noted in [3], the complexity of member deletion stands in the way of real world applications of group signatures. In this paper, we propose a group signature scheme with an efficient member revocation procedure. The proposed scheme is based on the scheme [18], which was turned out to be flawed [21]. We modify the scheme in [18] so as to obtain secure and efficient member revocation and unlinkability of signatures. Our revocation method is an improvement over the work of Camenisch and Lysyanskaya [9], which is known to be the most efficient scheme so far.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsS. Katsikas, J. Lopez, G. Pernul
Pages195-205
Number of pages11
Volume3592
Publication statusPublished - 2005
EventSecond International Conference on Trust, Privacy and Security in Digital Business, TrustBus 2005 - Copenhagen, Denmark
Duration: 2005 Aug 222005 Aug 26

Other

OtherSecond International Conference on Trust, Privacy and Security in Digital Business, TrustBus 2005
CountryDenmark
CityCopenhagen
Period05/8/2205/8/26

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Choi, E. Y., Kim, H. J., & Lee, D. H. (2005). Efficient member revocation in group signature schemes. In S. Katsikas, J. Lopez, & G. Pernul (Eds.), Lecture Notes in Computer Science (Vol. 3592, pp. 195-205)

Efficient member revocation in group signature schemes. / Choi, Eun Young; Kim, Hyun Jeong; Lee, Dong Hoon.

Lecture Notes in Computer Science. ed. / S. Katsikas; J. Lopez; G. Pernul. Vol. 3592 2005. p. 195-205.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Choi, EY, Kim, HJ & Lee, DH 2005, Efficient member revocation in group signature schemes. in S Katsikas, J Lopez & G Pernul (eds), Lecture Notes in Computer Science. vol. 3592, pp. 195-205, Second International Conference on Trust, Privacy and Security in Digital Business, TrustBus 2005, Copenhagen, Denmark, 05/8/22.
Choi EY, Kim HJ, Lee DH. Efficient member revocation in group signature schemes. In Katsikas S, Lopez J, Pernul G, editors, Lecture Notes in Computer Science. Vol. 3592. 2005. p. 195-205
Choi, Eun Young ; Kim, Hyun Jeong ; Lee, Dong Hoon. / Efficient member revocation in group signature schemes. Lecture Notes in Computer Science. editor / S. Katsikas ; J. Lopez ; G. Pernul. Vol. 3592 2005. pp. 195-205
@inproceedings{2bcfc8138d074b21b71295444495a06d,
title = "Efficient member revocation in group signature schemes",
abstract = "Group signature schemes allow a group member to sign messages anonymously on behalf of the group. During last decade, group signature schemes have been intensively investigated in the literature and applied to various applications. Especially, as noted in [3], the complexity of member deletion stands in the way of real world applications of group signatures. In this paper, we propose a group signature scheme with an efficient member revocation procedure. The proposed scheme is based on the scheme [18], which was turned out to be flawed [21]. We modify the scheme in [18] so as to obtain secure and efficient member revocation and unlinkability of signatures. Our revocation method is an improvement over the work of Camenisch and Lysyanskaya [9], which is known to be the most efficient scheme so far.",
author = "Choi, {Eun Young} and Kim, {Hyun Jeong} and Lee, {Dong Hoon}",
year = "2005",
language = "English",
volume = "3592",
pages = "195--205",
editor = "S. Katsikas and J. Lopez and G. Pernul",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - Efficient member revocation in group signature schemes

AU - Choi, Eun Young

AU - Kim, Hyun Jeong

AU - Lee, Dong Hoon

PY - 2005

Y1 - 2005

N2 - Group signature schemes allow a group member to sign messages anonymously on behalf of the group. During last decade, group signature schemes have been intensively investigated in the literature and applied to various applications. Especially, as noted in [3], the complexity of member deletion stands in the way of real world applications of group signatures. In this paper, we propose a group signature scheme with an efficient member revocation procedure. The proposed scheme is based on the scheme [18], which was turned out to be flawed [21]. We modify the scheme in [18] so as to obtain secure and efficient member revocation and unlinkability of signatures. Our revocation method is an improvement over the work of Camenisch and Lysyanskaya [9], which is known to be the most efficient scheme so far.

AB - Group signature schemes allow a group member to sign messages anonymously on behalf of the group. During last decade, group signature schemes have been intensively investigated in the literature and applied to various applications. Especially, as noted in [3], the complexity of member deletion stands in the way of real world applications of group signatures. In this paper, we propose a group signature scheme with an efficient member revocation procedure. The proposed scheme is based on the scheme [18], which was turned out to be flawed [21]. We modify the scheme in [18] so as to obtain secure and efficient member revocation and unlinkability of signatures. Our revocation method is an improvement over the work of Camenisch and Lysyanskaya [9], which is known to be the most efficient scheme so far.

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

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

M3 - Conference contribution

VL - 3592

SP - 195

EP - 205

BT - Lecture Notes in Computer Science

A2 - Katsikas, S.

A2 - Lopez, J.

A2 - Pernul, G.

ER -