ADVANCES IN PRACTICAL MULTIPARTY COMPUTATION
FEBRUARY 15-19, 2015
In the setting of secure multiparty computation, two or more parties with private inputs wish to compute some joint function of their inputs. The security requirements of such a computation are privacy (meaning that the parties learn the output and nothing more), correctness (meaning that the output is correctly distributed), independence of inputs, and more. This setting encompasses computations as simple as coin-tossing and agreement, and as complex as electronic voting, electronic auctions, electronic cash schemes, anonymous transactions, and private information retrieval schemes. Due to its generality, secure computation is a central tool in cryptography.
Secure multiparty computation has been advancing in leaps and bounds in recent years, and is now at a state where many problems arising in practice can be solved. In this winter school, we will study the major techniques and state-of-the-art protocols for practical two-party and multiparty computation. The first day of the school will begin with tutorials for those not familiar with the basics of secure computation. This material can also be viewed from the 1st BIU winter school (the first, second, third, fourth and fifth lectures are recommended). The aim of the school is to start from the basics, and teach the material needed to bring the participants up to date with the latest results in this exciting field. The last day of the school will be a mini-workshop where latest results will be presented.
The school program includes approximately 27 hours of lectures and a half-day excursion to Jerusalem.
The target audience for the school is graduate students and postdocs in cryptography (we will assume that participants have taken at least one university-level course in cryptography). However, all faculty, undergrads and professionals with the necessary background are welcome. The winter school is open to participants from all over the world; all talks will be in English.
- Ivan Damgård (Aarhus University)
- Yehuda Lindell (Bar-Ilan University)
- Claudio Orlandi (Aarhus University)
- Benny Pinkas (Bar-Ilan University)
- abhi shelat (University of Virginia)
- Thomas Schneider (Technical University Darmstadt)
Organizers: Yehuda Lindell and Benny Pinkas, Department of Computer Science, Bar Ilan University, Israel
Where: The winter school will take place at the Rayman hall at Kfar Hamaccabiah events & conference center in Ramat Gan, except for the 1st day of tutorials which will take place in the Feldman Hall at Bar Ilan University.
When: Sunday February 15, 2015 to Thursday February 19, 2015
Registration: Participation is free, but registration is required. There will be separate registration for the 1st day and for the rest of the school. Registration includes school participation, lunch and refreshments, the excursion, and transportation between the hotel and Bar-Ilan on the first day. (Accommodation is not included). Please register by December 30, 2014. The registration form is available here.
Contact: For any questions or queries, please send an e-mail to: firstname.lastname@example.org
Hotel: We have arranged a special rate at the Kfar Hamaccabiah Hotel where the conference center is located. The rate is $160 a night for a single room, $180 a night for a double room (with two occupants) and $220 for a triple room (with three occupants). The rate includes breakfast. On the 1st day (February 15, 2015), we will provide transportation to and from Bar-Ilan University. Hotel reservation form is avaiable here.
Support: A limited number of stipends of $800 each (for flight and accommodation) will be awarded for overseas students needing support. The deadline for stipend application is December 15, 2014. Please have your advisor send a letter justifying the need for financial support.
Sponsorship: This winter school is in cooperation with the International Association for Cryptologic Research and it is graciously sponsored by the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement n. 615172 (HIPS), the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement n. 609611 (PRACTICE), Bar-Ilan University, the Check Point Institute for Information Security and the Leona H. and Harry B. Helmsley Charitable Trust and the Israel National Cyber Bureau.
Program Schedule: The detailed schedule for the winter school can be downloaded here.
Sunday, February 15: Tutorials
Lecturers: Yehuda Lindell and Benny Pinkas
- Yehuda Lindell: Definitions and Oblivious Transfer (slides and video)
- Benny Pinkas: Yao’s Two-Party Protocol and the BMR Multi-Party Protocol (slides and video)
- Benny Pinkas: The GMW Multi-Party Protocol and Oblivious Transfer Extension (slides and video)
- Yehuda Lindell: Efficient Zero-Knowledge (slides and video)
- Yehuda Lindell: Security against Malicious Adversaries (slides and video)
Monday, February 16: Practical Two-Party Computation Based on Yao’s Protocol
Lecturers: Thomas Schneider and abhi shelt
- Thomas Schneider: Optimizing Yao and GMWl for Semi-Honest Adversaries (slides and video)
- abhi shelat: Security for Malicious Adversaries with Yao’s Protocol – part 1 (slides and video)
- abhi shelat: Security for Malicious Adversaries with Yao’s Protocol – part 2 slides and video)
- abhi shelat: Implementation Issues and Optimizations (slides and video)
Tuesday, February 17: The TinyOT Protocol
Lecturer: Claudio Orlandi
- Claudio Orlandi: The TinyOT Protocol – part 1 (slides part 1 and video)
- Claudio Orlandi: The TinyOT Protocol – part 2 (slides part 2, slides part 3 and video)
- Excursion to Jerusalem, including Dinner
Wednesday, February 18: SPDZ and Specific Protocols
Lecturer: Ivan Damgård and Benny Pinkas
- Ivan Damgård: The SPDZ Protocol – part 1 (slides parts 1&2 and video part 1)
- Ivan Damgård: The SPDZ Protocol – part 2 (video part 2)
- Benny Pinkas: ORAM (slides and video)
- Benny Pinkas: Set Intersection (slides and video)
Thursday, February 19: Workshop – New Results in Practical MPC
- Ivan Damgård: UC Secure Commitments with Optimal Amortized Overhead (slides and video)
- Gilad Asharov: : More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries (slides and video)
- Elette Boyle: Large-Scale Secure Computation: MPC for Parallel RAM Programs (slides and video)
- Muthuramakrishnan Venkitasubramaniam: Rethinking for Secure Computation – A Greedy Approach (slides and video)
- Carmit Hazay: Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs (slides and video)
- Christian Rechberger: Ciphers for MPC and FHE (slides)
- Yehuda Lindell: A Tutorial on SCAPI (slides and video)
- Marcel Keller: How to Implement Anything in MPC (slides and video)
- Michael Zohner: ABY – A Framework for Efficient Mixed-Protocol Secure Two-Party Computation (slides and video)
- Ben Riva: New Consistency Checks and Implementing Online/Offline Yao (slides and video)
- Claudio Orlandi: Privacy-Free Garbled Circuits with Applications To Efficient Zero-Knowledge (slides and video)