Efficient and accurate homomorphic comparisons - Université Paris-Saclay
Proceedings/Recueil Des Communications WAHC'22: Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography Année : 2022

Efficient and accurate homomorphic comparisons

Résumé

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.
Fichier principal
Vignette du fichier
camera-ready_v1.4.pdf (706.42 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

cea-03983178 , version 1 (10-02-2023)

Identifiants

Citer

Olive Chakraborty, Martin Zuber. Efficient and accurate homomorphic comparisons. WAHC'22: Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2022, ACM, pp.35-46, 2022, WAHC'22 - Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 978-1-4503-9877-0. ⟨10.1145/3560827.3563375⟩. ⟨cea-03983178⟩
33 Consultations
413 Téléchargements

Altmetric

Partager

More