Partially structure-preserving signatures: lower bounds, constructions and more
From MaRDI portal
Publication:2117038
DOI10.1007/978-3-030-78372-3_11zbMath1491.94079OpenAlexW3013671167MaRDI QIDQ2117038
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-78372-3_11
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Pairings for cryptographers
- More efficient (almost) tightly secure structure-preserving signatures
- Compact structure-preserving signatures with almost tight security
- How low can you go? short structure-preserving signatures for Diffie-Hellman vectors
- Short signatures from the Weil pairing
- Lower bounds on structure-preserving signatures for bilateral messages
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Further lower bounds for structure-preserving signatures in asymmetric bilinear groups
- Rerandomizable signatures under standard assumption
- Reassessing security of randomizable signatures
- Composable and Modular Anonymous Credentials: Definitions and Practical Constructions
- Short Randomizable Signatures
- Short Structure-Preserving Signatures
- Efficient Fully Structure-Preserving Signatures for Large Messages
- Type 2 Structure-Preserving Signature Schemes Revisited
- Efficient Structure-Preserving Signature Scheme from Standard Assumptions
- A New Hash-and-Sign Approach and Structure-Preserving Signatures from DLIN
- Commuting Signatures and Verifiable Encryption
- Attribute-Based Signatures
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
- Practical Round-Optimal Blind Signatures in the Standard Model
- Structure-Preserving Signatures from Standard Assumptions, Revisited
- Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
- Structure-Preserving Signatures and Commitments to Group Elements
- Get Shorty via Group Signatures without Encryption
- A public key cryptosystem and a signature scheme based on discrete logarithms
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Efficient Noninteractive Proof Systems for Bilinear Groups
- Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
- Dual Form Signatures: An Approach for Proving Security from Static Assumptions
- Tagged One-Time Signatures: Tight Security and Optimal Tag Size
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Formalizing Group Blind Signatures and Practical Constructions without Random Oracles
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Improved Structure Preserving Signatures Under Standard Bilinear Assumptions
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
- Efficient Round-Optimal Blind Signatures in the Standard Model
- Cryptography and Coding
This page was built for publication: Partially structure-preserving signatures: lower bounds, constructions and more