Claudio Orlandi

A New Approach to Practical Active-Secure Two-Party Computation

We propose a new approach to practical two-party computation secure against an active adversary. All prior practical protocols were based on Yaos garbled circuits. We use an OT-based approach and get efficiency via OT extension in the random oracle model. To get a practical protocol we introduce a number of novel techniques for relating the outputs and inputs of OTs in a larger construction. We also report on an implementation of this approach, that shows that our protocol is more efficient than any previous one: For big enough circuits, we can evaluate more than 20000 Boolean gates per second. As an example, evaluating one oblivious AES encryption

Privacy-aware mechanism design

\sim 34000

A privacy-preserving protocol for neural-network-based computation

gates takes 64i¾?seconds, but when repeating the task 27i¾?times it only takes less than 3i¾?seconds per instance.

Oblivious neural network computing via homomorphic encryption

This paper continues the recent line of work of making Yaos garbled circuit approach to two-party computation secure against an active adversary. We propose a new cut-and-choose based approach called LEGO (Large Efficient Garbled-circuit Optimization): It is specifically aimed at large circuits. Asymptotically it obtains a factor

Publicly Auditable Secure Multi-Party Computation

\log\vert\mathcal{C}\vert

Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge

improvement in computation and communication over previous cut-and-choose based solutions, where

Essentially Optimal Universally Composable Oblivious Transfer

\vert\mathcal{C}\vert

The Simplest Protocol for Oblivious Transfer

is the size of the circuit being computed. The protocol is universally composable (UC) in the OT-hybrid model against a static, active adversary.