Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
From MaRDI portal
Publication:2827730
DOI10.1007/978-3-319-44618-9_21zbMath1482.94067OpenAlexW2516136421MaRDI QIDQ2827730
Daniel Slamanig, Georg Fuchsbauer, Chethan Kamath, Christian Hanser
Publication date: 21 October 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-44618-9_21
Related Items (11)
Short pairing-free blind signatures with exponential security ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Boosting the Security of Blind Signature Schemes ⋮ Anonymous tokens with public metadata and applications to private contact tracing ⋮ How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones ⋮ Non-interactive blind signatures for random messages ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions ⋮ Efficient Round-Optimal Blind Signatures in the Standard Model ⋮ Anonymous tokens with private metadata bit
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Security arguments for digital signatures and blind signatures
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- Short Structure-Preserving Signatures
- Structure-Preserving Signatures from Type II Pairings
- Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions
- Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures
- Waters Signatures with Optimal Security Reduction
- Security of Blind Signatures Revisited
- Compact Round-Optimal Partially-Blind Signatures
- Attack against a Pairing Based Anonymous Authentication Protocol
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
- Signatures on Randomizable Ciphertexts
- Practical Round-Optimal Blind Signatures in the Standard Model
- Structure-Preserving Signatures from Standard Assumptions, Revisited
- On the Impossibility of Three-Move Blind Signature Schemes
- Bounded-concurrent secure two-party computation without setup assumptions
- Structure-Preserving Signatures and Commitments to Group Elements
- Security of Blind Signatures under Aborts
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
- Round Optimal Blind Signatures
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Efficient Round Optimal Blind Signatures
- Pairing-Friendly Elliptic Curves of Prime Order
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Security in Communication Networks
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Topics in Cryptology – CT-RSA 2006
- Theory of Cryptography
This page was built for publication: Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
