More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds

DOI10.1007/978-3-319-66399-9_3zbMath1500.94067OpenAlexW2578214276MaRDI QIDQ2167723

Essam Ghadafi

Publication date: 25 August 2022

Full work available at URL: http://eprints.uwe.ac.uk/32303/

zbMATH Keywords

cryptographic protocolsunilateral structure-preserving signatures on Diffie-Hellman pairs

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

Rerandomizable signatures under standard assumption ⋮ Partially structure-preserving signatures: lower bounds, constructions and more ⋮ An efficient certificate-based signature scheme in the standard model

Cites Work

• Unnamed Item
• Comparing two pairing-based aggregate signature schemes
• Pairings for cryptographers
• Stronger Security Notions for Decentralized Traceable Attribute-Based Signatures and More Efficient Constructions
• 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 Signatures of Knowledge and DAA in the Standard Model
• Structure-Preserving Signatures from Type II Pairings
• Efficient Structure-Preserving Signature Scheme from Standard Assumptions
• A New Hash-and-Sign Approach and Structure-Preserving Signatures from DLIN
• Tightly Secure Signatures and Public-Key Encryption
• Anonymous Transferable E-Cash
• Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
• Fully Structure-Preserving Signatures and Shrinking Commitments
• How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones
• Commuting Signatures and Verifiable Encryption
• Attribute-Based Signatures
• Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
• Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
• 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
• Universally Composable Adaptive Oblivious Transfer
• 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
• Computing on Authenticated Data: New Privacy Definitions and Constructions
• 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 – CRYPTO 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Decentralized Traceable Attribute-Based Signatures
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Improved Structure Preserving Signatures Under Standard Bilinear Assumptions
• Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model
• Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
• Cryptography and Coding

This page was built for publication: More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds