Fast Secure Computations on Shared Polynomials and Applications to Private Set Operations

ePrint Report: Fast Secure Computations on Shared Polynomials and Applications to Private Set Operations

Pascal Giorgi, Fabien Laguillaumie, Lucas Ottow, Damien Vergnaud

Secure multi-party computation aims to allow a set of players to compute a given function on their secret inputs without revealing any other information than the result of the computation. In this work, we focus on the design of secure multi-party protocols for shared polynomial operations. We consider the classical model where the adversary is honest-but-curious, and where …

applications computation compute eprint report fast function information inputs operations party pascal players private report secret