A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
Computing the ratio of secure summations (RSS) is one of the most important tools for privacy preserving distributed data mining. It refers to such a problem; given the n parties and their respective secret values (x i ,y i ), where i = 1, . . . , n, how can they get the value x i and n i=1 y i ? In this paper, we propose a new method to solve this problem. Compared with the existing methods, our method is not only secure under the assumption of semi-honest but also can resist collusiondoi:10.1109/access.2019.2894682 fatcat:a4pi5midafblnd2yrdfmsfvbxu