BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Homomorphic Encryption from Ring Learning with Errors - Michael Na
 ehrig\, Technische Universiteit Eindhoven
DTSTART:20120110T100000Z
DTEND:20120110T110000Z
UID:TALK35371@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:The prospect of outsourcing an increasing amount of data stora
 ge and management to cloud services raises many new privacy concerns that 
 can be satisfactorily addressed if users encrypt the data they send to the
  cloud. If the encryption scheme is homomorphic\, the cloud can still perf
 orm meaningful computations on the data\, even though it is encrypted.\nIn
  fact\, we now know a number of constructions of fully homomorphic encrypt
 ion schemes that allow arbitrary computation on encrypted data.\nIn the la
 st two years\, solutions for fully homomorphic encryption have been propos
 ed and improved upon\, but all currently available options seem to be too 
 inefficient to be used in practice. However\, for many applications it is 
 sufficient to implement somewhat homomorphic encryption schemes\, which su
 pport a limited number of homomorphic operations. They can be much faster\
 , and more compact than fully homomorphic schemes.\n\nThis talk will focus
  on describing the recent somewhat homomor- phic encryption scheme of Brak
 erski and Vaikuntanathan\, whose security relies on the ring learning with
  errors (RLWE) problem.
LOCATION:Large lecture theatre\, Microsoft Research Ltd\, 7 J J Thomson Av
 enue (Off Madingley Road)\, Cambridge
END:VEVENT
END:VCALENDAR