## Hope for a Type-Theoretic Understanding of Zero-Knowledge

Noam Zeilberger

IMDEA Software Institute; Member, School of Mathematics

October 4, 2012

Noam Zeilberger

IMDEA Software Institute; Member, School of Mathematics

October 4, 2012

David Zywina

October 4, 2012

Leonid Polterovich

Tel Aviv University and SCGP

October 5, 2012

We discuss a quantum counterpart, in the sense of the Berezin-Toeplitz quantization, of certain constraints on Poisson brackets coming from "hard" symplectic geometry. It turns out that they can be interpreted in terms of the quantum noise of observables in operational quantum mechanics.

Amir Shpilka

Technion

October 8, 2012

Ran Raz

Weizmann Institute; Member, School of Mathematics

October 8, 2012

I will give an introduction to the problem of parallel repetition of two-prover games and its applications and related results in theoretical computer science (the PCP theorem, hardness of approximation), mathematics (the geometry of foams, tiling the space R^n) and, if time allows, physics (Bell inequalities, the EPR paradox).

Hao Huang

University of California, Los Angeles; Member, School of Mathematics

October 9, 2012

Alon Nishry

Tel Aviv University

October 9, 2012

Vladimir Voevodsky

Professor, School of Mathematics, IAS

October 10, 2012

Mark McLean

Massachusetts Institute of Technology; Member, School of Mathematics

October 15, 2012

Tsuyoshi Ito

NEC Laboratories America, Inc.

October 15, 2012