SPRINT: high-throughput robust distributed Schnorr signatures

DOI10.1007/978-3-031-58740-5_3MaRDI QIDQ6637538zbMATH OpenFDO

Authors Fabrice Benhamouda, Shai Halevi, Hugo Krawczyk, Yi Ping Ma, Tal Rabin

Publication date 13 November 2024

Full work available at URL https://doi.org/10.1007/978-3-031-58740-5_3

zbMATH Keywords

message-independent interactive ephemeral randomness generation procedure

Mathematics Subject Classification ID

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

Recommendations

• Fast batched asynchronous distributed key generation
• FROST: Flexible round-optimized Schnorr threshold signatures
• Fully adaptive Schnorr threshold signatures
• Threshold Schnorr with stateless deterministic signing from standard assumptions

Cites work

• A threshold cryptosystem without a trusted party. (Extended abstract)
• Algorand: a secure and efficient distributed ledger
• Asynchronous secure computation
• ATSSIA: asynchronous truly-threshold Schnorr signing for inconsistent availability
• Constant-Size Commitments to Polynomials and Their Applications
• Efficient statistical asynchronous verifiable secret sharing with optimal resilience
• Elliptic curve fast Fourier transform (ECFFT). I: Low-degree extension in time \(O(n \log n)\) over all finite fields
• FROST: Flexible round-optimized Schnorr threshold signatures
• How to withstand mobile virus attacks (extended abstract)
• Improved extension protocols for Byzantine broadcast and agreement
• Non-interactive and information-theoretic secure verifiable secret sharing
• On the (in)security of ROS
• On the security of ECDSA with additive key derivation and presignatures
• Optimal extension protocols for Byzantine broadcast and agreement
• Proactive secret sharing or: How to cope with perpetual leakage
• Provably secure distributed Schnorr signatures and a (t,n) threshold scheme for implicit certificates
• Robust Multiparty Computation with Linear Communication Complexity
• Secure distributed key generation for discrete-log based cryptosystems
• Sharing transformation and dishonest majority MPC with packed secret sharing
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• Threshold Schnorr with stateless deterministic signing from standard assumptions

Cited in

(13)

• Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions
• Fast batched asynchronous distributed key generation
• Adaptively secure BLS threshold signatures from DDH and co-CDH
• A plausible attack on the adaptive security of threshold Schnorr signatures
• Unmasking \textsf{TRaccoon}: a lattice-based threshold signature with an efficient identifiable abort protocol
• Adaptively secure three-round threshold Schnorr signatures from DDH
• Glacius: threshold Schnorr signatures from DDH with full adaptive security
• Stateless deterministic multi-party EdDSA signatures with low communication
• Dazzle: improved adaptive threshold signatures from DDH
• HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures
• Adaptively secure partially non-interactive threshold Schnorr signatures in the AGM
• Round-efficient adaptively secure threshold signatures with rewinding
• Tightly secure threshold signatures over pairing-free groups

This page was built for publication: SPRINT: high-throughput robust distributed Schnorr signatures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637538)