Numerous challenges arise in the move to cloud computing. In this school, we will study two of them in depth. The first topic is that of verifiable computation. This considers the problem of a client (or local computer) outsourcing computation to an external server (e.g., the cloud). In this setting, the client wishes to verify that the result of the computation carried out by the server is correct. However, the verification of this proof should be much faster than carrying out the computation from scratch. The research in this area has deep and beautiful theory, and has recently progressed to implementations and applications. The school will cover the entire spectrum of research on this topic.
The second topic considers different types of encryption methods that enable clients to encrypt data and carry out limited processing (e.g., search) while keeping it encrypted. These types of encryption are classically intended for use in the cloud, since data only needs to be decrypted once it is retrieved. The school will cover format-preserving and order-preserving encryption (and their weaknesses), and practical searchable encryption.
The school program includes approximately 21 hours of lectures and a half-day excursion.
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.
- Alexandra Boldyreva(link is external) (Georgia Tech)
- Yael Kalai(link is external) (Microsoft Research)
- Hugo Krawczyk (IBM T.J. Watson)
- Benny Pinkas(link is external) (Bar-Ilan University)
- Eran Tromer(link is external) (Tel-Aviv University)
- Michael Walfish(link is external) (New York University)
- Mor Weiss(link is external) (Technion)
Where: The winter school will take place at the Rayman hall at Kfar Hamaccabiah events & conference center(link is external) in Ramat Gan
When: Monday January 4, 2016 to Thursday January 7, 2016
Note that the 13th Theory of Cryptography Conference(link is external) (TCC 2016) will be held in Tel-Aviv in the week following the winter school (January 10-13, 2016).
Registration: Participation is free, but registration is required. Registration includes school participation, lunch, refreshments and the excursion (Accommodation is not included). Please register by November 30, 2015. The registration form will be available soon.
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(link is external) 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.
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 November 15, 2015. Please have your advisor send a letter justifying the need for financial support.
Sponsorship: This winter school 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), and the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister's Office, Bar-Ilan University.
Program Schedule: The detailed schedule for the winter school can be downloaded here(link is external).
Monday, January 4: Verifiable Computation
- Michael Walfish: Introduction and Overview of Verifiable Computation
- Yael Kalai: Short Proofs of Delegated Computation: Foundations and Feasibility 1
- Yael Kalai: Short Proofs of Delegated Computation: Foundations and Feasibility 2
- Yael Kalai: Short Proofs of Delegated Computation: Foundations and Feasibility 3
- Michael Walfish: Interactive Arguments with Processing
- Eran Tromer: SNARKs with Preprocessing
Tuesday, January 5: Verifiable Computation
- Michael Walfish: Interactive Proofs and Program Representations 1
- Eran Tromer: Program Representations 2
- Eran Tromer: SNARKs (without Preprocessing) and Their Applications
Wednesday, January 6: Verifiable Computation and Special Encryption
- Michael Walfish: Additional Applications and Summary of Verifiable Computation
- Alexandra Boldyreva: Introduction to Searchable Encryption (models and motivation)
- Mor Weiss: Format-Preserving Encryption 1
- Mor Weiss: Format-Preserving Encryption 2
- Mor Weiss: Format-Preserving Encryption 3
- Alexandra Boldyreva: Order-Preserving Encryption 1
- Alexandra Boldyreva: Order-Preserving Encryption 2
Thursday, January 7: Special Encryption
- Alexandra Boldyreva: Statistical Attacks on Deterministic and Order-Preserving Encryption
- Hugo Krawczyk: Probabilistic Searchable Symmetric Encryption
- Hugo Krawczyk: Practical Searchable Encryption on Large Datasets 1
- Hugo Krawczyk: Practical Searchable Encryption on Large Datasets 2
- Hugo Krawczyk: Practical Searchable Encryption on Large Datasets 3
- Benny Pinkas: Searchable Encryption using ORAM
This opportunity has expired. It was originally published here: