Cryptology ePrint Archive: Report 2015/1195


Gizem S. Cetin and Yarkin Doroz and Berk Sunar and William J. Martin

Abstract: Homomorphic encryption has progressed rapidly in both efficiency and versatility since its emergence in 2009. Meanwhile, a multitude of pressing privacy needs --- ranging from cloud computing to healthcare management to the handling of shared databases such as those containing genomics data --- call for immediate solutions that apply fully homomorpic encryption (FHE) and somewhat homomorphic encryption (SHE) technologies. Further progress towards these ends requires new ideas for the efficient implementation of algebraic operations on word-based (as opposed to bit-wise) encrypted data. Whereas handling data encrypted at the bit level leads to % leaves us with prohibitively slow algorithms for the arithmetic operations that are essential for cloud computing, the word-based approach hits its bottleneck when operations such as integer comparison are needed. In this work, we tackle this challenging problem, proposing solutions to problems --- including comparison and division --- in word-based encryption via a leveled FHE scheme. We present concrete performance figures for all proposed primitives.

Category / Keywords: Fully homomorphic encryption, word-size comparison, homomorphic division.

Date: received 14 Dec 2015, last revised 18 Mar 2016

Contact author: gscetin at wpi edu

Available format(s): PDF | BibTeX Citation

Version: 20160318:204013 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]