- Valerio Cini:: Lattice-Base...
- Edit Event
- Cancel Event
- Preview Reminder
- Send Reminder
- Other events happening in April 2024
Valerio Cini:: Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable
Speaker:
Valerio Cini (NTT Research)
Date: Friday, April 05, 2024
Time: 10:30 AM to 12:00 PM Note: all times are in the Eastern Time Zone
Public: Yes
Location: 32-G882 (Hewlett)
Event Type: Seminar
Room Description:
Host: Vinod Vaikuntanathan and Yael Kalai
Contact: Megan F Farmer, mfarmer@csail.mit.edu
Relevant URL:
Speaker URL: None
Speaker Photo:
Reminders to:
seminars@csail.mit.edu, cis-seminars@csail.mit.edu
Reminder Subject:
TALK: Valerio Cini:: Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable
A succinct non-interactive argument of knowledge (SNARK) allows a prover to produce a short proof that certifies the veracity of a certain NP-statement. In the last decade, a large body of work has studied candidate constructions that are secure against quantum attackers. Unfortunately, no known candidate matches the efficiency and desirable features of (pre-quantum) constructions based on bilinear pairings.
In this work, we make progress on this question. We propose the first lattice-based SNARK that simultaneously satisfies many desirable properties: It (i) is tentatively post-quantum secure, (ii) is publicly-verifiable, (iii) has a logarithmic-time verifier and (iv) has a purely algebraic structure making it amenable to efficient recursive composition. Our construction stems from a general technical toolkit that we develop to translate pairing-based schemes to lattice-based ones. At the heart of our SNARK is a new lattice-based vector commitment (VC) scheme supporting openings to constant-degree multivariate polynomial maps, which is a candidate solution for the open problem of constructing VC schemes with openings to beyond linear functions. However, the security of our constructions is based on a new family of lattice-based computational assumptions which naturally generalises the standard Short Integer Solution (SIS) assumption.
Research Areas:
Impact Areas:
Created by Megan F Farmer at Thursday, March 28, 2024 at 12:12 PM.