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 collusion

more »

... even when all but one party are corrupt. At the same time, the computational complexity and communication complexity of our method are both O(n). Therefore, it can meet the needs of the practical application in terms of both security and efficiency. In addition to the theoretical guarantee, the practical usability of our method is also verified through experiments by constructing Naive Bayes classifiers in a privacy-preserving distributed environment.