The search functionality is under construction.

The search functionality is under construction.

At EUROCRYPT 2012, Libert, Peters and Yung (LPY) proposed the first scalable revocable group signature (R-GS) scheme in the standard model which achieves constant signing/verification costs and other costs regarding signers are at most logarithmic in *N*, where *N* is the maximum number of group members. However, although the LPY R-GS scheme is asymptotically quite efficient, this scheme is not sufficiently efficient in practice. For example, the signature size of the LPY scheme is roughly 10 times larger than that of an RSA signature (for 160-bit security). In this paper, we propose a compact R-GS scheme secure in the random oracle model that is efficient not only in the asymptotic sense but also in practical parameter settings. We achieve the same efficiency as the LPY scheme in an asymptotic sense, and the signature size is nearly equal to that of an RSA signature (for 160-bit security). It is particularly worth noting that our R-GS scheme has the smallest signature size compared to those of previous R-GS schemes which enable constant signing/verification costs. Our technique, which we call parallel Boneh-Boyen-Shacham group signature technique, helps to construct an R-GS scheme without following the technique used in LPY, i.e., we directly apply the Naor-Naor-Lotspiech framework without using any identity-based encryption.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E102-A No.9 pp.1101-1117

- Publication Date
- 2019/09/01

- Publicized

- Online ISSN
- 1745-1337

- DOI
- 10.1587/transfun.E102.A.1101

- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)

- Category
- Cryptography and Information Security

Kazuma OHARA

The University of Electro-Communications

Keita EMURA

National Institute of Information and Communications Technology (NICT)

Goichiro HANAOKA

National Institute of Advanced Industrial Science and Technology

Ai ISHIDA

National Institute of Advanced Industrial Science and Technology

Kazuo OHTA

The University of Electro-Communications

Yusuke SAKAI

National Institute of Advanced Industrial Science and Technology

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

Kazuma OHARA, Keita EMURA, Goichiro HANAOKA, Ai ISHIDA, Kazuo OHTA, Yusuke SAKAI, "Shortening the Libert-Peters-Yung Revocable Group Signature Scheme by Using the Random Oracle Methodology" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 9, pp. 1101-1117, September 2019, doi: 10.1587/transfun.E102.A.1101.

Abstract: At EUROCRYPT 2012, Libert, Peters and Yung (LPY) proposed the first scalable revocable group signature (R-GS) scheme in the standard model which achieves constant signing/verification costs and other costs regarding signers are at most logarithmic in *N*, where *N* is the maximum number of group members. However, although the LPY R-GS scheme is asymptotically quite efficient, this scheme is not sufficiently efficient in practice. For example, the signature size of the LPY scheme is roughly 10 times larger than that of an RSA signature (for 160-bit security). In this paper, we propose a compact R-GS scheme secure in the random oracle model that is efficient not only in the asymptotic sense but also in practical parameter settings. We achieve the same efficiency as the LPY scheme in an asymptotic sense, and the signature size is nearly equal to that of an RSA signature (for 160-bit security). It is particularly worth noting that our R-GS scheme has the smallest signature size compared to those of previous R-GS schemes which enable constant signing/verification costs. Our technique, which we call parallel Boneh-Boyen-Shacham group signature technique, helps to construct an R-GS scheme without following the technique used in LPY, i.e., we directly apply the Naor-Naor-Lotspiech framework without using any identity-based encryption.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.1101/_p

Copy

@ARTICLE{e102-a_9_1101,

author={Kazuma OHARA, Keita EMURA, Goichiro HANAOKA, Ai ISHIDA, Kazuo OHTA, Yusuke SAKAI, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={Shortening the Libert-Peters-Yung Revocable Group Signature Scheme by Using the Random Oracle Methodology},

year={2019},

volume={E102-A},

number={9},

pages={1101-1117},

abstract={At EUROCRYPT 2012, Libert, Peters and Yung (LPY) proposed the first scalable revocable group signature (R-GS) scheme in the standard model which achieves constant signing/verification costs and other costs regarding signers are at most logarithmic in *N*, where *N* is the maximum number of group members. However, although the LPY R-GS scheme is asymptotically quite efficient, this scheme is not sufficiently efficient in practice. For example, the signature size of the LPY scheme is roughly 10 times larger than that of an RSA signature (for 160-bit security). In this paper, we propose a compact R-GS scheme secure in the random oracle model that is efficient not only in the asymptotic sense but also in practical parameter settings. We achieve the same efficiency as the LPY scheme in an asymptotic sense, and the signature size is nearly equal to that of an RSA signature (for 160-bit security). It is particularly worth noting that our R-GS scheme has the smallest signature size compared to those of previous R-GS schemes which enable constant signing/verification costs. Our technique, which we call parallel Boneh-Boyen-Shacham group signature technique, helps to construct an R-GS scheme without following the technique used in LPY, i.e., we directly apply the Naor-Naor-Lotspiech framework without using any identity-based encryption.},

keywords={},

doi={10.1587/transfun.E102.A.1101},

ISSN={1745-1337},

month={September},}

Copy

TY - JOUR

TI - Shortening the Libert-Peters-Yung Revocable Group Signature Scheme by Using the Random Oracle Methodology

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 1101

EP - 1117

AU - Kazuma OHARA

AU - Keita EMURA

AU - Goichiro HANAOKA

AU - Ai ISHIDA

AU - Kazuo OHTA

AU - Yusuke SAKAI

PY - 2019

DO - 10.1587/transfun.E102.A.1101

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E102-A

IS - 9

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - September 2019

AB - At EUROCRYPT 2012, Libert, Peters and Yung (LPY) proposed the first scalable revocable group signature (R-GS) scheme in the standard model which achieves constant signing/verification costs and other costs regarding signers are at most logarithmic in *N*, where *N* is the maximum number of group members. However, although the LPY R-GS scheme is asymptotically quite efficient, this scheme is not sufficiently efficient in practice. For example, the signature size of the LPY scheme is roughly 10 times larger than that of an RSA signature (for 160-bit security). In this paper, we propose a compact R-GS scheme secure in the random oracle model that is efficient not only in the asymptotic sense but also in practical parameter settings. We achieve the same efficiency as the LPY scheme in an asymptotic sense, and the signature size is nearly equal to that of an RSA signature (for 160-bit security). It is particularly worth noting that our R-GS scheme has the smallest signature size compared to those of previous R-GS schemes which enable constant signing/verification costs. Our technique, which we call parallel Boneh-Boyen-Shacham group signature technique, helps to construct an R-GS scheme without following the technique used in LPY, i.e., we directly apply the Naor-Naor-Lotspiech framework without using any identity-based encryption.

ER -