Abstract
In this chapter, we discuss how one can improve the efficiency of the BGW protocol in the pre-processing model, where parties are allowed to generate correlated randomness in advance, independent of the circuit-evaluation. We discuss two classes of protocols in the pre-processing model, one based on Beaver’s random multiplication-triples and another based on random double-shared values.
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
Notes
- 1.
There can be various forms of correlated randomness and in this chapter, we discuss two of them.
- 2.
Recall that \(t < n/2\) is the optimal threshold for any t-perfectly-secure protocol for arbitrary functions.
- 3.
Note that the use of a multiplication protocol requires the condition \(t < n/2\) to hold.
- 4.
The term double-share here signifies that each party holds two shares, one corresponding to t-Shamir-sharing of s and another corresponding to 2t-Shamir-sharing of s. We use different fonts, to differentiate between the two types of shares.
- 5.
A formula is a special type of circuit where each gate has fan-out at most 1. They represent computation where the results of subcomputations cannot be used more than once.
- 6.
Recall that to generate a (t, 2t)-double-sharing of a value, the corresponding dealer has to share the same value twice, using t and 2t-degree polynomials.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Choudhury, A., Patra, A. (2022). Perfectly-Secure MPC in the Pre-processing Model. In: Secure Multi-Party Computation Against Passive Adversaries. Synthesis Lectures on Distributed Computing Theory. Springer, Cham. https://doi.org/10.1007/978-3-031-12164-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-031-12164-7_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-12163-0
Online ISBN: 978-3-031-12164-7
eBook Packages: Synthesis Collection of Technology (R0)eBColl Synthesis Collection 11