2011 IEEE 52nd Annual Symposium on Foundations of Computer Science 2011
DOI: 10.1109/focs.2011.98
|View full text |Cite
|
Sign up to set email alerts
|

Computing Blindfolded: New Developments in Fully Homomorphic Encryption

Abstract: 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
60
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 92 publications
(60 citation statements)
references
References 49 publications
0
60
0
Order By: Relevance
“…As we saw before, a key property of FHE is the compactness of the ciphertext [7,8,14,6]. We recall that a ciphertext c f is compact if its size, after homomorphic evaluation, does not depend on the number of inputs t and it is also independent of the circuit C. This means that we want that the ciphertext c f has the same size of the output c of Encrypt.…”
Section: Encrypt Vs Evaluatementioning
confidence: 99%
“…As we saw before, a key property of FHE is the compactness of the ciphertext [7,8,14,6]. We recall that a ciphertext c f is compact if its size, after homomorphic evaluation, does not depend on the number of inputs t and it is also independent of the circuit C. This means that we want that the ciphertext c f has the same size of the output c of Encrypt.…”
Section: Encrypt Vs Evaluatementioning
confidence: 99%
“…Here, squashing means transforming SWHE scheme into one with same homomorphic capacity but with simpler Decrypt function [14]. The cost of the squashing method is that the key grows larger and more complicated.…”
Section: International Journal Of Computer Applications (0975 -8887) mentioning
confidence: 99%
“…The encryption algorithm E () is homomorphic if given E(x) and E(y), one can obtain E (x□y) without decrypting x; y for some operation □ (+, ×...) [10].…”
Section: Definition Of Homomorphic Encryptionmentioning
confidence: 99%