A modular treatment of blind signatures from identification schemes
From MaRDI portal
Publication:2292700
Recommendations
Cited in
(37)- Lattice-based blind signatures, revisited
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- One-more unforgeability of blind ECDSA
- BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
- Short pairing-free blind signatures with exponential security
- Security of blind signatures revisited
- On the (in)security of ROS
- On the (in)security of ROS
- Boosting the Security of Blind Signature Schemes
- Security analysis of RSA-BSSA
- Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions
- Threshold and multi-signature schemes from linear hash functions
- 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
- \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist
- Identity-based signature and extended forking algorithm in the multivariate quadratic setting
- Snowblind: a threshold blind signature in pairing-free groups
- CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist
- Breaking parallel ROS: implication for isogeny and lattice-based blind signatures
- Twinkle: threshold signatures from DDH with full adaptive security
- Toothpicks: more efficient fork-free two-round multi-signatures
- M\&M's: mix and match attacks on Schnorr-type blind signatures with repetition
- Pairing-free blind signatures from CDH assumptions
- Pairing-free blind signatures from standard assumptions in the ROM
- Adaptively secure 5 round threshold signatures from \textsf{MLWE}/\textsf{MSIS} and \textsf{DL} with rewinding
- Oblivious issuance of proofs
- Adaptive UC NIZK for practical applications
- The algebraic one-more MISIS problem and applications to threshold signatures
- Multi-splitting forking based modular security of signatures in multivariate quadratic setting
- Practical blind signatures in pairing-free groups
- Tanuki: new frameworks for (concurrently secure) blind signatures from post-quantum group actions
- Tightly-secure blind signatures in pairing-free groups
- Post-quantum blind signature from standard group action assumptions and more
- Batched \& non-interactive blind signatures from lattices
- Threshold blind signatures from CDH
This page was built for publication: A modular treatment of blind signatures from identification schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292700)