Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security

DOI10.1007/978-3-319-39555-5_9zbMath1346.94143OpenAlexW2468121714WikidataQ111687903 ScholiaQ111687903MaRDI QIDQ2822671

Steven Goldfeder, Rosario Gennaro, Arvind Narayanan

Publication date: 4 October 2016

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39555-5_9

Mathematics Subject Classification ID

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

Related Items (21)

Sashimi: Cutting up CSI-FiSh Secret Keys to Produce an Actively Secure Distributed Signing Protocol ⋮ SoK: communication across distributed ledgers ⋮ Efficient threshold-optimal ECDSA ⋮ Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups ⋮ One round threshold ECDSA without roll call ⋮ Threshold and multi-signature schemes from linear hash functions ⋮ Provably unforgeable threshold EdDSA with an offline participant and trustless setup ⋮ Fast two-party signature for upgrading ECDSA to two-party scenario easily ⋮ Better than advertised security for non-interactive threshold signatures ⋮ Practical Schnorr threshold signatures without the algebraic group model ⋮ Fast secure two-party ECDSA signing ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Threshold ECDSA with an offline recovery party ⋮ Bandwidth-efficient threshold EC-DSA ⋮ Two-party adaptor signatures from identification schemes ⋮ Simple Schnorr multi-signatures with applications to bitcoin ⋮ Escrow Protocols for Cryptocurrencies: How to Buy Physical Goods Using Bitcoin ⋮ Efficient two-party exponentiation from quotient transfer ⋮ Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security ⋮ ATSSIA: asynchronous truly-threshold Schnorr signing for inconsistent availability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Practical multi-candidate election system
• Robust Threshold DSS Signatures
• Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
• How to share a secret
• A Framework for Practical Universally Composable Zero-Knowledge Protocols
• Non-interactive and reusable non-malleable commitment schemes
• Independent Zero-Knowledge Sets
• On the Portability of Generalized Schnorr Proofs
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• The Knowledge Complexity of Interactive Proof Systems
• Distributed Provers with Applications to Undeniable Signatures
• A method for obtaining digital signatures and public-key cryptosystems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Nonmalleable Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004

This page was built for publication: Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security