Efficient and Accurate Homomorphic Comparisons

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We design and implement a new efficient and accurate fully homomorphic argmin/min or argmax/max comparison operator, which finds its application in numerous real-world use cases as a classifier. In particular we propose two versions of our algorithms using different tools from TFHE's functional bootstrapping toolkit. Our algorithm scales to any number of input data points with linear time complexity and logarithmic noise-propagation. Our algorithm is the fastest on the market for non-parallel comparisons with a high degree of accuracy and precision. For MNIST and SVHN datasets, which work under the PATE framework, using our algorithm, we achieve an accuracy of around 99.95% for both.

Cite

CITATION STYLE

APA

Chakraborty, O., & Zuber, M. (2022). Efficient and Accurate Homomorphic Comparisons. In WAHC 2022 - Proceedings of the 10th Workshop on Encrypted Computing and Applied Homomorphic Cryptography, co-located with CCS 2022 (pp. 35–46). Association for Computing Machinery, Inc. https://doi.org/10.1145/3560827.3563375

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free