Fast Secure Two-Party ECDSA Signing

@inproceedings{Lindell2017FastST,
  title={Fast Secure Two-Party ECDSA Signing},
  author={Yehuda Lindell},
  booktitle={CRYPTO},
  year={2017}
}
  • Yehuda Lindell
  • Published in CRYPTO 2017
  • Computer Science
  • ECDSA is a standard digital signature schemes that is widely used in TLS, Bitcoin and elsewhere. Unlike other schemes like RSA, Schnorr signatures and more, it is particularly hard to construct efficient threshold signature protocols for ECDSA (and DSA). As a result, the best-known protocols today for secure distributed ECDSA require running heavy zero-knowledge proofs and computing many large-modulus exponentiations for every signing operation. In this paper, we consider the specific case of… CONTINUE READING
    76 Citations

    Figures, Tables, and Topics from this paper.

    Secure Two-party Threshold ECDSA from ECDSA Assumptions
    • 59
    • Highly Influenced
    • PDF
    Fast Threshold ECDSA with Honest Majority
    • 10
    • Highly Influenced
    • PDF
    Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody
    • 51
    • PDF
    A Multiparty Computation Approach to Threshold ECDSA
    Threshold ECDSA from ECDSA Assumptions: The Multiparty Case
    • 24
    • Highly Influenced
    • PDF
    A provable-secure and practical two-party distributed signing protocol for SM2 signature algorithm
    • 2
    A Provably-Unforgeable Threshold EdDSA with an Offline Recovery Party
    Simple Schnorr multi-signatures with applications to Bitcoin
    • 61
    • PDF

    References

    SHOWING 1-10 OF 34 REFERENCES
    Highly-Efficient Universally-Composable Commitments based on the DDH Assumption
    • 72
    • PDF
    Using Level-1 Homomorphic Encryption to Improve Threshold DSA Signatures for Bitcoin Wallet Security
    • 22
    • PDF
    Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security
    • 100
    • Highly Influential
    • PDF
    Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
    • 42
    • PDF
    Two-Party Generation of DSA Signatures
    • 59
    • PDF
    Universally composable security: a new paradigm for cryptographic protocols
    • R. Canetti
    • Computer Science
    • Proceedings 2001 IEEE International Conference on Cluster Computing
    • 2001
    • 2,555
    • PDF
    Security and Composition of Multiparty Cryptographic Protocols
    • R. Canetti
    • Computer Science, Mathematics
    • Journal of Cryptology
    • 2000
    • 1,121