Essam Ghadafi Essam.Ghadafi@uwe.ac.uk
Senior Lecturer in Computer Science
How low can you go? Short structure-preserving signatures for Diffie-Hellman vectors
Ghadafi, Essam
Authors
Contributors
M�ire O'Neill
Editor
Abstract
Structure-Preserving Signatures (SPSs) are an important tool for the design of modular cryptographic protocols.
It has been proven that such schemes in the most efficient Type-3 bilinear group setting have a lower bound of 3-element signatures, which must include elements from both base groups, and a verification overhead of at least 2 Pairing-Product Equations (PPEs). Very recently, Ghadafi (ESORICS 2017) showed that by restricting the message space to the set of Diffie-Hellman pairs (which does not hinder applicability of the schemes), some of the existing lower bounds for the single message case can be circumvented. However, the case of signing multiple messages, which is required for many applications, was left as an open problem since the techniques used for signing single messages do not seem to lend themselves to the
multi-message setting. In this work we investigate this setting and answer the question in the affirmative. We construct schemes that sign vectors of messages and which yield shorter signatures than optimal schemes for vectors of unilateral messages.
More precisely, we construct 2 fully randomiazble schemes that sign vectors of Diffie-Hellman pairs yielding signatures consisting of only 2 elements regardless of the size of the vector signed. We also construct a unilateral scheme that signs a pair of messages yielding signatures consisting of 3 elements from the shorter base group. All of our schemes require a single PPE for verification (not counting the cost of verifying the well-formedness of the messages). Thus, all of our schemes compare favourably to all existing schemes with respect to signature size and verification overhead.
Even when considering single messages, our first 2 schemes compare favourably to the best existing schemes in many aspects including the verification overhead and the key size.
Publication Date | Dec 12, 2017 |
---|---|
Deposit Date | Sep 18, 2017 |
Peer Reviewed | Peer Reviewed |
Book Title | 16th IMA International Conference on Cryptography and Coding |
Keywords | digital signatures, structure-preserving signatures, type-3 groups |
Public URL | https://uwe-repository.worktribe.com/output/877277 |
Contract Date | Sep 18, 2017 |
You might also like
Attribute-based signatures with user-controlled linkability
(2014)
Presentation / Conference Contribution
Decentralized traceable attribute-based signatures
(2014)
Presentation / Conference Contribution
Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions
(2015)
Presentation / Conference Contribution
Efficient Distributed tag-based encryption and its application to group signatures with efficient distributed traceability
(2015)
Presentation / Conference Contribution
Further lower bounds for structure-preserving signatures in asymmetric bilinear groups
(2019)
Presentation / Conference Contribution
Downloadable Citations
About UWE Bristol Research Repository
Administrator e-mail: repository@uwe.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search