Accelerating the secure distributed computation of the mean by a chebyshev expansion

Authors:
Peter Lory;Manuel Liedel
Affiliations:
University of Regensburg, Regensburg, Germany;University of Regensburg, Regensburg, Germany
Venue:
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Year:
2012

Citing 7
Cited 0

Oblivious transfer and polynomial evaluation

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient oblivious transfer protocols

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Oblivious Polynomial Evaluation and Oblivious Neural Learning

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Oblivious Polynomial Evaluation

SIAM Journal on Computing
Secure computation of the mean and related statistics

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation

TCC'06 Proceedings of the Third conference on Theory of Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lindell and Pinkas (2002) have proposed the idea of using the techniques of secure multi-party computations to generate efficient algorithms for privacy preserving data-mining. In this context Kiltz, Leander, and Malone-Lee (2005) have presented a protocol for the secure distributed computation of the mean and related statistics in a two-party setting. Their protocol achieves constant round complexity. As a novel suggestion we use a Chebyshev expansion to accelerate this protocol. This approach considerably reduces the overhead of the protocol in terms of both computation and communication. The proposed technique can be applied to other protocols in the field of privacy preserving data-mining as well.