How should we solve search problems privately?

  • Authors:

  • Amos Beimel;Tal Malkin;Kobbi Nissim;Enav Weinreb

  • Affiliations:

  • Dept. of Computer Science, Ben-Gurion University, Be'er Sheva, Israel;Dept. of Computer Science, Columbia University, New York, NY;Dept. of Computer Science, Ben-Gurion University, Be'er Sheva, Israel;Dept. of Computer Science, Technion, Haifa, Israel

  • Venue:
  • CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case that the parties executing a computation try to solve a search problem, where one input may have a multitude of correct answers - such as when the parties compute a shortest path in a graph or find a solution to a set of linear equations. Picking one output arbitrarily from the solution set has significant implications on the privacy of the algorithm. Beimel et al. [STOC 2006] gave a minimal definition for private computation of search problems with focus on proving impossibility result. In this work we aim for stronger definitions of privacy for search problems that provide reasonable privacy. We give two alternative definitions and discuss their privacy guarantees. We also supply algorithmic machinery for designing such protocols for a broad selection of search problems.