BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Colloquium: Probabilistic proofs: theory\, hardware\, and every
 thing in between
DTSTART:20210315T140000
DTEND:20210315T150000
DTSTAMP:20260407T163618Z
UID:ffe88103d0c94fc494d1dd6d5bdc4c529e92881d7fcd45953ace2918
CATEGORIES:Conferences - Seminars
DESCRIPTION:By: Riad Wahby - Stanford University\nIC Faculty candidate\n\n
 Abstract\nIn the past decade\, systems that use probabilistic proofs in re
 al-world applications have seen explosive growth. These systems build upon
  some of the crown jewels of theoretical computer science---interactive pr
 oofs\, probabilistically checkable proofs\, and zero-knowledge proofs---to
  solve problems of trust and privacy in a wide range of settings.\n\nThis 
 talk describes my work building systems that answer questions ranging from
  "how can we build trustworthy hardware that uses untrusted components?"\n
 to "how can we reduce the cost of verifying smart contract execution in bl
 ockchains?" Along the way\, I will discuss the pervasive challenges of eff
 iciency\, expressiveness\, and scalability in this research area\; my appr
 oach to addressing these challenges\; and future directions that promise t
 o bring this exciting technology to bear on an even wider range of applica
 tions.\n\nBio\nRiad S. Wahby is a Ph.D. candidate at Stanford\, advised by
  Dan Boneh and Keith Winstein. His research interests include systems\, co
 mputer security\, and applied cryptography. Prior to attending Stanford\, 
 Riad spent ten years as an analog and mixed-signal integrated circuit desi
 gner. Riad and his collaborators received a 2016 IEEE Security and Privacy
  Distinguished Student Paper award\; his work on hashing to elliptic curve
 s is being standardized by the IETF.\n\nMore information\n 
LOCATION:https://epfl.zoom.us/j/81875523152?pwd=dWVUTUxtNFJRT1pxK2lpaHNkTD
 c0UT09
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR