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(n^2)\) for computing a share of n-inputs multiplication with different depths.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Beaver D (1991) Efficient multiparty protocols using circuit randomization. In: Annual international cryptology conference. Springer, pp 420–432
Beerliová-TrubÃniová Z, Hirt M (2008) Perfectly-secure MPC with linear communication complexity. In: Theory of cryptography conference. Springer, pp 213–230
Ben-Or M, Goldwasser S, Wigderson A (2019) Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Providing sound foundations for cryptography: on the work of Shafi Goldwasser and Silvio Micali, pp 351–371
Benaloh JC (1986) Secret sharing homomorphisms: Keeping shares of a secret secret. In: Conference on the theory and application of cryptographic techniques. Springer, pp 251–260
Bendlin R, Damgård I, Orlandi C, Zakarias S (2011) Semi-homomorphic encryption and multiparty computation. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, pp 169–188
Chaum D, Crépeau C, Damgard I (1988) Multiparty unconditionally secure protocols. In: Proceedings of the twentieth annual ACM symposium on theory of computing, pp 11–19
Cianciullo L, Ghodosi H (2018) Efficient information theoretic multi-party computation from oblivious linear evaluation. In: IFIP international conference on information security theory and practice. Springer, pp 78–90
Damgård I, Pastro V, Smart N, Zakarias S (2012) Multiparty computation from somewhat homomorphic encryption. In: Annual cryptology conference. Springer, pp 643–662
Gennaro R, Rabin MO, Rabin T (1998) Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, pp 101–111
Ghodosi H, Pieprzyk J (2009) Multi-party computation with omnipresent adversary. In: International workshop on public key cryptography. Springer, pp 180–195
Goldreich O (1998) Secure multi-party computation. Manuscript. Preliminary version 78
Goldwasser S (1997) Multi party computations: past and present. In: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, pp 1–6
Hirt M, Maurer U, Przydatek B (2000) Efficient secure multi-party computation. In: International conference on the theory and application of cryptology and information security. Springer, pp 143–161
Micali S, Goldreich O, Wigderson A (1987) How to play any mental game. In: Proceedings of the nineteenth ACM symposium on theory of computing, STOC. ACM, pp 218–229
Rabin T, Ben-Or M (1989) Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the twenty-first annual ACM symposium on theory of computing, pp 73–85
Shamir A (1979) Commun ACM. How to share a secret 22(11):612–613
Smart NP, Tanguy T (2019) Taas: Commodity MPC via triples-as-a-service. In: Proceedings of the 2019 ACM SIGSAC conference on cloud computing security workshop, pp 105–116
Yao AC (1982) Protocols for secure computations. In: 23rd annual symposium on foundations of computer science (SFCS 1982). IEEE, pp 160–164
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Hamidi, A., Ghodosi, H. (2023). Unconditionally Fast Secure Multi-party Computation with Multi-depths Gates Using Pre-computed Information. In: Yang, XS., Sherratt, S., Dey, N., Joshi, A. (eds) Proceedings of Seventh International Congress on Information and Communication Technology. Lecture Notes in Networks and Systems, vol 448. Springer, Singapore. https://doi.org/10.1007/978-981-19-1610-6_28
Download citation
DOI: https://doi.org/10.1007/978-981-19-1610-6_28
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-1609-0
Online ISBN: 978-981-19-1610-6
eBook Packages: EngineeringEngineering (R0)