DMCA
Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-Group signature scheme (2003)
Cached
Download Links
| Venue: | PROCEEDINGS OF PKC 2003, VOLUME 2567 OF LNCS |
| Citations: | 191 - 0 self |
BibTeX
@INPROCEEDINGS{Boldyreva03efficientthreshold,
author = {Alexandra Boldyreva},
title = {Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-Group signature scheme},
booktitle = {PROCEEDINGS OF PKC 2003, VOLUME 2567 OF LNCS},
year = {2003},
pages = {31--46},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We propose a robust proactive threshold signature scheme, a multisignature scheme and a blind signature scheme which work in any Gap Diffie-Hellman (GDH) group (where the Computational Diffie-Hellman problem is hard but the Decisional Diffie-Hellman problem is easy). Our constructions are based on the recently proposed GDH signature scheme of Boneh et al. [8]. Due to the instrumental structure of GDH groups and of the base scheme, it turns out that most of our constructions are simpler, more efficient and have more useful properties than similar existing constructions. We support all the proposed schemes with proofs under the appropriate computational assumptions, using the corresponding notions of security.
Keyphrases
gap-diffie-hellman-group signature scheme signature scheme efficient threshold signature robust proactive threshold signature scheme gdh signature scheme decisional diffie-hellman problem multisignature scheme computational diffie-hellman problem instrumental structure useful property blind signature scheme appropriate computational assumption gap diffie-hellman gdh group base scheme corresponding notion
