Computer Science – Cryptography and Security
Scientific paper
2010-10-04
Proceedings of the 2010 Allerton Conference On Communication, Control, and Computing Monticello, IL. September 2010
Computer Science
Cryptography and Security
7 pages, 1 figure. Appeared in the Proceedings of the 2010 Allerton Conference On Communication, Control, and Computing
Scientific paper
We propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalized sum-type function of those sequences. We construct three-party protocols that allow Charlie to compute the function with arbitrarily high accuracy, while maintaining unconditional privacy for Alice and Bob and achieving vanishing communication cost. This work leverages a striking dimensionality reduction that allows a high accuracy estimate to be produced from only a random subsampling of the sequences. The worst-case distortion of the estimate, across all arbitrary deterministic sequences of any length, is independent of the dimensionality (length) of the sequences and proportional to inverse square root of the number of samples that the estimate is based upon.
Ishwar Prakash
Rane Shantanu
Sun WaiChing
Wang Ye
No associations
LandOfFree
On Unconditionally Secure Computation with Vanishing Communication Cost does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Unconditionally Secure Computation with Vanishing Communication Cost, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Unconditionally Secure Computation with Vanishing Communication Cost will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-275160