Paper 2019/437

Efficient coding for secure computing with additively-homomorphic encrypted data

Thijs Veugen


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.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. International Journal of Applied Cryptography
packingbatchinghomomorphic encryptionsecure comparisonsecure equalitysecure set intersectionvector addition chain
Contact author(s)
thijs veugen @ tno nl
2019-05-03: received
Short URL
Creative Commons Attribution


      author = {Thijs Veugen},
      title = {Efficient coding for secure computing with additively-homomorphic encrypted data},
      howpublished = {Cryptology ePrint Archive, Paper 2019/437},
      year = {2019},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.