Partially structure-preserving signatures: lower bounds, constructions and more
From MaRDI portal
Publication:2117038
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
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1303126 (Why is no real title available?)
- A new hash-and-sign approach and structure-preserving signatures from DLIN
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Attribute-based signatures
- Commuting signatures and verifiable encryption
- Compact structure-preserving signatures with almost tight security
- Composable and modular anonymous credentials: definitions and practical constructions
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Cryptography and Coding
- Dual form signatures: an approach for proving security from static assumptions
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient Structure-Preserving Signature Scheme from Standard Assumptions
- Efficient fully structure-preserving signatures for large messages
- Efficient noninteractive proof systems for bilinear groups
- Efficient round-optimal blind signatures in the standard model
- Formalizing group blind signatures and practical constructions without random oracles
- Further lower bounds for structure-preserving signatures in asymmetric bilinear groups
- Get shorty via group signatures without encryption
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How low can you go? short structure-preserving signatures for Diffie-Hellman vectors
- Improved structure preserving signatures under standard bilinear assumptions
- Lower bounds on structure-preserving signatures for bilateral messages
- More efficient (almost) tightly secure structure-preserving signatures
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Pairings for cryptographers
- Practical Round-Optimal Blind Signatures in the Standard Model
- Reassessing security of randomizable signatures
- Rerandomizable signatures under standard assumption
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Short randomizable signatures
- Short signatures from the Weil pairing
- Short structure-preserving signatures
- Structure-preserving signatures and commitments to group elements
- Structure-preserving signatures from standard assumptions, revisited
- Tagged one-time signatures: tight security and optimal tag size
- Type 2 structure-preserving signature schemes revisited
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
Cited in
(7)- On blockwise symmetric matchgate signatures and higher domain \#CSP
- Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
- Pointcheval-Sanders signature-based synchronized aggregate signature
- Half-aggregation of Schnorr signatures with tight reductions
- Lower bounds on structure-preserving signatures for bilateral messages
- How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
- Threshold structure-preserving signatures
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)
