Cryptocurrency exchange services are either trusted central entities that have been routinely
hacked (losing over 8 billion USD), or decentralized services that make all orders public …

One of the main tools to construct secure two-party computation protocols are Yao garbled
circuits. Using the cut-and-choose technique, one can get reasonably efficient Yao-based …

In the last few years garbled circuits (GC) have been elevated from being merely a component
in Yao’s protocol for secure two-party computation, to a cryptographic primitive in its own …

SPDZ, TinyOT and MiniMAC are a family of MPC protocols based on secret sharing with
MACs, where a preprocessing stage produces multiplication triples in a finite field. This work …

Front-running is the malicious, and often illegal, act of both manipulating the order of
pending trades and injecting additional trades to make a profit at the cost of other users. In …

We present two new, highly efficient, protocols for securely generating a distributed RSA key
pair in the two-party setting. One protocol is semi-honestly secure and the other maliciously …

The proliferation of Decentralised Finance (DeFi) and Decentralised Autonomous Organisations
(DAO), which in current form are exposed to front-running of token transactions and …

We present a new protocol for maliciously secure two-party computation based on cut-and-choose
of garbled circuits using the recent idea of “forge-and-loose”, which eliminates around …

Recent years have seen the emergence of practical advanced cryptographic tools that not
only protect data privacy and authenticity, but also allow for jointly processing data from …

We describe, and implement, a maliciously secure protocol for two-party computation in a
parallel computational model. Our protocol is based on Yao’s garbled circuit and an efficient …