Cryptology ePrint Archive: Report 2019/437

Efficient coding for secure computing with additively-homomorphic encrypted data

Thijs Veugen

Abstract: A framework is introduced for efficiently computing with encrypted data. We assume a semi-honest security model with two computing parties. Two different coding techniques are used with additively homomorphic encryption, such that many values can be put into one large encryption, and additions and multiplications can be performed on all values simultaneously. For more complicated operations such as comparisons and equality tests, bit-wise secret sharing is proposed as an additional technique that has a low computational and communication complexity, and which allows for precomputing. The framework is shown to significantly improve the computational complexity of state-of-the-art solutions on generic operations such as secure comparisons and secure set intersection.

Category / Keywords: cryptographic protocols / packing; batching; homomorphic encryption; secure comparison; secure equality; secure set intersection; vector addition chain

Original Publication (in the same form): International Journal of Applied Cryptography

Date: received 29 Apr 2019

Contact author: thijs veugen at tno nl

Available format(s): PDF | BibTeX Citation

Version: 20190503:121743 (All versions of this report)

Short URL: ia.cr/2019/437