How should we solve search problems privately?

Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations


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.

Original languageEnglish
Title of host publicationAdvances in Cryptology - CRYPTO 2007 - 27th Annual International Cryptology Conference, Proceedings
PublisherSpringer Verlag
Number of pages19
ISBN (Print)9783540741428
StatePublished - 1 Jan 2007
Event27th Annual International Cryptology Conference, CRYPTO 2007 - Santa Barbara, CA, United States
Duration: 19 Aug 200723 Aug 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4622 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference27th Annual International Cryptology Conference, CRYPTO 2007
Country/TerritoryUnited States
CitySanta Barbara, CA


Dive into the research topics of 'How should we solve search problems privately?'. Together they form a unique fingerprint.

Cite this