BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260912T030626Z
UID:Seminar-verification-659@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Patrick Totzke:MAILTO:totzke@liverpool.ac.uk
DTSTART:20180111T140000
DTEND:20180111T150000
SUMMARY:Verification Series
DESCRIPTION:Alexei Listsa: Verifying Computations without Reexecuting Them\n\nI will introduce and overview the area of *verifiable computing* which  addresses the verification of\nthe  results of computations after they have been done, perhaps by something/somebody we don't fully trust (e.g. remote, and/or corrupted servers).\nFor general introduction I will follow largely  to [1] , while a bit more technical details will be given for a particular system Pinocchio [2].\n\nReferences\n---------------,\n\n1.)  Verifying Computations without Reexecuting Them, By Michael Walfish, Andrew J. Blumberg\nCommunications of the ACM, Vol. 58 No. 2, Pages 74-84 10.1145/2641562\nhttps://cacm.acm.org/magazines/2015/2/182636-verifying-computations-without-reexecuting-them/fulltext\n\n2.)  Pinocchio: Nearly Practical Verifiable Computation, By Bryan Parno, Jon Howell, Craig Gentry, Mariana Raykova\nCommunications of the ACM, Vol. 59 No. 2, Pages 103-112 10.1145/2856449\nhttps://cacm.acm.org/magazines/2016/2/197429-pinocchio/fulltext\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=659
LOCATION:
END:VEVENT
END:VCALENDAR