An inconsistency detecting method, wherein n and k are assumed to be integers that satisfy n ≥ 2k-1, m is assumed to be an integer greater than or equal to 1, and i is assumed to be each of integers greater than or equal to 0 but smaller than n, n inconsistency detecting devices p i ·(1 1,..., 1 n) store shares [a 0] i,..., [a m-1] i obtained by dividing m values a 0,..., a m-1 by (k, n)-secret sharing, and the inconsistency detecting method includes: a public random number generating step in which the n inconsistency detecting devices p i (1 1,..., 1 n) generate random numbers s i and make the random numbers s i public; a common random number calculation step in which the n inconsistency detecting devices p i (1 1,..., 1 n) generate a common random number s which is a sum total of the random numbers s 0,..., s n-1; and a random number distributed value generating step in which the n inconsistency detecting devices p i (1 1,..., 1 n) generate shares [r] i, each of which is suitable for becoming a random number r when reconstructed by (k, n)-secret sharing, wherein the random number r is concealed by any of the n inconsistency detecting devices p 0,..., p n-1 (1 1,..., 1 n), a checksum calculation step in which the n inconsistency detecting devices p i (1 1,..., 1 n) calculate shares [c] i = ∑ j<m-1 s j+1 [a j] i +s m+1 [a m-1] i by using the common random number s and the shares [a 0] i,..., [a m-1] i; a judgment value calculation step in which the n inconsistency detecting devices p i (1 1,..., 1 n) calculate shares [d] i = [c-r] i, each of which is suitable for becoming a judgment value d when reconstructed by (k, n)-secret sharing, wherein the judgment value d indicates that there is no inconsistency in the shares [a 0] i,..., [a m-1] i; a judgment value communication step in which one inconsistency detecting device p 0 (1 1) receives n-1 shares [d] 1,..., [d] n-1 from n-1 inconsistency detecting devices p 1,..., p n-1 (1 2,..., 1 n); a judgment value restoration step in which the inconsistency detecting device p 0 (1 1) restores n-k shares [d]' k,..., [d]' n-1 from k shares [d] 0,..., [d] k-1; and an inconsistency judging step in which the inconsistency detecting device p 0 (1 1) judges, for j = k,..., n-1, whether or not the share [d] j and the share [d]' j coincide with each other. a public random number generating step in which the n inconsistency detecting devices p i (1 1,..., 1 n) generate random numbers s i and make the random numbers s i public; a common random number calculation step in which the n inconsistency detecting devices p i (1 1,..., 1 n) generate a common random number s which is a sum total of the random numbers s 0,..., s n-1; and a random number distributed value generating step in which the n inconsistency detecting devices p i (1 1,..., 1 n) generate shares [r] i, each of which is suitable for becoming a random number r when reconstructed by (k, n)-secret sharing, wherein the random number r is concealed by any of the n inconsistency detecting devices p 0,..., p n-1 (1 1,..., 1 n), a checksum calculation step in which the n inconsistency detecting devices p i (1 1,..., 1 n) calculate shares [c] i = ∑ j<m-1 s j+1 [a j] i +s m+1 [a m-1] i by using the common random number s and the shares [a 0] i,..., [a m-1] i; a judgment value calculation step in which the n inconsistency detecting devices p i (1 1,..., 1 n) calculate shares [d] i = [c-r] i, each of which is suitable for becoming a judgment value d when reconstructed by (k, n)-secret sharing, wherein the judgment value d indicates that there is no inconsistency in the shares [a 0] i,..., [a m-1] i; a judgment value communication step in which one inconsistency detecting device p 0 (1 1) receives n-1 shares [d] 1,..., [d] n-1 from n-1 inconsistency detecting devices p 1,..., p n-1 (1 2,..., 1 n); a judgment value restoration step in which the inconsistency detecting device p 0 (1 1) restores n-k shares [d]' k,..., [d]' n-1 from k shares [d] 0,..., [d] k-1; and an inconsistency judging step in which the inconsistency detecting device p 0 (1 1) judges, for j = k,..., n-1, whether or not the share [d] j and the share [d]' j coincide with each other.