Improved protocols for secure multiplication using secret sharing scheme

Herein, we present a secure multiplication method that uses secret sharing to solve the security problems presented by Watanabe et al. We implemented the characteristics of the exponent operation in which 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, thereby resulting in a lower cost of establishing a physical server. In addition, Shannon's entropy function was used to describe the security of the proposed method. Finally, we evaluated our proposed method in terms of computational and communication costs.