Encrypted integer division and secure comparison
DOI10.1504/IJACT.2014.062738zbMATH Open1351.94069OpenAlexW2157253445WikidataQ123308465 ScholiaQ123308465MaRDI QIDQ486141FDOQ486141
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
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
approximationcryptographysecurityhomomorphic encryptionsecure comparisonadditive blindingclient-server modelinteger divisionsecure maximumsecure minimumsecure multi-party computations
Cited In (8)
- Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
- 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
- Efficient coding for secure computing with additively-homomorphic encrypted data
- Constant-round client-aided secure comparison protocol
- Practical and Secure Solutions for Integer Comparison
- Approximating Eigenvectors with Fixed-Point Arithmetic: A Step Towards Secure Spectral Clustering
- Client-aided two-party secure interval test protocol
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)
