Novel ID-based group signature

Yuh Min Tseng, Jinn Ke Jan

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

Group signatures, first introduced by Chaum and Heyst at Eurocrypt'91, allow individual members of a group to make signatures on behalf of the group while providing the signer's anonymity. Most of the previously proposed group signature schemes are based on the discrete logarithm problem, the public keys of users are not identity information, except for the ID-based scheme proposed by Park et al. in 1997. However, Park et al.'s scheme has a serious problem, which is that all of the previous group signatures signed by other members will be no longer valid if the group is changed. Moreover, the length of the group signature grows linearly with the number of group members, which makes their proposed scheme inefficient. In this paper, the authors propose a novel ID-based group signature scheme which can solve the problem raised by the inclusion of a new group member or the exclusion of all old group member. Meanwhile, compared to Park et al.'s scheme, our scheme requires less computing time for generating the group signature and verifying the group signature. The security of the proposed ID-based group signature scheme is based on the difficulty of computing the discrete logarithm modulo for a composite number.

Original languageEnglish
Pages (from-to)131-141
Number of pages11
JournalInformation Sciences
Volume120
Issue number1
DOIs
Publication statusPublished - 1999 Jan 1

Fingerprint

Group Signature
Identity-based
Composite materials
Group Scheme
Signature Scheme
Composite number
Discrete Logarithm Problem
Discrete Logarithm
Computing
Anonymity
Public key
Signed
Modulo
Signature
Inclusion
Linearly
Valid
Exclusion

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Cite this

Tseng, Yuh Min ; Jan, Jinn Ke. / Novel ID-based group signature. In: Information Sciences. 1999 ; Vol. 120, No. 1. pp. 131-141.
@article{eee80bcc1a6f4bfe9507e59dbf6338b1,
title = "Novel ID-based group signature",
abstract = "Group signatures, first introduced by Chaum and Heyst at Eurocrypt'91, allow individual members of a group to make signatures on behalf of the group while providing the signer's anonymity. Most of the previously proposed group signature schemes are based on the discrete logarithm problem, the public keys of users are not identity information, except for the ID-based scheme proposed by Park et al. in 1997. However, Park et al.'s scheme has a serious problem, which is that all of the previous group signatures signed by other members will be no longer valid if the group is changed. Moreover, the length of the group signature grows linearly with the number of group members, which makes their proposed scheme inefficient. In this paper, the authors propose a novel ID-based group signature scheme which can solve the problem raised by the inclusion of a new group member or the exclusion of all old group member. Meanwhile, compared to Park et al.'s scheme, our scheme requires less computing time for generating the group signature and verifying the group signature. The security of the proposed ID-based group signature scheme is based on the difficulty of computing the discrete logarithm modulo for a composite number.",
author = "Tseng, {Yuh Min} and Jan, {Jinn Ke}",
year = "1999",
month = "1",
day = "1",
doi = "10.1016/S0020-0255(99)00086-9",
language = "English",
volume = "120",
pages = "131--141",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "1",

}

Novel ID-based group signature. / Tseng, Yuh Min; Jan, Jinn Ke.

In: Information Sciences, Vol. 120, No. 1, 01.01.1999, p. 131-141.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Novel ID-based group signature

AU - Tseng, Yuh Min

AU - Jan, Jinn Ke

PY - 1999/1/1

Y1 - 1999/1/1

N2 - Group signatures, first introduced by Chaum and Heyst at Eurocrypt'91, allow individual members of a group to make signatures on behalf of the group while providing the signer's anonymity. Most of the previously proposed group signature schemes are based on the discrete logarithm problem, the public keys of users are not identity information, except for the ID-based scheme proposed by Park et al. in 1997. However, Park et al.'s scheme has a serious problem, which is that all of the previous group signatures signed by other members will be no longer valid if the group is changed. Moreover, the length of the group signature grows linearly with the number of group members, which makes their proposed scheme inefficient. In this paper, the authors propose a novel ID-based group signature scheme which can solve the problem raised by the inclusion of a new group member or the exclusion of all old group member. Meanwhile, compared to Park et al.'s scheme, our scheme requires less computing time for generating the group signature and verifying the group signature. The security of the proposed ID-based group signature scheme is based on the difficulty of computing the discrete logarithm modulo for a composite number.

AB - Group signatures, first introduced by Chaum and Heyst at Eurocrypt'91, allow individual members of a group to make signatures on behalf of the group while providing the signer's anonymity. Most of the previously proposed group signature schemes are based on the discrete logarithm problem, the public keys of users are not identity information, except for the ID-based scheme proposed by Park et al. in 1997. However, Park et al.'s scheme has a serious problem, which is that all of the previous group signatures signed by other members will be no longer valid if the group is changed. Moreover, the length of the group signature grows linearly with the number of group members, which makes their proposed scheme inefficient. In this paper, the authors propose a novel ID-based group signature scheme which can solve the problem raised by the inclusion of a new group member or the exclusion of all old group member. Meanwhile, compared to Park et al.'s scheme, our scheme requires less computing time for generating the group signature and verifying the group signature. The security of the proposed ID-based group signature scheme is based on the difficulty of computing the discrete logarithm modulo for a composite number.

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

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

U2 - 10.1016/S0020-0255(99)00086-9

DO - 10.1016/S0020-0255(99)00086-9

M3 - Article

AN - SCOPUS:0033337817

VL - 120

SP - 131

EP - 141

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 1

ER -