Fast two-party signature for upgrading ECDSA to two-party scenario easily

DOI10.1016/J.TCS.2023.114325MaRDI QIDQ6138829zbMATH OpenFDO

Authors Binbin Tu, Yu Chen, Hongrui Cui, Xianfang Wang

Publication date 16 January 2024

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

Full work available at URL https://doi.org/10.1016/J.TCS.2023.114325

zbMATH Keywords

combinatorial ECDSAECDSAsigning key protectiontwo-party signature

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• Efficient RSA key generation and threshold Paillier in the two-party setting
• Efficient secure two-party protocols. Techniques and constructions
• Fast secure two-party ECDSA signing
• Highly-efficient universally-composable commitments based on the DDH assumption
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 1842489 (Why is no real title available?)
• Improving practical UC-secure commitments based on the DDH assumption
• Security and composition of multiparty cryptographic protocols
• Threshold cryptosystems from threshold fully homomorphic encryption
• Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
• Two-party ECDSA from hash proof systems and efficient instantiations
• Using level-1 homomorphic encryption to improve threshold DSA signatures for Bitcoin wallet security

Cited in

(1)

• Verifiable attribute-based multi-keyword search scheme with sensitive information hiding for cloud-assisted e-healthcare sharing systems

This page was built for publication: Fast two-party signature for upgrading ECDSA to two-party scenario easily

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