Efficient secure two party ECDSA

DOI10.1007/978-3-031-47818-5_9zbMATH Open1547.94454MaRDI QIDQ6595942

Sermin Kocaman, Younes Talibi Alaoui

Publication date: 30 August 2024

zbMATH Keywords

threshold signaturesECDSAtwo-party protocols

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves (14H52) Authentication, digital signatures and secret sharing (94A62) Elliptic curves over local fields (11G07)

Cites Work

• Unnamed Item
• Efficient signature generation by smart cards
• Fast threshold ECDSA with honest majority
• Distributing any elliptic curve based protocol
• Two-party ECDSA from hash proof systems and efficient instantiations
• Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
• A public key cryptosystem and a signature scheme based on discrete logarithms
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Fast secure two-party ECDSA signing

This page was built for publication: Efficient secure two party ECDSA