Round-Optimal Composable Blind Signatures in the Common Reference String Model
From MaRDI portal
Recommendations
Cited in
(56)- A framework for universally composable non-committing blind signatures
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- An efficient blind signature scheme based on SM2 signature algorithm
- Anonymous tokens with private metadata bit
- Lattice-based blind signatures, revisited
- One-more unforgeability of blind ECDSA
- BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
- Skipping the \(q\) in group signatures
- A correction to a code-based blind signature scheme
- A fast and simple partially oblivious PRF, with applications
- Security of blind signatures revisited
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Structure-preserving signatures and commitments to group elements
- Adaptive oblivious transfer and generalization
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Concurrent secure computation via non-black box simulation
- Practical Round-Optimal Blind Signatures in the Standard Model
- A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
- One-Round ID-Based Blind Signature Scheme without ROS Assumption
- Round optimal blind signatures
- Equivocal Blind Signatures and Adaptive UC-Security
- Round-Optimal Blind Signatures from Waters Signatures
- Efficient round-optimal blind signatures in the standard model
- Multi-theorem preprocessing NIZKs from lattices
- Boosting the Security of Blind Signature Schemes
- Non-interactive blind signatures for random messages
- Rai-Choo! Evolving blind signatures to the next level
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
- 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
- A framework for practical anonymous credentials from lattices
- \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist
- The Abe-Okamoto partially blind signature scheme revisited
- Threshold structure-preserving signatures
- Practical round-optimal blind signatures in the ROM from standard assumptions
- CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist
- On proving equivalence class signatures secure from non-interactive assumptions
- Breaking parallel ROS: implication for isogeny and lattice-based blind signatures
- Concurrently secure blind Schnorr signatures
- Pairing-free blind signatures from CDH assumptions
- Pairing-free blind signatures from standard assumptions in the ROM
- Homomorphic encryption for large integers from nested residue number systems
- Improved lattice blind signatures from recycled entropy
- Blind signatures from proofs of inequality
- Multi-splitting forking based modular security of signatures in multivariate quadratic setting
- OCash: fully anonymous payments between blockchain light clients
- Lattice-based proof-friendly signatures from vanishing short integer solutions
- Practical blind signatures in pairing-free groups
- Non-interactive blind signatures: post-quantum and stronger security
- Tanuki: new frameworks for (concurrently secure) blind signatures from post-quantum group actions
- Tightly-secure blind signatures in pairing-free groups
- On the limits of non-interactive blind signatures
- Aggregate-blind signature based on lattices
- On non-interactive blind signatures in the plain model using complexity leveraging
- Post-quantum blind signature from standard group action assumptions and more
This page was built for publication: Round-Optimal Composable Blind Signatures in the Common Reference String Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756654)
