DIMACS/CEF Workshop on Advances and Limits of Program Obfuscation

Dates: November, 2016 (approximate)
Stanford University

Organizers:
Dan Boneh, Stanford University, dabo at cs.stanford.edu
Sanjam Garg, UC Berkeley, sanjamg at berkeley.edu
Yael Tauman Kalai, Microsoft Research New England, yael at microsoft.com
Amit Sahai, UCLA, sahai at cs.ucla.edu
Presented under the auspices of the DIMACS Special Focus on Cryptography as part of the DIMACS/Simons Collaboration in Cryptography and the Center for Encrypted Functionalities.

Workshop Program:

Tuesday, November 8, 2016 

 9:20 -  9:30   Welcome   
                Dan Boneh 

Obfuscation 

 9:30 - 10:10 	Indistinguishability obfuscation with non-trivial efficiency  
                Rafael Pass (Cornell) 
                Paper

10:10 - 10:50	From cryptomania to obfustopia through secret-key functional encryption 
                Alain Passelégue  (ENS) 
                Paper   Video

10:50 - 11:20	Break 

11:20 - 12:20   Keynote: Indistinguishability obfuscation from constant-degree graded encodings   
                Rachel Lin (UCSB) 
                Paper   Video 

12:20 -  1:50 	Lunch 

Obfuscation continued 

 1:50 -  2:30 	Improved iO from constant-degree mmaps   
                Prabhanjan Ananth (UCLA) 
                Video 

 2:30 -  3:10   Universal Samplers   
                Dakshita Khurana (UCLA) 
                Paper   Video 

 3:10 -  3:50   Single-Key to multi-key functional encryption with polynomial loss   
                Akshayaram Srinivasan (UC Berkeley) 
                Paper   Video  

 3:50 -  4:15	Break 

General cryptography 

 4:15 -  4:45	Micropayments   
                Pratyush Mishra (UC Berkeley)
                Video  

 4:45 -  5:15   Non-interactive RAM and batch NP delegation from any PIR   
                Justin Holmgren (MIT) 
                Paper   Video  

 5:15pm 	End of day one 


Wednesday, November 9, 2016 

 9:20 -  9:30   Welcome   
  
Obfuscation 

 9:30 - 10:30   Keynote: Mmaps for obfuscation: attacks and defenses   
                Mark Zhandry (Princeton) 
                Paper   

10:30 - 11:00	Break 

11:00 - 11:40   Obfuscation for Circuits in Weak Mmap Model   
                Nico Doettling 

11:40 - 12:20   Nipped in the Bud: Graded Encoding Schemes That Did Not Make It (and Lessons Learned)   
                Zvika Brakerski 
                Video  

12:20 -  1:50 	Lunch 

General cryptography 

 1:50 -  2:20   A new approach to searching on encrypted data   
                David Wu (Stanford) 
                Paper   Video  

 2:20 -  2:50   Prio: Private, Robust, and Scalable Computation of Aggregate Statistics   
                Henry Corrigan-Gibbs (Stanford) 

 2:50 - 3:10	Break 

Back to obfuscation 

 3:10 -  3:50   5Gen: A framework for prototyping applications using Mmaps and matrix branching programs  
                Mariana Raykova (Yale) 
                Paper

 3:50 -  4:30   Lower Bounds on IO from All-or-Nothing Encryption Primitives  
                Mohammad Mahmoody (University of Virginia) 
                Paper   Video  

 4:30pm 	Workshop end
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on May 5, 2017.