Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the concept of batch proofs in cryptography through this 45-minute lecture by Prashant Vadusevan from the National University of Singapore. Delve into the necessary conditions for the existence of batch proofs in statistical and computational soundness settings. Learn about the implications of batch proofs on Statistically Witness Indistinguishable (SWI) proofs and Statistical Zero-Knowledge (SZK) arguments. Discover how non-interactive batch arguments relate to non-interactive statistical zero-knowledge arguments (NISZKA) for NP. Gain insights into the common framework for transforming batch protocols into SWI protocols for single instances. Understand the connections between batch proofs and minimal complexity assumptions in cryptography, based on collaborative research with Nir Bitansky, Chethan Kamath, Omer Paneth, and Ron D. Rothblum.
