Applied Multi-Party Computation


Secure multi-party computation (MPC) allows a set of parties to compute a function of their inputs while preserving input privacy and correctness. MPC has been an active area of research of cryptography for over 30 years. The last decade has witnessed significant interest and advances in the applied aspects of MPC. This workshop will bring together researchers in security and cryptography to discuss recent advances, challenges and research directions related to applied secure computation. The workshop will consist of invited keynote presentations, contributed presentations and round-table discussions on all aspects of applied secure computation.

Some topics of interest include:

  1. General-purpose secure computation
  2. Special-purpose secure computation
  3. Garbled circuits
  4. Private function evaluation
  5. Applications of secure computation
  6. Static circuit designs and compilers
  7. Implementation and deployment challenges
  8. New settings and security models

The workshop will include two discussion sessions on important topics related to applied MPC, including:

  1. The business case for MPC
  2. Theory vs. practice

Keynote Speakers


Thursday, February 20th

Welcome and Opening Remarks

9:00-9:50 | Video
Invited Talk, Yehuda Lindell
Efficient Two-Party Secure Computation for Semi-Honest and Malicious Adversaries,


10:00-12:00 – New Techniques and Models (Chair: Claudio Orlandi)
Hoeteck Wee, CNRS and ENS, Paris | Slides
Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction
Alex J. Malozemoff, University of Maryland, College Park | Slides
Efficient Secure Three-party Computation
Ranjit Kumaresan, Technion | Slides | Video
Improved OT Extension for Transferring Short Secrets
Tore K. Frederiksen, Aarhus University | Slides | Video
MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions


13:00-14:00 – Panel
Theory vs Practice


14:15-15:45 – Garbled Circuits (Chair: Vlad Kolesnikov)
Mike Rosulek, Oregon State University  |  Slides  |  Video
FleXOR: Flexible garbling for XOR gates that beats free-XOR
Claudio Orlandi, Aarhus University   |  Video
Zero-Knowledge Using Garbled Circuits: How To Prove Non-Algebraic Statements Efficiently
Viet Tung Hoang, University of California San Diego   |  Slides  |  Video
Efficient garbling from a fixed-key blockcipher


16:00-18:00 – Applications (Chair: Mariana Raykova)
Tomas Toft, Aarhus University   |  Video
Secure Collaborative Statistics in Credit Rating Using Linear Programming
Abdelrahaman Aly, C.O.R.E., Univesité catholique de Louvain   |  Slides  |  Video
Securely Solving Standard Network Flow Problems with Secure Multi-party Computation
Mahdi Zamani, University of New Mexico   |  Slides  |  Video
MPC in Large Networks with an Application to Anonymous Broadcast
Koki Hamada, NTT Secure Platform Laboratories   |  Slides
MEVAL: A Practically Efficient System for Secure Multi-party Statistical Analysis

Friday, February 21st

9:00-9:50, David Evans   |  Slides  |  Video
Invited Talk
Secure Computation in 2029: Boom, Bust, or Bonanza


10:00-11:10 – Databases (Chair: Aniket Kate)
Vlad Kolesnikov, Bell Labs; and Tal Malkin, Columbia University and Bar Ilan University   |  Slides  |  Video
Practical Private Database Querying
Riivo Talviste, Cybernetica AS   |  Slides  |  Video
Practical linking of databases using secure multiparty computation

11:10-12:10 – Server-Aided MPC (Chair: Mike Rosulek)
Benjamin Mood, University of Oregon   |  Slides
PartialGC: a system for saving and reusing intermediate garbled circuit values
Henry Carter, Georgia Institute of Technology   |  Slides
Whitewash: Outsourcing Garbled Circuit Generation for Mobile Devices


13:00-14:00 – Panel   |  Video
The Business Case for MPC


14:15-15:45 – Data-Oblivious Computation (Chair: Bryan Parno)
Marcel Keller, University of Bristol   |  Slides  |  Video
How to Implement (ORAM in) MPC
Mariana Raykova, SRI   |  Slides  |  Video
Secure Computation with Random Access Machines
Samee Zahur, University of Virginia   |  Video
Obliv-C: A Lightweight Compiler for Data-Oblivious Computation


16:00-17:30 – Asynchronous & Broadcast-Efficient MPC (Chair: Nishanth Chandran)
Juan Garay, Yahoo Labs   |  Slides  |  Video
Broadcast (and Round) Efficient Secure Multiparty Computation
Aniket Kate, MMCI, Saarland University   |  Video
Asynchronous MPC with t < n/2 Using Non-equivocation
Mahnush Movahedi, University of New Mexico   |  Slides  |  Video
Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation