Secret Sharing Schemes and Secure Multi-party Computation
Mulan Liu
Abstract
Mulan Liu
Abstract
In the paper, through a complete description of secret sharing schemes, we give definitions respectively for perfect secret sharing schemes, statistical secret sharing schemes and computational secret sharing schemes in an uniform way. Furthermore, we analyze why and how multiplicative linear secret sharing schemes are used in secure multi-party computation protocols, and explain the security of secure multi-party computation in detail.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In the paper, through a complete description of secret sharing schemes, we give definitions respectively for perfect secret sharing schemes, statistical secret sharing schemes and computational secret sharing schemes in an uniform way. Furthermore, we analyze why and how multiplicative linear secret sharing schemes are used in secure multi-party computation protocols, and explain the security of secure multi-party computation in detail.
Key concepts: Secure multi-party computation, Secret sharing, Computer science, Computation, Homomorphic secret sharing, Secure two-party computation, Multiplicative function, Verifiable secret sharing