Pages that link to "Item:Q486141"
From MaRDI portal
The following pages link to Encrypted integer division and secure comparison (Q486141):
Displaying 8 items.
- Efficient coding for secure computing with additively-homomorphic encrypted data (Q2019835) (← links)
- Constant-round client-aided secure comparison protocol (Q2167759) (← links)
- Oblivious sampling with applications to two-party \(k\)-means clustering (Q2188971) (← links)
- An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks (Q2229283) (← links)
- Client-Aided Two-Party Secure Interval Test Protocol (Q3297629) (← links)
- Approximating Eigenvectors with Fixed-Point Arithmetic: A Step Towards Secure Spectral Clustering (Q3379536) (← links)
- Practical and Secure Solutions for Integer Comparison (Q5756542) (← links)
- Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data (Q6554885) (← links)