Cryptology ePrint Archive: Report 2008/378
Additively Homomorphic Encryption with d-Operand Multiplications
Carlos Aguilar Melchor, Philippe Gaborit, and Javier Herranz
Abstract: 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 Rivest, Adleman and Dertouzos in 1978.
In this work we define a theoretical object, chained encryption schemes, which allow an efficient evaluation of polynomials of degree d over encrypted data. Chained encryption schemes are generically constructed by concatenating cryptosystems with the appropriate homomorphic properties; such schemes are common in lattice-based cryptography. As a particular instantiation we propose a chained encryption scheme whose IND-CPA security is based on a worst-case/average-case reduction from uSVP.
Category / Keywords: homomorphic encryption, secure function evaluation, latttices
Date: received 5 Sep 2008, last revised 14 Aug 2010
Contact author: carlos aguilar at unilim fr
Available formats: PDF | BibTeX Citation
Note: Added overview, applications, and cost evaluation.
Version: 20100815:053435 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]