Improving Security for Users of Decentralized Exchanges Through Multiparty Computation

  title={Improving Security for Users of Decentralized Exchanges Through Multiparty Computation},
  author={Robert Annessi and Ethan Fast},
  journal={2021 IEEE International Conference on Blockchain (Blockchain)},
  • Robert Annessi, Ethan Fast
  • Published 21 June 2021
  • Computer Science
  • 2021 IEEE International Conference on Blockchain (Blockchain)
Decentralized cryptocurrency exchanges offer compelling security benefits over centralized exchanges: users control their funds and avoid the risk of an exchange hack or malicious operator. However, because user assets are fully accessible by a secret key, decentralized exchanges pose significant internal security risks for trading firms and automated trading systems, where a compromised system can result in total loss of funds. Centralized exchanges mitigate this risk through API key based… 

Tables from this paper

Trade or Trick?

The approach can act as a whistleblower that identifies scam tokens at their early stages based on a guilt-by-association heuristic and a machine-learning powered technique and suggests the urgency to identify and stop scams in the decentralized finance ecosystem.

Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators

This protocol is the first one where the communication complexity of the preprocessing phase is only logarithmic in the number of ECDSA signatures to be produced later, and it achieves therefore a so-called silent preprocessing, and achieves active security against any number of arbitrarily corrupted parties.

Trade or Trick?: Detecting and Characterizing Scam Tokens on Uniswap Decentralized Exchange

This paper proposes an accurate approach for flagging scam tokens on Uniswap and identifies over 10K scam tokens, which suggests that roughly 50% of the tokens listed on Un iswap are scam tokens.

Demystifying Scam Tokens on Uniswap Decentralized Exchange

This poster presents a probabilistic procedure to identify the cells in the brain that secrete X-rays and identify the “spatially-spatial errors” in the response of the immune system.



Secure Two-party Threshold ECDSA from ECDSA Assumptions

This work proposes new protocols for multi-party ECDSA key-generation and signing with a threshold of two, which prove secure against malicious adversaries in the random oracle model using only the Computational Diffie-Hellman Assumption and the assumptions already implied by E CDSA itself.

Threshold ECDSA from ECDSA Assumptions: The Multiparty Case

This work proposes an extension of Doerner et al.'s scheme to arbitrary thresholds, and proves it secure against a malicious adversary corrupting up to one party less than the threshold under only the Computational Diffie-Hellman assumption in the Random Oracle model, an assumption strictly weaker than those under which ECDSA is proven.

Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody

This paper presents the first truly practical full threshold ECDSA signing protocol that has both fast signing and fast key distribution, which solves a years-old open problem, and opens the door to practical uses of threshold E CDSA signing that are in demand today.

Fast Multiparty Threshold ECDSA with Fast Trustless Setup

This work is the first protocol that supports multiparty signatures for any $t łeq n$ with an efficient dealerless key generation and proves its scheme secure against malicious adversaries with a dishonest majority.

Strength in Numbers: Threshold ECDSA to Protect Keys in the Cloud

This work shows that applying threshold cryptography to ECDSA—the elliptic curve variant of DSA—yields a fully distributive signature protocol that does not feature a single point of failure, and provides a proof of concept of the protocol in practice.

Bandwidth-efficient threshold EC-DSA

A new variant of the Gennaro and Goldfeder protocol from ACM CCS 2018 that avoids all the required range proofs, while retaining provable security against malicious adversaries in the dishonest majority setting is presented.

Fast Secure Two-Party ECDSA Signing

This paper considers the specific case of two parties (and thus no honest majority) and construct a protocol that is approximately two orders of magnitude faster than the previous best and is proven secure under standard assumptions using a game-based definition.

Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations

This paper generalizes Lindell’s solution using hash proof systems and results in a simulation-based security proof without resorting to non-standard interactive assumptions.

A robust threshold elliptic curve digital signature providing a new verifiable secret sharing scheme

A new verifiable secret sharing scheme (VSS) other than Feldman's and Pedersen's schemes suitable to protect elliptic curve secret keys and is able to tolerate n/3 malicious adversary with the cost of higher complexity.

Robust Threshold DSS Signatures

This work presents threshold DSS (digital signature standard) signatures where the power to sign is shared by n players such that for a given parameter t there is a consensus that n players should have the right to sign.