Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security

DOI10.1016/j.tcs.2022.10.016zbMath1502.94031OpenAlexW4306632346WikidataQ115036437 ScholiaQ115036437MaRDI QIDQ2098172

Federico Savasta, Dario Catalano, Ida Tucker, Fabien Laguillaumie, Guilhem Castagnos

Publication date: 17 November 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.10.016

zbMATH Keywords

class groupsprovable securitydigital signaturesmulti-party computationthreshold cryptographyEC-DSA

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Practical fully secure unrestricted inner product functional encryption modulo \(p\)
• Bandwidth-efficient threshold EC-DSA
• Two-party ECDSA from hash proof systems and efficient instantiations
• Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
• Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security
• Secure Multi-Party Computation with Identifiable Abort
• Robust Threshold DSS Signatures
• Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation
• How to share a secret
• Robust and Efficient Sharing of RSA Functions
• Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
• Nonmalleable Cryptography
• Fast secure two-party ECDSA signing

This page was built for publication: Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security