Practical Round-Optimal Blind Signatures in the Standard Model
From MaRDI portal
Recommendations
- Efficient round-optimal blind signatures in the standard model
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Efficient Round Optimal Blind Signatures
- Round optimal blind signatures
- Compact Round-Optimal Partially-Blind Signatures
- Round-Optimal Blind Signatures from Waters Signatures
- Identity-based blind signature from lattices in standard model
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Secure identity-based blind signature scheme in the standard model
Cites work
- Beyond the limitation of prime-order bilinear groups, and round optimal blind signatures
- Compact Round-Optimal Partially-Blind Signatures
- Concurrent Blind Signatures Without Random Oracles
- Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient Round Optimal Blind Signatures
- Efficient Structure-Preserving Signature Scheme from Standard Assumptions
- Lattice-based blind signatures
- Limitations on transformations from composite-order to prime-order groups: the case of round-optimal blind signatures
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- On the impossibility of three-move blind signature schemes
- On the Security of One-Witness Blind Signature Schemes
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Pairing-Friendly Elliptic Curves of Prime Order
- Round optimal blind signatures
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Security arguments for digital signatures and blind signatures
- Security of blind signatures revisited
- Security of Blind Signatures under Aborts
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
- Signatures on randomizable ciphertexts
- Structure-preserving signatures and commitments to group elements
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
Cited in
(51)- Improved algebraic MACs and practical keyed-verification anonymous credentials
- Efficient redactable signature and application to anonymous credentials
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- 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
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Short pairing-free blind signatures with exponential security
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Compact Round-Optimal Partially-Blind Signatures
- How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
- Breaking and fixing anonymous credentials for the cloud
- Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
- Round optimal blind signatures
- Efficient Round Optimal Blind Signatures
- Practical Time Capsule Signatures in the Standard Model from Bilinear Maps
- Equivocal Blind Signatures and Adaptive UC-Security
- Round-Optimal Blind Signatures from Waters Signatures
- Access Control Encryption for Equality, Comparison, and More
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Efficient round-optimal blind signatures in the standard model
- Multi-theorem preprocessing NIZKs from lattices
- Boosting the Security of Blind Signature Schemes
- Anonymous tokens with public metadata and applications to private contact tracing
- 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
- 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
- 1-out-of-n oblivious signatures: security revisited and a generic construction with an efficient communication cost
- Threshold structure-preserving signatures
- Practical round-optimal blind signatures in the ROM from standard assumptions
- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
- Concurrently secure blind Schnorr signatures
- Pairing-free blind signatures from standard assumptions in the ROM
- Stronger security for threshold blind signatures
- Practical blind signatures in pairing-free groups
- Interactive threshold mercurial signatures and applications
- Non-interactive blind signatures: post-quantum and stronger security
- On security proofs of existing equivalence class signature schemes
- SoK: signatures with randomizable keys
- Tightly-secure blind signatures in pairing-free groups
- On the limits of non-interactive blind signatures
- Batched \& non-interactive blind signatures from lattices
- Threshold blind signatures from CDH
- Structure-preserving compressing primitives: vector commitments and accumulators and applications
This page was built for publication: Practical Round-Optimal Blind Signatures in the Standard Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457068)
