Sciweavers

14 search results - page 1 / 3
» Homomorphic Evaluation of the AES Circuit
Sort
View
CRYPTO
2012
Springer
234views Cryptology» more  CRYPTO 2012»
11 years 7 months ago
Homomorphic Evaluation of the AES Circuit
We describe a working implementation of leveled homomorphic encryption (without bootstrapping) that can evaluate the AES-128 circuit in three different ways. One variant takes und...
Craig Gentry, Shai Halevi, Nigel P. Smart
CCS
2010
ACM
13 years 5 months ago
TASTY: tool for automating secure two-party computations
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadegh...
EUROCRYPT
2012
Springer
11 years 7 months ago
Fully Homomorphic Encryption with Polylog Overhead
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
Craig Gentry, Shai Halevi, Nigel P. Smart
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
13 years 11 months ago
Fully homomorphic encryption using ideal lattices
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...
Craig Gentry
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
13 years 6 months ago
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
Craig Gentry, Shai Halevi, Vinod Vaikuntanathan