Mpc 2 tripletts
is a secret-sharing of the plain-text value x.
If using full-threshold secret sharing scheme, it is secure up to n-1 corruptions.Note that for multiplication it is required that t < n/2. If using Shamir secret sharing, then is secure up to t corruptions.Security inherited from secret-sharing scheme used.Secure multi-party computation of arithmetic circuits over a field.However, as we will see, multiplication of two secrets still requires interaction. The idea is to use the additive homomorphism property of the LSSS, such that additions and multiplication-by-constant are non-interactive operations. The protocol relies on secret sharing, originally for Shamir secret sharing, but the presented techniques can be applied to any linear secret-sharing scheme (LSSS). The protocol allows us to securely compute addition-, multiplication-by-constant, and multiplication-gates over a field. The BGW (Ben-Or, Goldwasser, Widgerson) protocol has historical importance as one of the first secure multi-party protocols from 1988. The content of this post is mostly based on. These are my personal study notes, so please refer to the references to verify any information in this post.