Multiplication calculation method and device in SPDZ series protocol and storage medium

Abstract

The invention provides a multiplication calculation method and device in an SPDZ series protocol and a storage medium, the method comprises a preprocessing stage and an online calculation stage, the preprocessing stage comprises the steps of generating a plurality of multiplication multi-tuples with different element numbers, and for the multiplication multi-tuples used for d times of multiplication, wherein elements included in the method include d basic elements and L extended elements, d is larger than or equal to 3, and l is equal to 1,..., d-1; wherein the generation process of the multiplication multi-tuple for d times of multiplication comprises the following steps: randomly selecting d random numbers as d basic elements; respectively taking two elements in the d basic elements as input, and totally generating a first-level extension element associated with the respective input element; generating, based on the generated elements as an input, a number of levels I of extension elements associated with respective input elements; the on-line calculation step comprises the following steps: randomly selecting a multi-element group matched with the multiplication times of the current on-line calculation, and locally carrying out multiple multiplication calculation by a participant based on the selected multi-element group.

Description

technical field [0001] The invention relates to the technical field of information security, in particular to a multiplication calculation method, device and storage medium in SPDZ series protocols. Background technique [0002] The general concept of Secure Multi-Party Computation (MPC) is that n participants P 1 , P 2 ,...,P i ,...P n Between, collaboratively calculate a public function f(x 1 , x 2 ,...,x i ,...x n ), where x i is P i private data. This technology has very important applications in the fields of cloud, big data and artificial intelligence. The current research on the MPC protocol shows that its security and performance have met the initial requirements of industrial production. Among them, the SPDZ series protocol is one of the famous MPC protocols for arithmetic circuits, including SPDZ, MASCOT, SPDZ2k, etc. [0003] For the MPC protocol for arithmetic circuits, the f function supported is with respect to x 1 , x 2 ,...,x i ..., x n multiv...

AI Technical Summary

Problems solved by technology

In the SPDZ series protocol, the multiplication operation rule is defined between two private data, which causes the SPDZ series protocol to iteratively call d-1 multiplication calculations when calculating d times of multiplication. At this time, the communication complexity is O(2 d ), the local computational complexity of each party is O(3 d ), which makes it difficult to improve the computational efficiency

Images