Oblivious transfer (OT) protocol is an essential tool in cryptography that provides a wide
range of applications such as secure multi-party computation, private information retrieval …

We study a model of fairness in secure computation in which an adversarial party that aborts
on receiving output is forced to pay a mutually predefined monetary penalty. We then show …

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 propose Tesseract, a secure real-time cryptocurrency exchange service. Existing
centralized exchange designs are vulnerable to theft of funds, while decentralized …

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 …

The Round Complexity of Secure Protocols Page 1 The Round Complexity of Secure Protocols
(Extended Abstract) Donald Beaver* Harvard University Silvio Micali t Phillip Rogaway t MIT …

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 …

This paper describes a simple candidate one-way hash function which satisfies a quasi-
commutative property that allows it to be used as an accumulator. This property allows …

We show how to securely realize any multi-party functionality in a universally composable
way, regardless of the number of corrupted participants. That is, we consider a multi-party …

Prior verifiable secret-ballot election protocols all suffer from a common defect whkhrenderst
hemunsuitablef orpracticalu se: they allow voters to (if they wish) carry away from the …