One-more unforgeability for multi- and threshold signatures
From MaRDI portal
Cites work
- A generalized birthday problem
- Better than advertised security for non-interactive threshold signatures
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Chain Reductions for Multi-signatures and the HBMS Scheme
- Compact multi-signatures for smaller blockchains
- FROST: Flexible round-optimized Schnorr threshold signatures
- Fully adaptive Schnorr threshold signatures
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- MuSig2: simple two-round Schnorr multi-signatures
- On the (in)security of ROS
- Practical Schnorr threshold signatures without the algebraic group model
- Provably secure blind signature schemes
- Secure applications of Pedersen's distributed key generation protocol
- Security arguments for digital signatures and blind signatures
- Security of blind discrete log signatures against interactive attacks
- Simple Schnorr multi-signatures with applications to bitcoin
- Simplified Threshold RSA with Adaptive and Proactive Security
- The algebraic group model and its applications
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Threshold and multi-signature schemes from linear hash functions
- Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
- Twinkle: threshold signatures from DDH with full adaptive security
Cited in
(3)
This page was built for publication: One-more unforgeability for multi- and threshold signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955356)