Secure Numerical and Logical Multi Party Operations
This work addresses efficiency in secure multi-party computation for applications requiring privacy, though it appears incremental as it builds on existing schemes.
The paper tackled the problem of performing secure numerical and logical operations in multi-party computation, achieving speed-ups of over 100 times compared to state-of-the-art methods.
We derive algorithms for efficient secure numerical and logical operations using a recently introduced scheme for secure multi-party computation~\cite{sch15} in the semi-honest model ensuring statistical or perfect security. To derive our algorithms for trigonometric functions, we use basic mathematical laws in combination with properties of the additive encryption scheme in a novel way. For division and logarithm we use a new approach to compute a Taylor series at a fixed point for all numbers. All our logical operations such as comparisons and large fan-in AND gates are perfectly secure. Our empirical evaluation yields speed-ups of more than a factor of 100 for the evaluated operations compared to the state-of-the-art.