Encrypted integer division and secure comparison

DOI10.1504/IJACT.2014.062738zbMath1351.94069OpenAlexW2157253445WikidataQ123308465 ScholiaQ123308465MaRDI QIDQ486141

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

approximationcryptographysecurityhomomorphic encryptionsecure comparisonadditive blindingclient-server modelinteger divisionsecure maximumsecure minimumsecure multi-party computations

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Constant-round client-aided secure comparison protocol ⋮ Oblivious sampling with applications to two-party \(k\)-means clustering ⋮ Client-Aided Two-Party Secure Interval Test Protocol ⋮ An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks ⋮ Approximating Eigenvectors with Fixed-Point Arithmetic: A Step Towards Secure Spectral Clustering

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