Privacy Preserving Distance Computation using Somewhat-trusted Third Parties
Abelino Jimenez, Bhiksha Raj

TL;DR
This paper introduces a privacy-preserving method for distance computation in multi-party signal processing that uses secure hashing and a somewhat-trusted third party, reducing computational complexity and trust requirements.
Contribution
It proposes a novel approach combining secure hashing with a less-trusted third party, enhancing privacy and efficiency over existing cryptographic solutions.
Findings
The method effectively preserves privacy of individual signals.
Empirical results demonstrate feasible and accurate distance computations.
Theoretical proofs confirm privacy guarantees.
Abstract
A critically important component of most signal processing procedures is that of computing the distance between signals. In multi-party processing applications where these signals belong to different parties, this introduces privacy challenges. The signals may themselves be private, and the parties to the computation may not be willing to expose them. Solutions proposed to the problem in the literature generally invoke homomorphic encryption schemes, secure multi-party computation, or other cryptographic methods which introduce significant computational complexity into the proceedings, often to the point of making more complex computations requiring repeated computations unfeasible. Other solutions invoke third parties, making unrealistic assumptions about their trustworthiness. In this paper we propose an alternate approach, also based on third party computation, but without assuming…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
