Private Computation of Polynomials over Networks. (arXiv:2104.01369v3 [cs.CR] UPDATED)

This study concentrates on preserving privacy in a network of agents where
each agent seeks to evaluate a general polynomial function over the private
values of her immediate neighbors. We provide an algorithm for the exact
evaluation of such functions while preserving privacy of the involved agents.
The solution is based on a reformulation of polynomials and adoption of two
cryptographic primitives: Paillier as a Partially Homomorphic Encryption scheme
and multiplicative-additive secret sharing. The provided algorithm is fully
distributed, lightweight …

computation networks