The search functionality is under construction.

The search functionality is under construction.

Group signatures are signatures providing signer anonymity where signers can produce signatures on behalf of the group that they belong to. Although such anonymity is quite attractive considering privacy issues, it is not trivial to check whether a signer has been revoked or not. Thus, how to revoke the rights of signers is one of the major topics in the research on group signatures. In particular, scalability, where the signing and verification costs and the signature size are constant in terms of the number of signers *N*, and other costs regarding signers are at most logarithmic in *N*, is quite important. In this paper, we propose a revocable group signature scheme which is currently more efficient compared to previous all scalable schemes. Moreover, our revocable group signature scheme is secure under simple assumptions (in the random oracle model), whereas all scalable schemes are secure under *q*-type assumptions. We implemented our scheme by employing a Barreto-Lynn-Scott curve of embedding degree 12 over a 455-bit prime field (BLS-12-455), and a Barreto-Naehrig curve of embedding degree 12 over a 382-bit prime field (BN-12-382), respectively, by using the RELIC library. We showed that the online running times of our signing algorithm were approximately 14msec (BLS-12-455) and 11msec (BN-12-382), and those of our verification algorithm were approximately 20msec (BLS-12-455) and 16msec (BN-12-382), respectively. Finally, we showed that our scheme (with a slight extension) is applied to an identity management system proposed by Isshiki et al.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E103-A No.1 pp.125-140

- Publication Date
- 2020/01/01

- Publicized

- Online ISSN
- 1745-1337

- DOI
- 10.1587/transfun.2019CIP0004

- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)

- Category

Keita EMURA

National Institute of Information and Communications Technology (NICT)

Takuya HAYASHI

National Institute of Information and Communications Technology (NICT)

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Keita EMURA, Takuya HAYASHI, "A Revocable Group Signature Scheme with Scalability from Simple Assumptions" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 1, pp. 125-140, January 2020, doi: 10.1587/transfun.2019CIP0004.

Abstract: Group signatures are signatures providing signer anonymity where signers can produce signatures on behalf of the group that they belong to. Although such anonymity is quite attractive considering privacy issues, it is not trivial to check whether a signer has been revoked or not. Thus, how to revoke the rights of signers is one of the major topics in the research on group signatures. In particular, scalability, where the signing and verification costs and the signature size are constant in terms of the number of signers *N*, and other costs regarding signers are at most logarithmic in *N*, is quite important. In this paper, we propose a revocable group signature scheme which is currently more efficient compared to previous all scalable schemes. Moreover, our revocable group signature scheme is secure under simple assumptions (in the random oracle model), whereas all scalable schemes are secure under *q*-type assumptions. We implemented our scheme by employing a Barreto-Lynn-Scott curve of embedding degree 12 over a 455-bit prime field (BLS-12-455), and a Barreto-Naehrig curve of embedding degree 12 over a 382-bit prime field (BN-12-382), respectively, by using the RELIC library. We showed that the online running times of our signing algorithm were approximately 14msec (BLS-12-455) and 11msec (BN-12-382), and those of our verification algorithm were approximately 20msec (BLS-12-455) and 16msec (BN-12-382), respectively. Finally, we showed that our scheme (with a slight extension) is applied to an identity management system proposed by Isshiki et al.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019CIP0004/_p

Copy

@ARTICLE{e103-a_1_125,

author={Keita EMURA, Takuya HAYASHI, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={A Revocable Group Signature Scheme with Scalability from Simple Assumptions},

year={2020},

volume={E103-A},

number={1},

pages={125-140},

abstract={Group signatures are signatures providing signer anonymity where signers can produce signatures on behalf of the group that they belong to. Although such anonymity is quite attractive considering privacy issues, it is not trivial to check whether a signer has been revoked or not. Thus, how to revoke the rights of signers is one of the major topics in the research on group signatures. In particular, scalability, where the signing and verification costs and the signature size are constant in terms of the number of signers *N*, and other costs regarding signers are at most logarithmic in *N*, is quite important. In this paper, we propose a revocable group signature scheme which is currently more efficient compared to previous all scalable schemes. Moreover, our revocable group signature scheme is secure under simple assumptions (in the random oracle model), whereas all scalable schemes are secure under *q*-type assumptions. We implemented our scheme by employing a Barreto-Lynn-Scott curve of embedding degree 12 over a 455-bit prime field (BLS-12-455), and a Barreto-Naehrig curve of embedding degree 12 over a 382-bit prime field (BN-12-382), respectively, by using the RELIC library. We showed that the online running times of our signing algorithm were approximately 14msec (BLS-12-455) and 11msec (BN-12-382), and those of our verification algorithm were approximately 20msec (BLS-12-455) and 16msec (BN-12-382), respectively. Finally, we showed that our scheme (with a slight extension) is applied to an identity management system proposed by Isshiki et al.},

keywords={},

doi={10.1587/transfun.2019CIP0004},

ISSN={1745-1337},

month={January},}

Copy

TY - JOUR

TI - A Revocable Group Signature Scheme with Scalability from Simple Assumptions

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 125

EP - 140

AU - Keita EMURA

AU - Takuya HAYASHI

PY - 2020

DO - 10.1587/transfun.2019CIP0004

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E103-A

IS - 1

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - January 2020

AB - Group signatures are signatures providing signer anonymity where signers can produce signatures on behalf of the group that they belong to. Although such anonymity is quite attractive considering privacy issues, it is not trivial to check whether a signer has been revoked or not. Thus, how to revoke the rights of signers is one of the major topics in the research on group signatures. In particular, scalability, where the signing and verification costs and the signature size are constant in terms of the number of signers *N*, and other costs regarding signers are at most logarithmic in *N*, is quite important. In this paper, we propose a revocable group signature scheme which is currently more efficient compared to previous all scalable schemes. Moreover, our revocable group signature scheme is secure under simple assumptions (in the random oracle model), whereas all scalable schemes are secure under *q*-type assumptions. We implemented our scheme by employing a Barreto-Lynn-Scott curve of embedding degree 12 over a 455-bit prime field (BLS-12-455), and a Barreto-Naehrig curve of embedding degree 12 over a 382-bit prime field (BN-12-382), respectively, by using the RELIC library. We showed that the online running times of our signing algorithm were approximately 14msec (BLS-12-455) and 11msec (BN-12-382), and those of our verification algorithm were approximately 20msec (BLS-12-455) and 16msec (BN-12-382), respectively. Finally, we showed that our scheme (with a slight extension) is applied to an identity management system proposed by Isshiki et al.

ER -