Sciweavers

179 search results - page 3 / 36
» Symmetric-Key Homomorphic Encryption for Encrypted Data Proc...
Sort
View
CACM
2010
117views more  CACM 2010»
13 years 7 months ago
Computing arbitrary functions of encrypted data
Suppose that you want to delegate the ability to process your data, without giving away access to it. We show that this separation is possible: we describe a "fully homomorph...
Craig Gentry
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
14 years 2 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
ICIP
2009
IEEE
14 years 8 months ago
Secure Distortion Computation Among Untrusting Parties Using Homomorphic Encryption
Alice and Bob possess sequences xn and yn respectively and would like to compute d(xn , yn ) where d(., .) is a distortion measure. However, Alice and Bob do not trust each other ...
IACR
2011
113views more  IACR 2011»
12 years 7 months ago
Fully Homomorphic SIMD Operations
At PKC 2010 Smart and Vercauteren presented a variant of Gentry’s fully homomorphic public key encryption scheme and mentioned that the scheme could support SIMD style operations...
Nigel P. Smart, Frederik Vercauteren
CRYPTO
2010
Springer
186views Cryptology» more  CRYPTO 2010»
13 years 8 months ago
Additively Homomorphic Encryption with d-Operand Multiplications
The search for encryption schemes that allow to evaluate functions (or circuits) over encrypted data has attracted a lot of attention since the seminal work on this subject by Rive...
Carlos Aguilar Melchor, Philippe Gaborit, Javier H...