Efficient and provably secure trapdoor-free group signature schemes from bilinear pairings (2004)
| Venue: | In ASIACRYPT 2004, volume 3329 of LNCS |
| Citations: | 19 - 1 self |
BibTeX
@INPROCEEDINGS{Nguyen04efficientand,
author = {Lan Nguyen and Rei Safavi-naini},
title = {Efficient and provably secure trapdoor-free group signature schemes from bilinear pairings},
booktitle = {In ASIACRYPT 2004, volume 3329 of LNCS},
year = {2004},
pages = {372--386},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We propose a group signature scheme with constant-size public key and signature length that does not require trapdoor. So system parameters can be shared by multiple groups belonging to different organizations. The scheme is provably secure in the formal model recently proposed by Bellare, Shi and Zhang (BSZ04), using random oracle model, Decisional Bilinear Diffie-Hellman and Strong Diffie-Hellman assumptions. We give a more efficient variant scheme and prove its security in a formal model which is a modification of BSZ04 model and has a weaker anonymity requirement. Both schemes are very efficient and the sizes of signatures are approximately one half and one third, respectively, of the sizes of the well-known ACJT00 scheme. We also use the schemes to construct a traceable signature scheme. 1
