Practical Round-Optimal Blind Signatures in the Standard Model
From MaRDI portal
Publication:3457068
DOI10.1007/978-3-662-48000-7_12zbMath1351.94045OpenAlexW1470878550MaRDI QIDQ3457068
Georg Fuchsbauer, Daniel Slamanig, Christian Hanser
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_12
Related Items (27)
More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds ⋮ Short pairing-free blind signatures with exponential security ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ 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 ⋮ Rai-Choo! Evolving blind signatures to the next level ⋮ PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ On pairing-free blind signature schemes in the algebraic group model ⋮ Traceable constant-size multi-authority credentials ⋮ Traceable constant-size multi-authority credentials ⋮ Attribute-based anonymous credential: optimization for single-use and multi-use ⋮ Improved algebraic MACs and practical keyed-verification anonymous credentials ⋮ Breaking and Fixing Anonymous Credentials for the Cloud ⋮ Access Control Encryption for Equality, Comparison, and More ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Efficient redactable signature and application to anonymous credentials ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions ⋮ Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions ⋮ Efficient Round-Optimal Blind Signatures in the Standard Model ⋮ Anonymous tokens with private metadata bit ⋮ Lattice-based blind signatures, revisited ⋮ Partially structure-preserving signatures: lower bounds, constructions and more ⋮ Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
Cites Work
- 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
- On the Security of One-Witness Blind Signature Schemes
- Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures
- Security of Blind Signatures Revisited
- Efficient Structure-Preserving Signature Scheme from Standard Assumptions
- Compact Round-Optimal Partially-Blind Signatures
- Lattice-Based Blind Signatures
- Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
- Signatures on Randomizable Ciphertexts
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
- Concurrent Blind Signatures Without Random Oracles
- On the Impossibility of Three-Move Blind Signature Schemes
- Structure-Preserving Signatures and Commitments to Group Elements
- Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
- Security of Blind Signatures under Aborts
- 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
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
This page was built for publication: Practical Round-Optimal Blind Signatures in the Standard Model
