Hamidi, Amirreza, and Ghodosi, Hossein (2023) Unconditionally Fast Secure Multi-party Computation with Multi-depths Gates Using Pre-computed Information. In: Lecture Notes in Networks and Systems (448) pp. 329-340. From: ICICT 2022: 7th International Congress on Information and Communication Technology, 21-24 February 2022, London, UK.

PDF (Published Version) - Published Version Restricted to Repository staff only

Abstract

In secure multi-party computation (MPC), n participants execute secure communication in a circuit to compute any given function using their private inputs such that the system does not reveal any information about their inputs. Computing a share of n-inputs (n > 2) multiplication gates with various multiplicative depths has been an important subject in this research field as it increases the round complexity using, for example, Beaver’s triples method. That is because just the shares of the multiplication gates with the same depth can be computed each time of implementing the existing MPC protocols, and thus, the communication rounds of a circuit with different multiplicative levels increase. In this paper, we present a secure protocol which enables computing a share of simultaneous n-inputs multiplication gates as well as the addition gate in just one round of online computation phase. Therefore, our protocol enables computing a share of any given function in just one round of computation which would result in fast computation and gives an improvement on the current MPC systems. To achieve it, we employ the technique of (Theory of cryptography conference. Springer, pp 213-230, [2]), based on hyper-invertible matrices, for generating pre-computed shares of random values. Our protocol has the unconditionally security against a coalition of t parties controlled by a passive adversary with the communication complexity O(n2) for computing a share of n inputs multiplication with different depths.

Item ID:	81366
Item Type:	Conference Item (Research - E1)
ISBN:	978-981-19-1610-6
Copyright Information:	© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2023
Date Deposited:	13 Dec 2023 23:16
FoR Codes:	46 INFORMATION AND COMPUTING SCIENCES > 4604 Cybersecurity and privacy > 460401 Cryptography @ 50% 46 INFORMATION AND COMPUTING SCIENCES > 4604 Cybersecurity and privacy > 460403 Data security and protection @ 50%
SEO Codes:	22 INFORMATION AND COMMUNICATION SERVICES > 2201 Communication technologies, systems and services > 220199 Communication technologies, systems and services not elsewhere classified @ 50% 22 INFORMATION AND COMMUNICATION SERVICES > 2204 Information systems, technologies and services > 220408 Information systems @ 50%
Downloads:	Total: 1
	More Statistics