Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a groundbreaking cryptographic construction that eliminates the need for additional algebraic assumptions in building adaptively-sound succinct non-interactive arguments for NP. Learn how this 53-minute conference talk presents a novel approach using only sub-exponentially-secure indistinguishability obfuscation and one-way functions, advancing beyond previous work by Waters and Wu (STOC 2024) and Waters and Zhandry (CRYPTO 2024) that required additional assumptions like discrete logarithm, factoring, or learning with errors. Discover the technical innovations that enable this "pure" indistinguishability obfuscation approach to construct SNARGs in the Common Reference String model, representing a significant simplification in the cryptographic assumptions needed for these important proof systems. Gain insights into the theoretical foundations and practical implications of this advancement in zero-knowledge proofs and succinct arguments, delivered by a leading researcher from UT Austin and NTT Research at the Simons Institute.
