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:

This is a preliminary list of confirmed speakers.

A Survey of Computational Assumptions on Bilinear and Multilinear Maps
Allison Breton Bishop, Columbia University

Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-Malleable Codes
Dana Dachman-Soled, University of Maryland

Obfuscation from Low-degree Multilinear Maps
Rachel Lin, UCSB

Lower Bounds on Indistinguishability Obfuscation in Extended Black-box Model
Mohammad Mahmoody, University of Virginia

TBA
Chris Peikert, University of Michigan

Public-seed Pseudorandom Permutations
Stefano Tessaro, UCSB

A Survey of Computational Entropy
Salil Vadhan, Harvard University


Previous: Participation
Next: Registration
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on April 25, 2017.