Paper Info
Title
Shortening The Libert-Peters-Yung Revocable Group Signature Scheme By Using The Random Oracle Methodology
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.
Year
DOI
Venue
2016
10.1587/transfun.E102.A.1101
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Keywords
Field
DocType
group signature, revocation, scalability
Discrete mathematics,Random oracle,Theoretical computer science,Group signature,Mathematics
Journal
Volume
Issue
ISSN
E102A
9
0916-8508
Citations 
PageRank 
References 
1
0.34
0
Authors
6
Name
Order
Citations
PageRank
Kazuma Ohara1745.34
Keita Emura231636.97
Goichiro Hanaoka3910101.53
Ai Ishida452.81
Kazuo Ohta559763.83
Yusuke Sakai6198.19