Correlated oblivious transfer (COT) is a crucial building block for secure multi-party
computation (MPC) and can be generated efficiently via OT extension. Recent works based …

Uniform randomness beacons whose output can be publicly attested to be unbiased are
required in several cryptographic protocols. A common approach to building such beacons …

Given a small number of base oblivious transfers (OTs), how does one generate a large
number of extended OTs as efficiently as possible? The answer has long been the seminal …

In this paper we present ALBATROSS, a family of multiparty randomness generation
protocols with guaranteed output delivery and public verification that allows to trade off …

A collection of sets displays a proximity gap with respect to some property if for every set in
the collection, either (i) all members are δ-close to the property in relative Hamming distance …

In this work, we present two new actively secure, constant-round multi-party computation
(MPC) protocols with security against all-but-one corruptions. Our protocols both start with …

This paper describes a 1-out-of-N oblivious transfer (OT) extension protocol with active
security, which achieves very low overhead on top of the passively secure protocol of …

There have been tremendous advances in reducing interaction, communication and
verification time in zero-knowledge proofs but it remains an important challenge to make the …

We give computationally efficient zero-knowledge proofs of knowledge for arithmetic circuit
satisfiability over a large field. For a circuit with N addition and multiplication gates, the …

Recent works on distributed garbling have provided highly efficient solutions for constant-
round MPC tolerating an arbitrary number of corruptions. In this work, we improve upon state …