A secure deduplication filter generation system comprising a plurality of secure computation apparatuses connected over a communication network, wherein assuming that F denotes an arbitrary field, m denotes an integer of two or more, [α] denotes a share where α is securely shared supposing α to be an arbitrary vector, {{β}} denotes a share where β is securely shared supposing β to be an arbitrary permutation, and v denotes an m-dimensional vector v e F m, wherein each of the plurality of secure computation apparatuses comprises: a permutation calculation part for generating a share {{σ}} of a permutation σ that stably sorts the vector v in ascending order using a share [v] of the vector v; a permutation application part for generating a share [σ(v)] of a vector σ(v) obtained by applying the permutation σ to the vector v using the share [v] and the share {{σ}}; a vector generation part for generating a share [e] of a vector e having 1 as an element corresponding to a certain element when the certain element of the vector σ(v) and an element before the certain element are different, and having 0 otherwise using the share [σ(v)]; and an inverse permutation application part for generating a share [σ -1 (e)] of a vector σ -1 (e) obtained by applying an inverse permutation σ -1 of the permutation σ to the vector e using the share [e] and the share {{σ}}. assuming that F denotes an arbitrary field, m denotes an integer of two or more, [α] denotes a share where α is securely shared supposing α to be an arbitrary vector, {{β}} denotes a share where β is securely shared supposing β to be an arbitrary permutation, and v denotes an m-dimensional vector v e F m, wherein each of the plurality of secure computation apparatuses comprises: a permutation calculation part for generating a share {{σ}} of a permutation σ that stably sorts the vector v in ascending order using a share [v] of the vector v; a permutation application part for generating a share [σ(v)] of a vector σ(v) obtained by applying the permutation σ to the vector v using the share [v] and the share {{σ}}; a vector generation part for generating a share [e] of a vector e having 1 as an element corresponding to a certain element when the certain element of the vector σ(v) and an element before the certain element are different, and having 0 otherwise using the share [σ(v)]; and an inverse permutation application part for generating a share [σ -1 (e)] of a vector σ -1 (e) obtained by applying an inverse permutation σ -1 of the permutation σ to the vector e using the share [e] and the share {{σ}}. a permutation calculation part for generating a share {{σ}} of a permutation σ that stably sorts the vector v in ascending order using a share [v] of the vector v; a permutation application part for generating a share [σ(v)] of a vector σ(v) obtained by applying the permutation σ to the vector v using the share [v] and the share {{σ}}; a vector generation part for generating a share [e] of a vector e having 1 as an element corresponding to a certain element when the certain element of the vector σ(v) and an element before the certain element are different, and having 0 otherwise using the share [σ(v)]; and an inverse permutation application part for generating a share [σ -1 (e)] of a vector σ -1 (e) obtained by applying an inverse permutation σ -1 of the permutation σ to the vector e using the share [e] and the share {{σ}}.