Partially structure-preserving signatures: lower bounds, constructions and more
From MaRDI portal
Publication:2117038
DOI10.1007/978-3-030-78372-3_11zbMATH Open1491.94079OpenAlexW3013671167MaRDI QIDQ2117038FDOQ2117038
Authors: Essam Ghadafi 
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-78372-3_11
Recommendations
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Improved (almost) tightly-secure structure-preserving signatures
- Structure-preserving signatures from standard assumptions, revisited
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- How low can you go? short structure-preserving signatures for Diffie-Hellman vectors
Cites Work
- Short signatures from the Weil pairing
- A public key cryptosystem and a signature scheme based on discrete logarithms
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Efficient Identity-Based Encryption Without Random Oracles
- Title not available (Why is that?)
- Pairings for cryptographers
- Commuting signatures and verifiable encryption
- Structure-preserving signatures and commitments to group elements
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Tagged one-time signatures: tight security and optimal tag size
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient noninteractive proof systems for bilinear groups
- Attribute-based signatures
- Efficient Structure-Preserving Signature Scheme from Standard Assumptions
- A new hash-and-sign approach and structure-preserving signatures from DLIN
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
- Title not available (Why is that?)
- Cryptography and Coding
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
- Reassessing security of randomizable signatures
- Short randomizable signatures
- Structure-preserving signatures from standard assumptions, revisited
- More efficient (almost) tightly secure structure-preserving signatures
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Improved structure preserving signatures under standard bilinear assumptions
- Compact structure-preserving signatures with almost tight security
- Short structure-preserving signatures
- Composable and modular anonymous credentials: definitions and practical constructions
- Practical Round-Optimal Blind Signatures in the Standard Model
- How low can you go? short structure-preserving signatures for Diffie-Hellman vectors
- Get shorty via group signatures without encryption
- Type 2 structure-preserving signature schemes revisited
- Lower bounds on structure-preserving signatures for bilateral messages
- Efficient fully structure-preserving signatures for large messages
- Rerandomizable signatures under standard assumption
- Formalizing group blind signatures and practical constructions without random oracles
- Efficient round-optimal blind signatures in the standard model
- Further lower bounds for structure-preserving signatures in asymmetric bilinear groups
- Dual form signatures: an approach for proving security from static assumptions
Cited In (7)
- Threshold structure-preserving signatures
- Pointcheval-Sanders signature-based synchronized aggregate signature
- On blockwise symmetric matchgate signatures and higher domain \#CSP
- Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
- How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
- Lower bounds on structure-preserving signatures for bilateral messages
- Half-aggregation of Schnorr signatures with tight reductions
This page was built for publication: Partially structure-preserving signatures: lower bounds, constructions and more
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117038)
