MPC School and Workshop

March 27 to March 31, 2017

IIT Bombay

Organized as part of National Mathematics Initiative's Thematic Year on Cryptography and Complexity Theory.

MPC School

Secure Multi-Party Computation (MPC) is a tool in modern cryptography that allows mutually distrusting parties to collaborate. Applications of MPC could include auctions, games, and collaboration among competing corporations or different agencies of the government. The 3-day school will consist of tutorials covering basic and advanced topics related to the theory of MPC, aimed at Computer Science students and researchers interested in cryptography. No prior familiarity with MPC will be assumed, but mathematical maturity and exposure to theoretical computer science would be helpful in following the tutorials.

When: March 27 - 29, 2017.
Where: IIT Bombay, Dept. of Computer Science and Engineering, KReSIT Building, 3rd floor Lecture Hall
Monday 10:30 - 11:00 Reception/Registration
11:00 - 12:30 What is MPC? Manoj slides video
2:00 - 3:00 Zero Knowledge Muthu slides video
3:30 - 5:00 Garbled Circuit Arpita slides video
Tuesday 9:30 - 11:00 Randomized Encoding Yuval slides video
11:30 - 12:30 Oblivious Transfer Arpita slides video
2:00 - 3:30 Composition Muthu slides video
4:00 - 5:00 MPC Complexity Manoj slides video
Wednesday 9:00 - 10:30 Honest-Majority MPC Vassilis slides video
11:00 - 12:30 "MPC in the head" Yuval slides video
2:00 - 3:00 Asynchronous MPC Vassilis slides video

Workshop on MPC and Related Topics in Cryptography

The 2-day workshop will have speakers presenting some of their recent research. It will also include a session where students working in topics related to MPC can present their work.

When: March 30 - 31, 2017.
Where: IIT Bombay, Dept. of Computer Science and Engineering
Schedule (Tentative):
(If anyone else is planning to attend the workshop and is interested in giving a talk, please contact Manoj.)
Thursday 9:00 - 10:00 Muthu Venkitasubramaniam Equivocating Yao: Constant-Rounds Adaptively Secure
Multiparty Computation in the Plain Model
10:00 - 11:00 Nishanth Chandran Actively Secure and Concretely Efficient Constant-round MPC:
Beyond the Three-Party Case
11:30 - 12:30 Arpita Patra Fast Actively Secure OT Extension for Short Secrets
2:00 - 3:00 Shweta Agrawal Beyond the Circuit Barrier:
New Constructions for Functional Encryption
3:30 - 5:00 Student presentations
Friday 9:30 - 10:30 Vassilis Zikas The Price of Low Communication in Secure Multi-Party Computation
11:00 - 12:00 Manoj Prabhakaran Secure Protocol Transformations