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

Slides:

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

• Nir Bitanski, MIT
  Our Current Knowledge of Knowledge Assumptions

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

• Yuval Ishai, Technion & UCLA
  Homomorphic Secret Sharing

• Huijia Rachel Lin, UCSB
  Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs

• Mohammad Mahmoody, University of Virginia
  Black-box and Non-black-box Lower Bounds on Assumptions behind IO

• Chris Peikert, University of Michigan
  Lattice Assumptions in Crypto: Status Update

• Stefano Tessaro, UCSB
  Public-seed Pseudorandom Permutations

• Salil Vadhan, Harvard
  Pseudorandom Generators from One-Way Functions via Computational Entropy

• Vinod Vaikuntanathan, MIT
  Attacks on Blockwise Local PRGs and Indistinguishability Obfuscation

Workshop Index

DIMACS Homepage