DocumentCode
2722428
Title
Computing Blindfolded: New Developments in Fully Homomorphic Encryption
Author
Vaikuntanathan, Vinod
fYear
2011
fDate
22-25 Oct. 2011
Firstpage
5
Lastpage
16
Abstract
A fully homomorphic encryption scheme enables computation of arbitrary functions on encrypted data. Fully homomorphic encryption has long been regarded as cryptography\´s prized "holy grail" - extremely useful yet rather elusive. Starting with the groundbreaking work of Gentry in 2009, the last three years have witnessed numerous constructions of fully homomorphic encryption involving novel mathematical techniques, and a number of exciting applications. We will take the reader through a journey of these developments and provide a glimpse of the exciting research directions that lie ahead.
Keywords
cryptography; mathematical analysis; arbitrary functions; computing blindfolded; data encryption; fully homomorphic encryption; mathematical techniques; Databases; Encryption; Polynomials; Privacy; Public key;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on
Conference_Location
Palm Springs, CA
ISSN
0272-5428
Print_ISBN
978-1-4577-1843-4
Type
conf
DOI
10.1109/FOCS.2011.98
Filename
6108145
Link To Document