Efficient Multiparty Protocols Using Generalized Parseval's Identity and the Theta Algebra. (arXiv:2208.09852v2 [cs.CR] UPDATED)

We propose a protocol able to show publicly addition and multiplication on
secretly shared values. To this aim we developed a protocol based on the use of
masks and on the FMPC (Fourier Multi-Party Computation). FMPC is a novel
multiparty computation protocol of arithmetic circuits based on secret-sharing,
capable to compute addition and multiplication of secrets with no
communication. We achieve this task by introducing the first generalisation of
Parseval's identity for Fourier series applicable to an arbitrary number of …

algebra identity protocols