Distributing any elliptic curve based protocol

DOI10.1007/978-3-030-35199-1_17MaRDI QIDQ2177668zbMATH OpenOpenAlexFDO

Authors N. P. Smart, Younes Talibi Alaoui

Publication date 6 May 2020

Full work available at URL https://lirias.kuleuven.be/handle/123456789/645903

Mathematics Subject Classification ID

Network protocols (68M12) Cryptography (94A60)

Recommendations

• Secure Multi-Party Computation for Elliptic Curves
• scientific article; zbMATH DE number 1808209
• scientific article; zbMATH DE number 176564
• Perfectly-Secure MPC with Linear Communication Complexity
• Multi-party computation with conversion of secret sharing

Cited in

(13)

• Bandwidth-efficient threshold EC-DSA
• Spreading the privacy blanket: differentially oblivious shuffling for differential privacy
• Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms
• Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions
• Non-interactive anonymous router with quasi-linear router computation
• Efficient secure two party ECDSA
• Malicious security in collaborative zk-SNARKs: more than meets the eye
• Non-interactive threshold BBS+ from pseudorandom correlations
• Stateless deterministic multi-party EdDSA signatures with low communication
• Short reachability networks
• Two-party ECDSA signing at constant communication overhead
• Multi-party revocation in sovrin: performance through distributed trust
• Balancing privacy and accountability in blockchain identity management

This page was built for publication: Distributing any elliptic curve based protocol

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