Sciweavers

146 search results - page 1 / 30
» Homomorphic encryption from codes
Sort
View
IACR
2011
132views more  IACR 2011»
12 years 4 months ago
Homomorphic encryption from codes
We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous latticeba...
Andrej Bogdanov, Chin Ho Lee
IACR
2011
125views more  IACR 2011»
12 years 4 months ago
On Constructing Homomorphic Encryption Schemes from Coding Theory
Abstract. Homomorphic encryption schemes are powerful cryptographic primitives that allow for a variety of applications. Consequently, a variety of proposals have been made in the ...
Frederik Armknecht, Daniel Augot, Ludovic Perret, ...
CRYPTO
2008
Springer
132views Cryptology» more  CRYPTO 2008»
13 years 6 months ago
Public-Key Locally-Decodable Codes
In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Code (PKLDC). In particular, we allow any polynomialtime ...
Brett Hemenway, Rafail Ostrovsky
PKC
2010
Springer
193views Cryptology» more  PKC 2010»
13 years 8 months ago
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
We present a fully homomorphic encryption scheme which has both relatively small key and ciphertext size. Our construction follows that of Gentry by producing a fully homomorphic s...
Nigel P. Smart, Frederik Vercauteren
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
13 years 5 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