Roei Tell (IAS) - A Free Lunch Theorem for De-randomization of Proof Systems, and Consequences
In the first half of the talk, I’ll set up some background, by describing two recent directions in the study of de-randomization: A non-black-box algorithmic framework, which replaces the classical PRG-based paradigm; and free lunch results, which eliminate randomness with essentially no runtime overhead.
In the second half we’ll see one result along these directions: Under hardness assumptions, every doubly efficient proof system with constantly many rounds of interaction can be simulated by a deterministic NP-type verifier, with essentially no runtime overhead, such that no efficient adversary can mislead the deterministic verifier. Consequences include an NP-type verifier of this type for #SAT, running in time 2^{eps*n} for an arbitrarily small constant eps>0; and a complexity-theoretic analysis of the Fiat-Shamir heuristic in cryptography.
The talk is based on a joint work with Lijie Chen (UC Berkeley).
Speakers
Roei Tell
I’m a postdoc at IAS+DIMACS working in Theoretical Computer Science and Complexity Theory. Previously, I was a postdoc at MIT and completed my PhD at the Weizmann Institute of Science.
