Secure computation of the mean and related statistics

41Citations
Citations of this article
49Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In recent years there has been massive progress in the development of technologies for storing and processing of data. If statistical analysis could be applied to such data when it is distributed between several organisations, there could be huge benefits. Unfortunately, in many cases, for legal or commercial reasons, this is not possible. The idea of using the theory of multi-party computation to analyse efficient algorithms for privacy preserving data-mining was proposed by Pinkas and Lindell. The point is that algorithms developed in this way can be used to overcome the apparent impasse described above: the owners of data can, in effect, pool their data while ensuring that privacy is maintained. Motivated by this, we describe how to securely compute the mean of an attribute value in a database that is shared between two parties. We also demonstrate that existing solutions in the literature that could be used to do this leak information, therefore underlining the importance of applying rigorous theoretical analysis rather than settling for ad hoc techniques. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Kiltz, E., Leander, G., & Malone-Lee, J. (2005). Secure computation of the mean and related statistics. In Lecture Notes in Computer Science (Vol. 3378, pp. 283–302). Springer Verlag. https://doi.org/10.1007/978-3-540-30576-7_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free