A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
How Should We Solve Search Problems Privately?
2008
Journal of Cryptology
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
doi:10.1007/s00145-008-9032-z
fatcat:cypjrmnx5zcplergc3epeu7yye