Cryptographic Hardness and Statistical Inference

Explore the intersection of cryptographic hardness and statistical inference in this invited conference talk delivered at TCC 2024. Delve into advanced theoretical concepts as Andrej Bogdanov presents cutting-edge research connecting cryptographic complexity with statistical learning theory. Examine how computational hardness assumptions in cryptography relate to fundamental problems in statistical inference and machine learning. Gain insights into the theoretical foundations that bridge these two important areas of computer science and mathematics. Learn about recent developments and open problems at the forefront of theoretical cryptography research. The session, chaired by Elette Boyle, provides an in-depth academic exploration suitable for researchers and advanced students in cryptography, theoretical computer science, and related fields.