Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
Secrecy Multiplication Based on a (k, n)-Threshold Secret-Sharing Scheme Using Only k Servers
verfasst von : Taihei Watanabe, Keiichi Iwamura, Kitahiro Kaneda
Erschienen in: Computer Science and its Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.