Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Applied Multi-Party Computation

Thursday, February 20th 

8:55-9:00 - Welcome and Opening Remarks
9:00-9:50 - Invited Talk
  • Efficient Two-Party Secure Computation for Semi-Honest and Malicious Adversaries
    Yehuda Lindell
    video
9:50-10:00 - Break
10:00-12:00 - New Techniques and Models (Chair: Claudio Orlandi)
  • Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction
    Hoeteck Wee, CNRS and ENS, Paris
    slides
  • Efficient Secure Three-party Computation
    Alex J. Malozemoff, University of Maryland, College Park
    slides
  • Improved OT Extension for Transferring Short Secrets
    Ranjit Kumaresan, Technion
    slides, video
  • MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions
    Tore K. Frederiksen, Aarhus University
    slides, video
12:00-13:00 - Lunch
13:00-14:00 - Panel
  • Theory vs Practice
14:00-14:15 - Break
14:15-15:45 - Garbled Circuits (Chair: Vlad Kolesnikov)
  • FleXOR: Flexible garbling for XOR gates that beats free-XOR
    Mike Rosulek, Oregon State University
    slides, video
  • Zero-Knowledge Using Garbled Circuits: How To Prove Non-Algebraic Statements Efficiently
    Claudio Orlandi, Aarhus University
    video
  • Efficient garbling from a fixed-key blockcipher
    Viet Tung Hoang, University of California San Diego
    slides, video
15:45-16:00 - Break
16:00-18:00 - Applications (Chair: Mariana Raykova)
  • Secure Collaborative Statistics in Credit Rating Using Linear Programming
    Tomas Toft, Aarhus University
    video
  • Securely Solving Standard Network Flow Problems with Secure Multi-party Computation
    Abdelrahaman Aly, C.O.R.E., Univesité catholique de Louvain
    slides, video
  • MPC in Large Networks with an Application to Anonymous Broadcast
    Mahdi Zamani, University of New Mexico
    slides, video
  • MEVAL: A Practically Efficient System for Secure Multi-party Statistical Analysis
    Koki Hamada, NTT Secure Platform Laboratories
    slides

 

Friday, February 21st

9:00-9:50 - Invited Talk

  • Secure Computation in 2029: Boom, Bust, or Bonanza
    David Evans
    slides, video
9:50-10:00 - Break
10:00-11:10 - Databases (Chair: Aniket Kate)
  • Practical Private Database Querying
    Vlad Kolesnikov, Bell Labs; and Tal Malkin, Columbia University and Bar Ilan University
    slides, video
  • Practical linking of databases using secure multiparty computation
    Riivo Talviste, Cybernetica AS
    slides, video
11:10-12:10 - Server-Aided MPC (Chair: Mike Rosulek)
  • PartialGC: a system for saving and reusing intermediate garbled circuit values
    Benjamin Mood, University of Oregon
    slides
  • Whitewash: Outsourcing Garbled Circuit Generation for Mobile Devices
    Henry Carter, Georgia Institute of Technology
    slides
12:10-13:00 - Lunch
13:00-14:00 - Panel
  • The Business Case for MPC
    video
14:00-14:15 - Break
14:15-15:45 - Data-Oblivious Computation (Chair: Bryan Parno)
  • How to Implement (ORAM in) MPC
    Marcel Keller, University of Bristol
    slides, video
  • Secure Computation with Random Access Machines
    Mariana Raykova, SRI
    slides, video
  • Obliv-C: A Lightweight Compiler for Data-Oblivious Computation
    Samee Zahur, University of Virginia
    video
15:45-16:00 - Break
16:00-17:30 - Asynchronous & Broadcast-Efficient MPC (Chair: Nishanth Chandran)
  • Broadcast (and Round) Efficient Secure Multiparty Computation
    Juan Garay, Yahoo Labs
    slides, video
  • Asynchronous MPC with t < n/2 Using Non-equivocation
    Aniket Kate, MMCI, Saarland University
    video
  • Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation
    Mahnush Movahedi, University of New Mexico
    slides, video