Encrypted integer division and secure comparison

DOI10.1504/IJACT.2014.062738MaRDI QIDQ486141zbMATH OpenOpenAlexWikidataFDO

Authors Thijs Veugen

Publication date 14 January 2015

Published in International Journal of Applied Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijact.2014.062738

zbMATH Keywords

additive blindingapproximationclient-server modelcryptographyhomomorphic encryptioninteger divisionsecure comparisonsecure maximumsecure minimumsecure multi-party computationssecurity

Mathematics Subject Classification ID

Cryptography (94A60)

Review text

Summary: When processing data in the encrypted domain, homomorphic encryption can be used to enable linear operations on encrypted data. Integer division of encrypted data however requires an additional protocol between the client and the server and will be relatively expensive. We present new solutions for dividing encrypted data in the semi-honest model using homomorphic encryption and additive blinding, having low computational and communication complexity. In most of our protocols we assume the divisor is publicly known. The division result is not only computed exactly, but may also be approximated leading to further improved performance. The idea of approximating the result of an integer division is extended to similar results for secure comparison, secure minimum, and secure maximum in the client-server model, yielding new efficient protocols with demonstrated application in biometrics. The exact minimum protocol is shown to outperform existing approaches.

Recommendations

• Homomorphic encryption and secure comparison
• Improved secure integer comparison via homomorphic encryption
• Numerical method for comparison on homomorphically encrypted numbers
• Efficient coding for secure computing with additively-homomorphic encrypted data
• Practical homomorphic encryption over the integers for secure computation in the cloud

Cited in

(9)

• Efficient coding for secure computing with additively-homomorphic encrypted data
• Constant-round client-aided secure comparison protocol
• Oblivious sampling with applications to two-party k-means clustering
• An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks
• Client-aided two-party secure interval test protocol
• Approximating Eigenvectors with Fixed-Point Arithmetic: A Step Towards Secure Spectral Clustering
• Practical and Secure Solutions for Integer Comparison
• Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
• Privacy-preserving anti-money laundering using secure multi-party computation

This page was built for publication: Encrypted integer division and secure comparison

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486141)