DIMACS Workshop on Complexity of Cryptographic Primitives and Assumptions

June 8 - 9, 2017
City College of New York

Organizers:: Rosario Gennaro, City College of New York, rosario at ccny.cuny.edu; Shai Halevi, IBM Research, shaih at us.ibm.com; Tal Malkin, Columbia University, tal at cs.columbia.edu; Oded Regev, New York University, regev at cims.nyu.edu

Presented under the auspices of the DIMACS Special Focus on Cryptography as part of the DIMACS/Simons Collaboration in Cryptography and the DIMACS Special Focus on Cybersecurity.

Workshop Program:

Thursday, June 8, 2017

 8:30 -  9:20	Registration and Breakfast

 9:20 -  9:30	Workshop Welcome 
                Rosario Gennaro, City College of New York

 9:30 - 10:30	Public-seed Pseudorandom Permutations    Slides
                Stefano Tessaro, UCSB
 
10:30 - 11:00	Break

11:00 - 12:00   Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs   Slides
                Huijia Rachel Lin, UCSB

12:00 -  1:00   Attacks on Blockwise Local PRGs and Indistinguishability Obfuscation   Slides
                Vinod Vaikuntanathan, MIT

 1:00 -  2:30	Lunch

 2:30 -  3:30	Our Current Knowledge of Knowledge Assumptions   Slides
                Nir Bitanski, MIT
	        
 3:30 -  4:30   Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-Malleable Codes   Slides
                Dana Dachman-Soled, University of Maryland

 4:30 -  5:00	Break

 5:00 -  6:00	Black-box and Non-black-box Lower Bounds on Assumptions behind IO   Slides
                Mohammad Mahmoody, University of Virginia
 	

Friday, June 9, 2017

 8:30 -  9:30	Registration and Breakfast

 9:30 - 11:30	Pseudorandom Generators from One-Way Functions via Computational Entropy   Slides
                Salil Vadhan, Harvard
 
11:30 - 12:00	Break

12:00 -  1:00   Homomorphic Secret Sharing   Slides
                Yuval Ishai, Technion & UCLA

 1:00 -  2:30	Lunch

 2:30 -  3:30	The State of Lattice-based Assumptions   Slides
	        Chris Peikert, University of Michigan

 3:30 -  4:00   Break

 4:00 -  5:00   A Survey of Computational Assumptions on Bilinear and Multilinear Maps   Slides
                Allison Breton Bishop, Columbia University