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

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

Mathematics Subject Classification ID

Cryptography (94A60)

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

(8)

• Oblivious sampling with applications to two-party \(k\)-means clustering
• Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
• Client-aided two-party secure interval test protocol
• Practical and Secure Solutions for Integer Comparison
• 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
• Approximating Eigenvectors with Fixed-Point Arithmetic: A Step Towards Secure Spectral Clustering
• Constant-round client-aided secure comparison 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)