YoVDO

Batch Arguments for NP and SNARGs for P from LWE

Offered By: Simons Institute via YouTube

Tags

Lattice-Based Cryptography Courses Cryptography Courses Quantum Computing Courses

Course Description

Overview

Explore cutting-edge cryptographic concepts in this lecture from the Quantum and Lattices Joint Reunion Workshop, focusing on Batch Arguments for NP and Succinct Non-interactive Arguments (SNARGs) for P derived from the Learning With Errors (LWE) problem. Delve into the intricate world of cryptography as Abhishek Jain from Johns Hopkins University presents groundbreaking research on these advanced topics, offering insights into their applications and implications for secure computation and verification systems.

Syllabus

Batch Arguments for NP and SNARGs for P from LWE


Taught by

Simons Institute

Related Courses

Applied Cryptography
University of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera