Oded Goldreich

Learn More
We present a polynomial-time algorithm that, given as a input the description of a game with <italic>incomplete information and any number of players</italic>, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest. Our algorithm automatically solves all the multi-party protocol problems(More)
In this paper, we consider the question of determining whether a function <italic>f</italic> has property P or is &#949;-far from any function with property P. A <italic>property testing</italic> algorithm is given a sample of the value of <italic>f</italic> on instances drawn according to some distribution. In some cases, it is also allowed to query(More)