Explores zero-knowledge construction, setup models, and the power of interaction in cryptographic protocols, including Sigma Protocol and NP Zero-Knowledge Proofs.
Explores bug-finding, verification, and the use of learning-aided approaches in program reasoning, showcasing examples like the Heartbleed bug and differential Bayesian reasoning.
Covers inductive propositions in Coq, focusing on evaluation rules for arithmetic expressions and their applications in defining partial and non-deterministic functions.
