Stateless deterministic multi-party EdDSA signatures with low communication
From MaRDI portal
Cites work
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Correlated pseudorandom functions from variable-density LPN
- Correlated pseudorandomness from expand-accumulate codes
- Distributing any elliptic curve based protocol
- Efficient pseudorandom correlation generators: silent OT extension and more
- Fast secure two-party ECDSA signing
- FROST: Flexible round-optimized Schnorr threshold signatures
- Fully adaptive Schnorr threshold signatures
- Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA
- High-speed high-security signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1842489 (Why is no real title available?)
- Improved primitives for MPC over mixed arithmetic-binary circuits
- Maliciously Secure Multi-party PSI with Lower Bandwidth and Faster Computation
- Practical Schnorr threshold signatures without the algebraic group model
- Practical threshold signatures
- Pseudorandom correlation functions from variable-density LPN, revisited
- Robust threshold DSS signatures
- Securing threshold cryptosystems against chosen ciphertext attack
- Simple Schnorr multi-signatures with applications to bitcoin
- SPHINCS: practical stateless hash-based signatures
- SPRINT: high-throughput robust distributed Schnorr signatures
- Threshold Schnorr with stateless deterministic signing from standard assumptions
- Two-party ECDSA from hash proof systems and efficient instantiations
- Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions
This page was built for publication: Stateless deterministic multi-party EdDSA signatures with low communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951305)
