pith. sign in

arxiv: 1511.03829 · v3 · pith:YL2P2WFInew · submitted 2015-11-12 · 💻 cs.CR

Secure Numerical and Logical Multi Party Operations

classification 💻 cs.CR
keywords operationssecurelogicalalgorithmsderivenumericalschemeadditive
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.