Non-Interactive Verifiable Computation via Non-signaling

In this talk I will explain the blueprint for constructing succinct non-interactive (computationally sound) proofs from standard assumptions. The construction explores an interesting connection between cryptography and non-signaling.