Towards the Sign Function Best Approximation for Secure Outsourced Computations and Control

Babenko, Mikhail, Tchernykh, Andrei, Pulido-Gaytan, Bernardo, Avetisyan, Arutyun, Nesmachnow, Sergio, Wang, Xinheng ORCID: 0000-0001-8771-8901 and Granelli, Fabrizio (2022) Towards the Sign Function Best Approximation for Secure Outsourced Computations and Control. MATHEMATICS, 10 (12). p. 2006.

Access the full-text of this item by clicking on the Open Access link.

Official URL: http://dx.doi.org/10.3390/math10122006

Abstract

<jats:p>Homomorphic encryption with the ability to compute over encrypted data without access to the secret key provides benefits for the secure and powerful computation, storage, and communication of resources in the cloud. One of its important applications is fast-growing robot control systems for building lightweight, low-cost, smarter robots with intelligent brains consisting of data centers, knowledge bases, task planners, deep learning, information processing, environment models, communication support, synchronous map construction and positioning, etc. It enables robots to be endowed with secure, powerful capabilities while reducing sizes and costs. Processing encrypted information using homomorphic ciphers uses the sign function polynomial approximation, which is a widely studied research field with many practical results. State-of-the-art works are mainly focused on finding the polynomial of best approximation of the sign function (PBAS) with the improved errors on the union of the intervals [−1,−ϵ]∪[ϵ,1]. However, even though the existence of the single PBAS with the minimum deviation is well known, its construction method on the complete interval [−1,1] is still an open problem. In this paper, we provide the PBAS construction method on the interval [−1,1], using as a norm the area between the sign function and the polynomial and showing that for a polynomial degree n≥1, there is (1) unique PBAS of the odd sign function, (2) no PBAS of the general form sign function if n is odd, and (3) an uncountable set of PBAS, if n is even.</jats:p>

Item Type:	Article
Uncontrolled Keywords:	minimax approximate polynomial, Chebyshev polynomials of the second kind, Bernstein polynomial, sign function
Divisions:	Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science
Depositing User:	Symplectic Admin
Date Deposited:	24 Apr 2023 14:46
Last Modified:	15 Mar 2024 17:12
DOI:	10.3390/math10122006
Open Access URL:	https://doi.org/10.3390/math10122006
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3169936