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 …

Secure multiparty computation allows mutually distrusting parties to compute a function on
their private inputs such that nothing but the function output is revealed. Achieving fairness …

In this paper, we present the Active Harmony automated runtime tuning system. We describe
the interface used by programs to make applications tunable. We present the Library …

We initiate the study of multi-user (mu) security of authenticated encryption (AE) schemes as
a way to rigorously formulate, and answer, questions about the “randomized nonce” …

We study the security of the widely deployed Secure Session Layer/Transport Layer Security
(TLS) key agreement protocol. Our analysis identifies, justifies, and exploits the modularity …

Fairly exchanging digital content is an everyday problem. It has been shown that fair
exchange cannot be achieved without a trusted third party (called the Arbiter). Yet, even with …

A private set intersection (PSI) protocol allows two parties to compute the intersection of their
input sets privately. Most of the previous PSI protocols only output the result to one party and …

Optimistic fair exchange (OFE) is a protocol for solving the problem of exchanging items or
services in a fair manner between two parties, a signer and a verifier, with the help of an …

Multi-party fair exchange (MFE) and fair secure multi-party computation (fair SMPC) are
under-studied fields of research, with practical importance. We examine MFE scenarios …

Bitcoin and Secure Computation With Money How to Use Bitcoin to Play Internet Poker Page 1
Fairness with Penalties Secure Cash Distribution End Bitcoin and Secure Computation With …