More efficient structure-preserving signatures - or: Bypassing the type-III lower bounds
- Submitting institution
-
University of the West of England, Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 879181
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-319-66399-9_3
- Title of conference / published proceedings
- Computer Security – ESORICS 2017
- First page
- 43
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- August
- Year of publication
- 2017
- URL
-
https://doi.org/10.1007/978-3-319-66399-9_3
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
-
- Citation count
- 3
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper constitutes a proof that existing lower bounds for structure-preserving signatures can be circumvented by assuming that the messages have some special form. The constructions provided are more efficient than existing optimal schemes both in terms of signature size and verification overhead. Our signatures are half the size of existing optimal schemes. This has implication for various applications of the primitive. For instance, a subsequent work has shown that our schemes yield the most efficient instantiations of attribute-based signatures in the standard model.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
