One of the most fundamental notions of cryptography is that of simulation. It stands behind
the concepts of semantic security, zero knowledge, and security for multiparty computation …

Decentralized exchanges (DEXs) allow parties to participate in financial markets while
retaining full custody of their funds. However, the transparency of blockchain-based DEX in …

We consider front-running to be a course of action where an entity benefits from prior access
to privileged market information about upcoming transactions and trades. Front-running has …

We propose a novel paradigm for defining security of cryptographic protocols, called
universally composable security. The salient property of universally composable definitions …

The difference between theory and practice often rests on one major factor: efficiency. In
distributed systems, communication is usually expensive, and protocols designed for …

We present general definitions of security for multiparty cryptographic protocols, with focus
on the task of evaluating a probabilistic function of the parties' inputs. We show that, with …

More than ten years have elapsed since the rst completeness theorems for two-party and
multi-party fault-tolerant computation have been announced (by Yao and Goldreich, Micali …

The increasing use of data-mining tools in both the public and private sectors raises
concerns regarding the potentially sensitive nature of much of the data being mined. The …

Cryptographic computations are often carried out on insecure devices for which the threat of
key exposure represents a serious and realistic concern. In an effort to mitigate the damage …

A fundamental problem in designing secure multi-party protocols is how to deal with
adaptive adversaries (ie, adversaries that may choose the corrupted parties during the …