Stronger security for threshold blind signatures
From MaRDI portal
Cites work
- Adaptively secure BLS threshold signatures from DDH and co-CDH
- Bare PAKE: universally composable key exchange from just passwords
- Better than advertised security for non-interactive threshold signatures
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- Non-interactive blind signatures for random messages
- On the (in)security of ROS
- Practical Round-Optimal Blind Signatures in the Standard Model
- Short pairing-free blind signatures with exponential security
- Snowblind: a threshold blind signature in pairing-free groups
- Threshold PAKE with security against compromise of all servers
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF
Cited in
(6)- A complete characterization of one-more assumptions in the algebraic group model
- Adaptively secure threshold blind BLS signatures and threshold oblivious PRF
- Security amplification of threshold signatures in the standard model
- Adaptively-secure three-round threshold Schnorr from DL
- UC4Free! Existing threshold signatures are UC secure
- Putting multi into multi-signatures: tight security for multiple signers
This page was built for publication: Stronger security for threshold blind signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6897176)