Subgroup Tests and the Aldous-Lyons Conjecture
Explore the refutation of the Aldous-Lyons conjecture through novel interactive proof systems and subgroup tests, connecting complexity theory to probability theory and group theory.
Subgroup Tests and the Aldous-Lyons Conjecture
Explore the refutation of the Aldous-Lyons conjecture through novel interactive proof systems and subgroup tests, connecting complexity theory to probability theory and group theory.
Classical Verification of Quantum Learning
Explore the verification framework enabling classical clients to reliably delegate learning tasks to quantum servers, focusing on parity learning and Fourier-sparse functions with mixture-of-superpositions examples.
Statistical Zaps and New Oblivious Transfer Protocols
Explore statistical zaps, new oblivious transfer protocols, and their applications in cryptography. Delve into interactive proof systems, witness indistinguishability, and statistical security in two-party protocols.
Quantum Cloud Computing - Prof Elham Kashefi
Explore quantum technology's impact on cloud computing, covering verification, protocols, and secure multi-party computing with Prof Elham Kashefi.
Fully Linear PCPs and Their Cryptographic Applications
Explore probabilistically checkable proofs, distributed verifiers, and cryptographic applications with a focus on fully linear PCPs and their impact on secure protocols and communication complexity.
How to Do Fiat-Shamir in the Standard Model
Explore interactive protocols, Fiat-Shamir transformation, and delegation in cryptography. Learn about security assumptions, hash functions, and correlation intractability in probabilistic proof systems.
How to Delegate Computations Publicly
Explore probabilistically checkable and interactive proof systems, focusing on publicly verifiable arguments and non-interactive protocols for delegating computations.
Transparent SNARKs from DARK Compilers
Explore transparent SNARKs and DARK compilers in cryptography. Learn about polynomial commitments, interactive proof systems, and recent advancements in zero-knowledge proofs for blockchain applications.
Efficient Zero-Knowledge Proofs: A Modular Approach
Explore modular techniques for creating efficient zero-knowledge proofs, focusing on probabilistically checkable and interactive proof systems in cryptography.
On Prover-Efficient Public-Coin Emulation of Interactive Proofs
Explore the relationship between private-coin and public-coin interactive proofs, focusing on efficiency-preserving transformations and their implications for cryptographic assumptions and protocol design.
IP = PSPACE - Graduate Complexity Lecture at CMU
Explore interactive proof systems and their relationship to complexity classes, focusing on the IP = PSPACE theorem and its implications for computational theory.
More on Constant-Round Interactive Proof Systems - Graduate Complexity Lecture at CMU
Explore constant-round interactive proof systems in computational complexity theory, covering MA, AM, BPP, and efficient error reduction techniques.
NEXP is Contained in MIP* - Complexity Theory Breakthrough
Explore groundbreaking results in computational complexity theory, examining the relationship between NEXP and MIP* with insights from experts Anand Natarajan and John Wright.
Subgroup Tests and Tailored Non-local Games - Lecture on Interactive Proof Systems
Explore advanced concepts in interactive proof systems, refuting the Aldous-Lyons conjecture through subgroup tests and tailored non-local games.
Rhapsody in Zero Knowledge - Proving Without Revealing
Explore zero-knowledge proofs: a cryptographic technique enabling proof verification without revealing sensitive information, balancing security and privacy in modern computing.
Discussion on MIP* = RE
Explore the groundbreaking MIP* = RE theorem with MIT's Anand Natarajan, delving into its implications for quantum computing, complexity theory, and the foundations of mathematics.