Welcome to the resource topic for
**2024/171**

**Title:**

Approximate Methods for the Computation of Step Functions in Homomorphic Encryption

**Authors:**
Tairong Huang, Shihe Ma, Anyu Wang, XiaoYun Wang

**Abstract:**

The computation of step functions over encrypted data is an essential issue in homomorphic encryption due to its fundamental application in privacy-preserving computing. However, an effective method for homomorphically computing general step functions remains elusive in cryptography. This paper proposes two polynomial approximation methods for general step functions to tackle this problem. The first method leverages the fact that any step function can be expressed as a linear combination of shifted sign functions. This connection enables the homomorphic evaluation of any step function using known polynomial approximations of the sign function. The second method boosts computational efficiency by employing a composite polynomial approximation strategy. We present a systematic approach to construct a composite polynomial f_k \circ f_{k-1} \circ \cdots \circ f_1 that increasingly approximates the step function as k increases. This method utilizes an adaptive linear programming approach that we developed to optimize the approximation effect of f_i while maintaining the degree and coefficients bounded. We demonstrate the effectiveness of these two methods by applying them to typical step functions such as the round function and encrypted data bucketing, implemented in the HEAAN homomorphic encryption library. Experimental results validate that our methods can effectively address the homomorphic computation of step functions.

**ePrint:**
https://eprint.iacr.org/2024/171

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

**Example resources include:**
implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .