Efficient Multiparty Protocols Using Generalized Parseval's Identity and the Theta Algebra
Authors:
- 1 August 2022
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-17
Abstract
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 FMPC (Fourier Multi-Party Computation). FMPC is a novel multiparty computation protocol of arithmetic circuits based on secret-sharing, capable to compute the addition and multiplication of secrets with no communication. We achieve this task by introducing the first generalization of Parseval's identity for Fourier series applicable to an arbitrary number of inputs and a new algebra referred to as the $\Theta^{[n]}-algebra$ . FMPC operates in a setting where users wish to compute a function over some secret inputs by submitting the computation to a set of nodes, without revealing those inputs. FMPC offloads most of the computational complexity to the end users and includes an online phase that mainly consists of each node locally evaluating specific functions. FMPC paves the way for a new kind of multiparty computation protocol; making it possible to compute the addition and multiplication of secrets stepping away from circuit garbling and the traditional algebra introduced by Donald Beaver in 1991. Our protocol is capable to compute addition and multiplication with no communication and its simplicity provides efficiency and ease of implementation.
Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Chainspace: A Sharded Smart Contracts Platform2018
- MASCOT2016
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ2015
- How to Garble Arithmetic CircuitsSIAM Journal on Computing, 2014
- Constant-Overhead Secure Computation of Boolean Circuits using PreprocessingLecture Notes in Computer Science, 2013
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits2013
- Multiparty Computation from Somewhat Homomorphic Encryption2012
- Semi-homomorphic Encryption and Multiparty Computation2011
- Chebyshev Polynomials2002
- Efficient Multiparty Protocols Using Circuit Randomization2001