Encrypted integer division and secure comparison
type: Item
instance of: scholarly article
title: Encrypted integer division and secure comparison
zbMATH Open document ID: 1351.94069
DOI: 10.1504/IJACT.2014.062738
author: Thijs Veugen
published in: International Journal of Applied Cryptography
publication date: 2015-01-14T00:00:00Z
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.
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6386701
zbMATH Keywords: homomorphic encryption
zbMATH Keywords: integer division
zbMATH Keywords: secure comparison
zbMATH Keywords: secure minimum
zbMATH Keywords: secure maximum
zbMATH Keywords: approximation
zbMATH Keywords: client-server model
zbMATH Keywords: secure multi-party computations
zbMATH Keywords: cryptography
zbMATH Keywords: additive blinding
zbMATH Keywords: security
Wikidata QID: Q123308465
MaRDI profile type: Publication
full work available at URL: ijact.2014.062738
OpenAlex ID: W2157253445
description: scientific article; zbMATH DE number 6386701