Lattice-Based Succinct Arguments for NP

Speaker: Jonathan Bootle

Date: Friday, July 21, 2023

Time: 10:30 AM to 12:30 PM Note: all times are in the Eastern Time Zone

Public: Yes

Location: G-882 Hewlett Room

Event Type: Seminar

Room Description:

Host: Vinod Vaikuntanathan , CSAIL MIT

Contact: Felicia Raton,

Relevant URL:

Speaker URL: None

Speaker Photo:

Reminders to:

Reminder Subject: TALK: Lattice-Based Succinct Arguments for NP

Succinct arguments enable an untrusted prover to convince a skeptical verifier that a given computation was correctly executed, while incurring communication complexity and verification time much smaller than the computation size.

Most constructions of succinct arguments are either quantum insecure, or rely on generic cryptographic primitives such as Merkle trees and suffer larger communication complexity as a result.

In this talk, I will explain how to construct quantum-safe succinct arguments for NP from homomorphic, lattice-based commitments, using delegation protocols and module-theoretic abstractions that generalise existing pre-quantum techniques.

Joint work with Alessandro Chiesa and Katerina Sotiraki.

zoom link

Research Areas:
Security & Cryptography

Impact Areas:

This event is not part of a series.

Created by Felicia Raton Email at Wednesday, July 12, 2023 at 8:36 AM.