BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Yao's protocol for secure computation - Ben Ellis\, Homerton Colle
 ge
DTSTART:20161102T200000Z
DTEND:20161102T203000Z
UID:TALK68951@talks.cam.ac.uk
CONTACT:Matthew Ireland
DESCRIPTION:In distributed computing a group of participants in a protocol
  wish to compute some function of their inputs. Secure multiparty computat
 ion extends this idea by allowing the participants to compute this functio
 n in the presence of an adversary which controls some subset of them. More
 over the participants in the protocol can compute the function in a privat
 e manner: that is without learning anything other than their output. In pa
 rticular the inputs of all other parties are hidden from them. Yao’s pro
 tocol is a protocol that allows secure two-party computation in the presen
 ce of adversaries who are “honest but curious”\, that is they will fol
 low the protocol but will try to glean as much information as possible fro
 m doing so. In this talk we will formally define what it means for a proto
 col to be secure in the presence of such adversaries and then describe how
  we can construct Yao’s protocol. We will finish by sketching a proof of
  its security.
LOCATION:Wolfson Hall\, Churchill College
END:VEVENT
END:VCALENDAR