Separating Succinct Non-Interactive Arguments From All Falsifiable Assumptions

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Analyzes the separation of succinct non-interactive arguments from cryptographic assumptions. Theoretical foundations in computational complexity and proof systems.

A 54-minute video from Microsoft Research: “Separating Succinct Non-Interactive Arguments From All Falsifiable Assumptions”.

Video by Microsoft Research, played through YouTube's embedded player.