BEGIN:VCALENDAR
VERSION:2.0
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
BEGIN:VEVENT
CATEGORIES:Lectures & Talks
DESCRIPTION:Cryptographic Proofs: Succinctness and Zero-Knowledge\n\n \n\nN
on-interactive proof systems allow a prover to convince a verifier that a s
tatement is true in a single message. These systems can achieve two magical
features: succinctness\, meaning the proof can be very short for any compl
icated statement\, and zero-knowledge\, meaning the proof can hide why a st
atement is true. \n\n \n\nNon-interactive proof systems are a fundamental c
oncept that has been studied since the 1980s. They have a fruitful interact
ion with complexity theory. These proof systems also have wide applications
in cryptography and applied security\, including cloud computing security\
, privacy-preserving machine learning\, and blockchain.\n\n \n\nIn this tal
k\, I will present my work on the following fundamental questions for non-i
nteractive proof systems whose answers have remained elusive for decades:\n
\n1. How to achieve succinctness? My work has built the first succinct non-
interactive proof systems for any deterministic computation based on a well
-studied assumption in lattices. All previous works can only provide heuris
tics for security. A major open question in this field is how to build succ
inct non-interactive proof systems for all non-deterministic computation (N
P). Towards this\, my work has built succinct non-interactive proof systems
for some subclasses of NP.\n\n2. What assumptions are sufficient to achiev
e zero-knowledge? Previously\, the Diffie-Hellman assumption was the oldest
assumption in modern cryptography. It was initially used to achieve public
key cryptography\, but how to use Diffie-Hellman assumption to construct N
IZKs has remained open for more than three decades. My work built the first
NIZKs from the sub-exponential hardness of Decisional Diffie-Hellman.\n\n
\n\nMy work has led to a series of works on other important topics in crypt
ography and complexity\, including new program obfuscation schemes\, new pr
ivate information retrieval schemes\, and implications in game theory. \n\n
\n\nBio: Zhengzhong Jin is currently a postdoctoral associate at MIT\, su
pervised by Vinod Vaikuntanathan. His research interests are cryptography a
nd related topics in theoretical computer science\, with a focus on the fou
ndations of cryptographic proof systems. His work has been recognized with
the Best Paper Award at EUROCRYPT 2021.
DTEND:20230403T170000Z
DTSTAMP:20241010T141608Z
DTSTART:20230403T160000Z
GEO:43.126069;-77.629191
LOCATION:Wegmans Hall\, 1400
SEQUENCE:0
SUMMARY:Computer Science Colloquium Series: Zhengzhong Jin
UID:tag:localist.com\,2008:EventInstance_42649488566860
URL:https://events.rochester.edu/event/computer_science_colloquium_series_z
hengzhong_jin
END:VEVENT
END:VCALENDAR