Threshold structure-preserving signatures
From MaRDI portal
Publication:6562572
Recommendations
- Improved (almost) tightly-secure structure-preserving signatures
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Structure-preserving signatures from standard assumptions, revisited
- Partially structure-preserving signatures: lower bounds, constructions and more
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
Cites work
- A classification of computational assumptions in the algebraic group model
- Achieving optimal anonymity in transferable e-cash with a judge
- Advances in Cryptology - CRYPTO 2003
- Aggregatable distributed key generation
- Better than advertised security for non-interactive threshold signatures
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Commuting signatures and verifiable encryption
- Composable and modular anonymous credentials: definitions and practical constructions
- Computing on authenticated data: new privacy definitions and constructions
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Decentralized traceable attribute-based signatures
- Delegatable anonymous credentials from mercurial signatures
- Efficient fully structure-preserving signatures for large messages
- Efficient Non-interactive Proof Systems for Bilinear Groups
- FROST: Flexible round-optimized Schnorr threshold signatures
- Fully adaptive Schnorr threshold signatures
- Further lower bounds for structure-preserving signatures in asymmetric bilinear groups
- How low can you go? short structure-preserving signatures for Diffie-Hellman vectors
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to share a function securely
- How to share a secret
- scientific article; zbMATH DE number 1722676 (Why is no real title available?)
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 4191562 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1418290 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- Improved structure preserving signatures under standard bilinear assumptions
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Lower bounds on structure-preserving signatures for bilateral messages
- Malleable proof systems and applications
- More efficient (almost) tightly secure structure-preserving signatures
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Multi-authority secret-ballot elections with linear work
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Pairings for cryptographers
- Perfect Non-interactive Zero Knowledge for NP
- Practical Round-Optimal Blind Signatures in the Standard Model
- Practical threshold signatures
- Randomizable Proofs and Delegatable Anonymous Credentials
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Securing threshold cryptosystems against chosen ciphertext attack
- 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
- Short threshold dynamic group signatures
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Shorter QA-NIZK and SPS with tighter security
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
- Structure-preserving signatures and commitments to group elements
- Structure-preserving signatures from standard assumptions, revisited
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- The algebraic group model and its applications
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Tight reductions for Diffie-Hellman variants in the algebraic group model
- Tightly Secure Signatures and Public-Key Encryption
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
Cited in
(9)- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
- Twinkle: threshold signatures from DDH with full adaptive security
- Glacius: threshold Schnorr signatures from DDH with full adaptive security
- HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures
- Interactive threshold mercurial signatures and applications
- Subset-optimized BLS multi-signature with key aggregation
- Structure-preserving compressing primitives: vector commitments and accumulators and applications
- Keyed-verification anonymous credentials with highly efficient partial disclosure
- Tightly secure threshold signatures over pairing-free groups
This page was built for publication: Threshold structure-preserving signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562572)
