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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.