FROST: Flexible round-optimized Schnorr threshold signatures
From MaRDI portal
(Redirected from Publication:832324)
Recommendations
Cites work
- scientific article; zbMATH DE number 1808277 (Why is no real title available?)
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 177618 (Why is no real title available?)
- scientific article; zbMATH DE number 1942427 (Why is no real title available?)
- scientific article; zbMATH DE number 1962164 (Why is no real title available?)
- scientific article; zbMATH DE number 2080670 (Why is no real title available?)
- Compact multi-signatures for smaller blockchains
- How to share a secret
- On the (in)security of ROS
- Randomness Re-use in Multi-recipient Encryption Schemeas
- Secure distributed key generation for discrete-log based cryptosystems
- Security arguments for digital signatures and blind signatures
- Short signatures from the Weil pairing
- Simple Schnorr multi-signatures with applications to bitcoin
- Theory of Cryptography
Cited in
(30)- Threshold signatures with private accountability
- Better than advertised security for non-interactive threshold signatures
- Fully adaptive Schnorr threshold signatures
- Practical Schnorr threshold signatures without the algebraic group model
- Snowblind: a threshold blind signature in pairing-free groups
- Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- \textit{Flood and submerse}: distributed key generation and robust threshold signature from lattices
- Adaptively secure BLS threshold signatures from DDH and co-CDH
- Adaptively secure 5 round threshold signatures from \textsf{MLWE}/\textsf{MSIS} and \textsf{DL} with rewinding
- Two-round threshold signature from algebraic one-more learning with errors
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
- Threshold and multi-signature schemes from linear hash functions
- TVES: threshold verifiably encrypted signature and its applications
- MuSig-L: lattice-based multi-signature with single-round online phase
- One round threshold ECDSA without roll call
- FROST
- VSS from distributed ZK proofs and applications
- Lattice-based threshold, accountable, and private signature
- Twinkle: threshold signatures from DDH with full adaptive security
- Threshold raccoon: practical threshold signatures from standard lattice assumptions
- Fast batched asynchronous distributed key generation
- SPRINT: high-throughput robust distributed Schnorr signatures
- Two-party GOST signature scheme
- Provably unforgeable threshold EdDSA with an offline participant and trustless setup
- ATSSIA: asynchronous truly-threshold Schnorr signing for inconsistent availability
- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
- Threshold structure-preserving signatures
- On the (in)security of ROS
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
This page was built for publication: FROST: Flexible round-optimized Schnorr threshold signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832324)
