Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography

Explore the concept of Advisor-Verifier-Prover Games and their implications for the hardness of information theoretic cryptography in this virtual talk by Benny Applebaum from Tel-Aviv University. Delve into the necessity of one-way functions for most cryptographic tasks and examine several problems where efficient information-theoretic solutions cannot be ruled out. Discover a new hypothesis on the existence of certain proof systems and its unified implications for the impossibility of efficient information-theoretic solutions to important cryptographic tasks. Gain insights into minimal complexity assumptions for cryptography and their significance in the field.