Minimax Approximation of Sign Function by Composite Polynomial for Homomorphic Comparison

The comparison operation for two numbers is one of the most frequently used operations in several applications, including deep learning. As such, lots of research has been conducted with the goal of efficiently evaluating the comparison operation in homomorphic encryption schemes. Recently, Cheon et...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on dependable and secure computing Jg. 19; H. 6; S. 3711 - 3727
Hauptverfasser:	Lee, Eunsang, Lee, Joon-Woo, No, Jong-Seon, Kim, Young-Sik
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Washington IEEE 01.11.2022 IEEE Computer Society
Schlagworte:	Algorithms Approximation Approximation algorithms Asymptotic methods Cheon–Kim–Kim–Song (CKKS) scheme Composition Consumption Cybersecurity Deep learning Dynamic programming Encryption fully homomorphic encryption Heuristic algorithms homomorphic comparison operation Machine learning Mathematical analysis minimax approximation polynomial Minimax technique Numerical analysis Polynomials Remez algorithm Run time (computers) Runtime sign function Sorting Upper bound
ISSN:	1545-5971, 1941-0018
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!