Lattice-Based Succinct Arguments for NP

Speaker : Jonathan Bootle Public: Yes Location: G-882 Hewlett Room Event Type: Seminar Host: Vinod Vaikuntanathan , CSAIL MIT Contact: Felicia Raton, fraton@csail.mit.edu Relevant URL: https://eprint.iacr.org/2023/930 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. https://eprint.iacr.org/2023/930 Research Areas: Security & Cryptography zoom link https://mit.zoom.us/j/97973772283