Advertisement
Published in:
2015 | OriginalPaper | Chapter
Secrecy Multiplication Based on a (k, n)-Threshold Secret-Sharing Scheme Using Only k Servers
Authors : Taihei Watanabe, Keiichi Iwamura, Kitahiro Kaneda
Published in: Computer Science and its Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In Shamir’s (k, n)-threshold secret-sharing scheme, a secret is divided into
n
shares, and the secret is recovered from
k
shares. When this scheme is applied to a server system, the
n
shares are distributed to
n
servers. Therefore, the secret can be restored by collecting the shares from
k
servers. In the case of two secrets, the latter are distributed over
n
servers such that each server consists of one share of each secret. Secrecy addition is performed by the addition of the two shares on each server. The combined secret can be restored through the added shares from
k
servers. Therefore, secrecy addition is realized by using
k
servers. However, secrecy multiplication requires a multiplication result from 2k-1 servers. In this paper, we propose a secrecy multiplication based on Shamir’s (k, n)-threshold secret-sharing scheme that uses only
k
servers. Through this scheme, the system can realize secrecy calculation without altering the threshold level.