Talk page
Title:
Graph expansion and communication complexity of algorithms
Speaker:
Abstract:
The Martians built an amazingly fast computer and they run it to answer the great question of life, the universe and everything. They claim that the answer is 42. Will they be able to convince us that this is the right answer, assuming that we do not have sufficient computational power to run the computation ourselves, and that we do not trust Martians? The problem of verifiable computation delegation is a central problem in cryptography. We show a curious connection between that problem and the model of multi-prover interactive proofs that are sound against no-signaling (cheating) strategies, a model that was studied in relation to multi-prover interactive proofs with provers that share quantum entanglement, and is motivated by the physical principle that information cannot travel faster than light. We prove that the class of languages that have polynomial-time multi-prover interactive proofs that are sound against no-signaling strategies, is exactly EXP. We use this to give a 1-round delegation protocol for every language in EXP. Joint work with Yael Tauman Kalai and Ron Rothblum.
Link: