BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Information flow in probabilistic proofs
DTSTART:20260123T130000
DTEND:20260123T150000
DTSTAMP:20260403T224040Z
UID:40721c4316ba83fdeb681b93bd261f7543cd3b19250ae72af8ca5708
CATEGORIES:Conferences - Seminars
DESCRIPTION:Burcu Yildiz\nEDIC candidacy exam\nExam president: Prof. Thoma
 s Vidick\nThesis advisor: Prof. Alessandro Chiesa\nCo-examiner: Prof. Rüd
 iger Urbanke\n\nAbstract\nProbabilistic proofs enable a verifier to verify
  a statement\, including membership in hard languages\, using minimal reso
 urces\, such as time or space\, and minimal help\, such as interaction wit
 h a prover or query to an oracle. Verifier's ability to make a correct dec
 ision\, in formal terms\, soundness and completeness of the probabilistic 
 proof\, despite the use of minimal resources\, tells us a lot: The minimal
  help provided by prover(s) contains the vital information that can be uti
 lized by the verifier to make the decision of accept or reject. Is this al
 l\, or could the proof contain more information? One way to answer this qu
 estion is to investigate the zero-knowledge property of proofs\, where we 
 require the verifier to learn nothing except the decision. Another way to 
 approach this question is to investigate the unexpected behaviours of para
 llel repetition of proofs. Parallel repetition of proofs has been widely s
 tudied\, and previous work showed that the decay of soundness error might 
 be worse than we intuitively expect. This fact suggests us that there is a
  flow of information other than the ones we expect. In this thesis\, we in
 vestigate these different settings of the information flow in probabilisti
 c proofs.\n\nBackground papers\n\n	A Zero-Knowledge PCP Theorem\, Tom Gur
 \, Jack O'Connor\, Nicholas Spooner\, https://dl.acm.org/doi/pdf/10.1145/
 3717823.3718128\n	Parallel Repetition: Simplifications and the No-Signalin
 g Case\, Thomas Holenstein\, https://arxiv.org/pdf/cs/0607139\n	Coding f
 or Computing\, Alon Orlitsky\, James R. Roche\, https://ieeexplore.ieee.
 org/stamp/stamp.jsp?arnumber=915643&tag=1\n
LOCATION:BC 229 https://plan.epfl.ch/?room==BC%20229
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR