Workshops

Summer 2015

Securing Computation

Jun 8, 2015 to Jun 12, 2015

Return to event »

Click on the titles of individual talks for abstract, slides and archived video.

All events take place in the Calvin Lab Auditorium.

Monday, June 8th, 2015
9:00 am–9:20 am		Coffee and Check-In
9:20 am–9:30 am		Opening Remarks
9:30 am–10:30 am		Obfuscation: Past, Present, and Possible Futures Amit Sahai, UCLA
10:30 am–11:00 am		Break
11:00 am–12:00 pm		New Developments in Multilinear Maps: Zeroizing Attacks, Defenses, and Post-Zeroizing Obfuscation Eric Miles, UCLA and Mehdi Tibouchi, NTT Secure Platform Laboratories
12:00 pm–12:30 pm		Discussion
12:30 pm–2:15 pm		Lunch
2:15 pm–2:40 pm		Indistinguishability Obfuscation for Turing Machines with Unbounded Memory Brent Waters, UT Austin
2:45 pm–3:15 pm		Obfuscation with Constant Multiplicative Size Overhead Prabhanjan Ananth, UCLA 2015 Simons Award Winner
3:15 pm–3:45 pm		Break
3:45 pm–4:10 pm		Cryptocurrencies and Smart Contracts Elaine Shi, University of Maryland
4:15 pm–4:40 pm		Sequential Composition of Rational Proofs Rosario Gennaro, City University of New York
4:45 pm–5:10 pm		Rethinking Secure Computation - A Greedy Approach Muthuramakrishnan Venkitasubramaniam, University of Rochester

Tuesday, June 9th, 2015
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		A Brief History of Practical Garbled Circuit Optimizations Mike Rosulek, Oregon State University
10:30 am–11:00 am		Break
11:00 am–11:25 am		Fast Garbling of Circuits Under Standard Assumptions Yehuda Lindell, Bar-Ilan University
11:30 am–11:55 am		A Framework for Efficient Mixed-Protocol Secure Two-Party Computation Thomas Schneider, Technische Universität Darmstadt
12:00 pm–12:15 pm		Discussion
12:15 pm–2:00 pm		Lunch
2:00 pm–2:25 pm		Lower Bounds for Information-Theoretic MPC I van Damgård, Aarhus University
2:30 pm–2:55 pm		Capacity Inversion and MPC over Elastic Noisy Channels Hemanta Maji, UCLA
3:00 pm–3:30 pm		Break
3:30 pm–3:55 pm		Upending Stock Market Structure Using Secure Computation Charanjit Jutla, IBM T.J. Watson Research Center
4:00 pm–4:25 pm		Practical Private DB Querying Vlad Kolesnikov, Bell Labs and Tal Malkin, Columbia University
4:30 pm–5:30 pm		Reception

Wednesday, June 10th, 2015
9:00 am–9:30 am		Coffee and Check-In
9:30 am–9:55 am		A Wishlist for Verifiable Computation: An Applied CS Perspective Mike Walfish, New York University
10:00 am–10:25 am		SNARKs and their Practical Applications Eran Tromer, Tel Aviv University
10:30 am–11:00 am		Break
11:00 am–11:25 am		How to use Bitcoin to Enhance Secure Computation Ranjit Kumaresan, Massachusetts Institute of Technology
11:30 am–11:55 am		Provably Secure Blockchain Protocols and Applications to Secure Computation Aggelos Kiayias, University of Athens
12:00 pm–1:45 pm		Lunch
1:45 pm–2:00 pm		The Simplest Oblivious Transfer Protocol Claudio Orlandi, Aarhus University
2:00 pm–2:30 pm		The Whole is Greater than the Sum of its Parts: Linear Garbling and Applications Valerio Pastro, Columbia University
2:30 pm–3:30 pm		Discussion on Practical Advanced Crypto: Bottlenecks and the Future (moderated by Yehuda Lindell)
3:30 pm–4:00 pm		Break
4:00 pm–4:25 pm		Contention in Cryptography: Obfuscation, Leakage, UCE and the AI-DHI Assumptions Stefano Tessaro, UC Santa Barbara
4:30 pm–4:55 pm		How to Construct Indistinguishability Obfuscation from Compact Functional Encryption Abhishek Jain, Johns Hopkins University

Thursday, June 11th, 2015
9:00 am–9:30 am		Coffee and Check-In
9:30 am–9:55 am		Public-Coin Differing-Inputs Obfuscation and its Applications Omkant Pandey, UCLA
10:00 am–10:25 am		Obfuscation of Probabilistic Circuits and Applications Huijia (Rachel) Lin, UC Santa Barbara
10:30 am–11:00 am		Break
11:00 am–12:00 pm		Discussion on Obfuscation: Bottlenecks and the Future (moderated by Shai Halevi)
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		Breaking News Sessions / Young Researcher Presentations Multiple Speakers (Auditorium, Room 116 and the 2nd Floor Interaction Area)
2:30 pm–3:00 pm		Breaking News Sessions / Young Researcher Presentations Multiple Speakers (Auditorium, Room 116 and the 2nd Floor Interaction Area)
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		Breaking News Sessions / Young Researcher Presentations Multiple Speakers (Auditorium, Room 116 and the 2nd Floor Interaction Area)
4:00 pm–4:30 pm		Breaking News Sessions / Young Researcher Presentations Multiple Speakers (Auditorium, Room 116 and the 2nd Floor Interaction Area)

Friday, June 12th, 2015
9:00 am–9:30 am		Coffee and Check-In
9:30 am–9:55 am		Two Round MPC via Multi-Key FHE Daniel Wichs, Northeastern University
10:00 am–10:25 am		Efficient Multiparty Protocols via Log-Depth Threshold Formulae Ron Rothblum, Weizmann Institute
10:30 am–11:00 am		Break
11:00 am–11:25 am		Oblivious RAM for MPC Stanislaw Jarecki, UC Irvine
11:30 am–11:55 am		Provably Secure Virus Detection: Using the Uncertainty to End Computer Malware Vassilis Zikas, ETH Zürich
12:00 pm–12:15 pm		Discussion
12:15 pm–2:00 pm		Lunch
2:00 pm–2:25 pm		On the Cryptographic Hardness of Finding a Nash Equilibrium Omer Paneth, Boston University 2013 Simons Award Winner
2:30 pm–2:55 pm		How Fair is your Protocol? A Utility-Based Approach to Protocol Optimality Bjoern Tackmann, UC San Diego
3:00 pm–3:30 pm		Break
3:30 pm–3:55 pm		Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data Manoj Prabhakaran, University of Illinois, Urbana-Champaign
4:00 pm–4:25 pm		New Advances in Secure RAM Computation Sanjam Garg, UC Berkeley