Главная
Study mode:
on
You
History
Saved
In progress 0 courses
compleat 0 courses
#Art & Design #Adobe #ChatGPT #GitHub

#Interactive Proof Systems

Showing: 17 courses
Institute for Advanced Study

Subgroup Tests and the Aldous-Lyons Conjecture

0 rewiews
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.
Add to list
1 Lesons
1 hour 14 minutes
On-Demand
Free-Video
Institute for Advanced Study

Subgroup Tests and the Aldous-Lyons Conjecture

0 rewiews
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.
Add to list
1 Lesons
1 hour 13 minutes
On-Demand
Free-Video
Squid: Schools for Quantum Information Development

Classical Verification of Quantum Learning

0 rewiews
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.
Add to list
1 Lesons
28 minutes
On-Demand
Free-Video
TheIACR

Statistical Zaps and New Oblivious Transfer Protocols

0 rewiews
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.
Add to list
19 Lesons
24 minutes
On-Demand
Free-Video
The Cyber Academy

Quantum Cloud Computing - Prof Elham Kashefi

0 rewiews
Explore quantum technology's impact on cloud computing, covering verification, protocols, and secure multi-party computing with Prof Elham Kashefi.
Add to list
14 Lesons
31 minutes
On-Demand
Free-Video
Simons Institute

Fully Linear PCPs and Their Cryptographic Applications

0 rewiews
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.
Add to list
18 Lesons
1 hour 8 minutes
On-Demand
Free-Video
Simons Institute

How to Do Fiat-Shamir in the Standard Model

0 rewiews
Explore interactive protocols, Fiat-Shamir transformation, and delegation in cryptography. Learn about security assumptions, hash functions, and correlation intractability in probabilistic proof systems.
Add to list
15 Lesons
1 hour 10 minutes
On-Demand
Free-Video
Simons Institute

How to Delegate Computations Publicly

0 rewiews
Explore probabilistically checkable and interactive proof systems, focusing on publicly verifiable arguments and non-interactive protocols for delegating computations.
Add to list
11 Lesons
28 minutes
On-Demand
Free-Video
Simons Institute

Transparent SNARKs from DARK Compilers

0 rewiews
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.
Add to list
28 Lesons
48 minutes
On-Demand
Free-Video
Simons Institute

Efficient Zero-Knowledge Proofs: A Modular Approach

0 rewiews
Explore modular techniques for creating efficient zero-knowledge proofs, focusing on probabilistically checkable and interactive proof systems in cryptography.
Add to list
1 Lesons
1 hour 12 minutes
On-Demand
Free-Video
Paul G. Allen School

On Prover-Efficient Public-Coin Emulation of Interactive Proofs

0 rewiews
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.
Add to list
9 Lesons
25 minutes
On-Demand
Free-Video
Ryan O'Donnell

IP = PSPACE - Graduate Complexity Lecture at CMU

0 rewiews
Explore interactive proof systems and their relationship to complexity classes, focusing on the IP = PSPACE theorem and its implications for computational theory.
Add to list
15 Lesons
1 hour 19 minutes
On-Demand
Free-Video
Ryan O'Donnell

More on Constant-Round Interactive Proof Systems - Graduate Complexity Lecture at CMU

0 rewiews
Explore constant-round interactive proof systems in computational complexity theory, covering MA, AM, BPP, and efficient error reduction techniques.
Add to list
27 Lesons
1 hour 21 minutes
On-Demand
Free-Video
IEEE

NEXP is Contained in MIP* - Complexity Theory Breakthrough

0 rewiews
Explore groundbreaking results in computational complexity theory, examining the relationship between NEXP and MIP* with insights from experts Anand Natarajan and John Wright.
Add to list
1 Lesons
22 minutes
On-Demand
Free-Video
Institute for Advanced Study

Subgroup Tests and Tailored Non-local Games - Lecture on Interactive Proof Systems

0 rewiews
Explore advanced concepts in interactive proof systems, refuting the Aldous-Lyons conjecture through subgroup tests and tailored non-local games.
Add to list
1 Lesons
2 hours 2 minutes
On-Demand
Free-Video
Strange Loop Conference

Rhapsody in Zero Knowledge - Proving Without Revealing

0 rewiews
Explore zero-knowledge proofs: a cryptographic technique enabling proof verification without revealing sensitive information, balancing security and privacy in modern computing.
Add to list
11 Lesons
38 minutes
On-Demand
Free-Video
Institute for Advanced Study

Discussion on MIP* = RE

0 rewiews
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.
Add to list
1 Lesons
1 hour 33 minutes
On-Demand
Free-Video