FROST: Flexible round-optimized Schnorr threshold signatures

DOI10.1007/978-3-030-81652-0_2zbMATH Open1485.94143OpenAlexW3046248117MaRDI QIDQ832324FDOQ832324

Authors: Chelsea Komlo, Ian Goldberg 

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81652-0_2

Recommendations

• Better than advertised security for non-interactive threshold signatures
• MuSig2: simple two-round Schnorr multi-signatures
• Efficient threshold-optimal ECDSA
• Threshold ECDSA with an offline recovery party
• Fast threshold ECDSA with honest majority

zbMATH Keywords

secret sharingthreshold signaturesSchnorr signatures

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Security arguments for digital signatures and blind signatures
• Short signatures from the Weil pairing
• How to share a secret
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Secure distributed key generation for discrete-log based cryptosystems
• Theory of Cryptography
• Title not available (Why is that?)
• Compact multi-signatures for smaller blockchains
• Simple Schnorr multi-signatures with applications to bitcoin
• Randomness Re-use in Multi-recipient Encryption Schemeas
• Title not available (Why is that?)
• On the (in)security of ROS

Cited In (30)

• ATSSIA: asynchronous truly-threshold Schnorr signing for inconsistent availability
• Threshold structure-preserving signatures
• TVES: threshold verifiably encrypted signature and its applications
• Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
• Threshold signatures with private accountability
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
• VSS from distributed ZK proofs and applications
• Two-party GOST signature scheme
• One round threshold ECDSA without roll call
• Provably unforgeable threshold EdDSA with an offline participant and trustless setup
• 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
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
• Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
• On the (in)security of ROS
• Threshold and multi-signature schemes from linear hash functions
• MuSig-L: lattice-based multi-signature with single-round online phase
• 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
• FROST
• Better than advertised security for non-interactive 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

Uses Software

• GitHub

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)