Authors:
Ahmad Akmal Aminuddin Mohd Kamal
1
and
Keiichi Iwamura
2
Affiliations:
1
Graduate School of Engineering, Department of Electrical Engineering, Tokyo University of Science, Tokyo, Japan
;
2
Faculty of Engineering, Department of Electrical Engineering, Tokyo University of Science, Tokyo, Japan
Keyword(s):
Secure Multi-Party Computation, MPC, Secure Multiplication, (𝑘, 𝑛) Threshold Secret Sharing, Information Theoretic Secure.
Abstract:
Secure multi-party computation (MPC) allows a set of n servers to jointly compute an arbitrary function of their inputs, without revealing these inputs to each other. A (k,n) threshold secret sharing is a protocol in which a single secret is divided into n shares and the secret can be recovered from a threshold k shares. Typically, multiplication of (k,n) secret sharing will result in increase of polynomial degree from k-1 to 2k-2, thus increasing the number of shares required from k to 2k-1. Since each server typically hold only one share, the number of servers required in MPC will also increase from k to 2k-1. Therefore, a set of n servers can compute multiplication securely if the adversary corrupts at most k-1
e realize MPC of multiplication with the setting of N=k,n≥2k-1. We also show that our proposed method is information theoretic secure against a semi-honest adversary.
(More)