BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Succinct arguments from hashes and lattices
DTSTART:20230616T150000
DTEND:20230616T170000
DTSTAMP:20260509T100944Z
UID:5d2aebee8b4f94c192a9edb143a47db1656961d546fb398878e1577e
CATEGORIES:Conferences - Seminars
DESCRIPTION:Giacomo Fenzi\nEDIC candidacy exam\nExam president: Prof. Carm
 ela Troncoso\nThesis advisor: Prof. Alessandro Chiesa\nCo-examiner: Prof. 
 Mika Göös\n\nAbstract\nSuccinct non-interactive arguments of knowledge (
 SNARKs) are protocols to construct short proofs of NP-statements. In this 
 talk\, we outline the classical approach towards obtaining a SNARK from pr
 obabilistically checkable proofs (PCPs). First\, we describe the sumcheck 
 protocol\, and construct a PCP for NP from it. Next\, we use lightweight c
 ryptography to obtain an interactive argument using Kilian's techniques. F
 inally\, we describe Micali's approach to obtain non-interactivity in the 
 random oracle model. We conclude by describing a few concluded research pr
 ojects and future directions.\n\nBackground papers\n1. Computationally Sou
 nd Proofs by Silvio Micali (https://people.csail.mit.edu/silvio/Selected%2
 0Scientific%20Papers/Proof%20Systems/Computationally_Sound_Proofs.pdf)\n2.
  A note on efficient zero-knowledge proofs and arguments by Joe Killian (h
 ttps://people.csail.mit.edu/vinodv/6892-Fall2013/efficientargs.pdf)\n3. Al
 gebraic Methods for Interactive Proof Systems by Carsten Lund\, Lance Fort
 now\, Howard Karloff and Noam Nisan (https://dl.acm.org/doi/pdf/10.1145/14
 6585.146605)\n 
LOCATION:BC 04 https://plan.epfl.ch/?room==BC%2004
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR