BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1685
DTSTAMP:20260205T113347Z
SUMMARY:Gödel's gift to Cryptography: Zero-Knowledge Proofs without Intera
 ction and with Perfect Soundness
DESCRIPTION:Speaker: Varun Ramanathan (TIFR)\n\nAbstract: \nZero-Knowledge 
 proofs are a staple of cryptography\, discovered in a seminal work of Gold
 wasser\, Micali and Rackoff. They are protocols that allow a prover to con
 vince a verifier that a statement is true\, essentially without revealing 
 any information about why the statement is true. But unlike traditional pr
 oofs\, they require interaction between the prover and verifier\, and ther
 e is always some non-zero probability of the verifier getting convinced of
  an incorrect statement (imperfect soundness). Known impossibility results
  show that these drawbacks are unavoidable. Traditional zero-knowledge pro
 ofs use cryptographic assumptions such as the existence of one-way functio
 ns. In this (hopefully not zero-knowledge) talk\, we will see a glimpse of
  how proof complexity -- using the conjectured absence of optimal proof sy
 stems (along the lines of Gödel's incompleteness theorem) -- helps us ach
 ieve a relaxation of zero-knowledge proofs with no interaction\, no "setup
 " (a milder form of interaction)\, and with perfect soundness.\nLink to th
 e paper: https://eprint.iacr.org/2025/1296.pdf\n
URL:https://www.tcs.tifr.res.in/web/events/1685
DTSTART;TZID=Asia/Kolkata:20260206T160000
DTEND;TZID=Asia/Kolkata:20260206T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR