Weizmann Institute of Science

Faculty of Mathematics and Computer Science

Lecture Series in Cryptography and Complexity

This lecture series is planned to feature approximately 20 lectures a year, by leading researchers in the field. The focus on Cryptography and Complexity is aimed to build on Weizmann's strength in these areas and to enrich is by offering a variety of new perspectives and new developements.

Past and forthcoming lectures

• Ron Rivest, Security of voting systems, April 12, 2010.
• Krzysztof Pietzak, Tamper proof (double feature), April 14, 2010.
• Boaz Barak, Subexponential Algorithms for Unique Games and Related Problems, May 11, 2010.
• Swastik Kopparty, Random graphs and the parity quantifier May 13, 2010.
• Andrej Bogdanov A better tester for bipartiteness? May 16, 2010
• Shubhangi Saraf, Blackbox Polynomial Identity Testing for Depth 3 Circuits, May 17, 2010.
• Silvio Micali, Perfect Revenue from Perfectly Informed Players, June 17, 2010.
• Brendan Juba, Universal Semantic Communication, June 27, 2010.
• Daniele Micciancio, Solving all lattice problems in deterministic single exponential time, cancelled.
• Vinod Vaikuntanathan, on developments in homomorphic encryption and leakage resilient cryptography, cancelled.
• Cynthia Dwork, Privacy Against Many Arbitrary Low-Sensitivity Queries, Nov. 1, 2010.
• Shai Halevi, Fully Homomorphic Encryption over the Integers, November 15, 2010.
• David Steurer, Graph Expansion and Two-Prover Games, December 13, 2010.
• Guy Rothblum, Boosting and Differential Privacy, December 19, 2010.
• Venkatesan Guruswami, Bridging Shannon and Hamming: Codes for computationally simple channels, December 20, 2010.
• Oded Regev, Quantum One-Way Communication Can Be Exponentially Stronger than Classical Communication, Jan. 31, 2011.
• Julia Kempe, A geometric Lovasz Local Lemma and applications to quantum SAT, Feb. 7, 2011.
• Tal Malkin, Efficient Circuit-Size Independent KDM Secure Public Key Encryption, Feb. 14, 2011.
• Prasad Raghavendra, Approximating Graph Expansion: Connections, Algorithms and Reductions, March 14, 2011.
• Shachar Lovett, Linear systems modulo composites, March 28, 2011.
• Tim Roughgarden, The Price of Anarchy: Out-of-Equilibrium Guarantees, Intrinsic Robustness, and Beyond, April 11, 2011
• Nisheeth Vishnoi, Fast Spectral Algorithms for Graph Partitioning and Graph Decomposition, May 4, 2011.
• Kevin Matulef, Property Testing Lower Bounds via Communication Complexity, May 8, 2011.
• Daniel Spielman, Spectral Sparsification of Graphs and Approximations of Matrices, May 15, 2011.
• Jason Hartline, The Theory of Crowdsourcing Contests, May 29, 2011
• Avi Wigderson, Determinant and Permanent, June 6, 2011
• Zvika Brakerski, Efficient Fully Homomorphic Encryption from (Standard) LWE, June 15, 2011
• Amit Sahai, A New Protocol Compiler, June 16, 2011
• Nicole Immorlica, Optimal Auctions over Social Networks, June 26, 2011

This lecture series is supported by a research grant from Walmart.

A general list of all faculty's seminars is available at the webpage of the Faculty's upcoming seminars.

See also the WIS TOC calendar.

This page is maintained by Oded Goldreich.