Improved protocols for secure multiplication using secret sharing scheme

Abstract

Herein, we present a secure multiplication method that uses secret sharing to solve the security problem presented by Watanabe et al. We implement the characteristics of the exponent operation, where the product of two numbers with the same base (in this case, the primitive element ) involves only the addition of their exponents. In contrast to typical secret sharing schemes, our proposed model requires two shares to be sent to each server simultaneously to achieve multiplication without increasing the number of servers required, thus resulting in a lower cost of establishing a physical server. In addition, we use Shannon’s entropy function to describe the security of the proposed method. Finally, we evaluate our proposed method in terms of computational and communication costs.