| 摘要 |
PROBLEM TO BE SOLVED: To provide a secret calculation technique that is made redundant with a smaller number of servers than before.SOLUTION: Supposing that n is a prescribed integer of 3 or more, k is a prescribed positive integer less than n, and x is an integer of k or more and less than n, a secret calculation system comprises: n secret calculation servers 1 that each store n pieces of distributed data distributed by the (k, n) secret distribution method; and a management server 2 including a determination unit that determines whether each of the n secret calculation servers is in a state of being capable of secret calculation, and a selection unit that selects x secret calculation servers from secret calculation servers which are determined to be in the state of being capable of secret calculation. The selected x secret calculation servers are able to perform secret calculation on the basis of x pieces of distributed data each stored in the selected x secret calculation servers.SELECTED DRAWING: Figure 1 |
