In this paper we extend the notion of interactive proofs of assertions to Interactive proofs of knowledge in which the prover demonstrates possession of knowledge without revealing any computational information whatsoever.Expand

We present improved approximation algorithms for MAX 2SAT and MAX DICUT, improving upon the guarantees of 0.878 and 0.796 of Goemans and Williamson.Expand

A two par ty protocol in which par ty A uses one of several secret witnesses to an assertion is witness indistinguishable if par ty B cannot tell which witness A is actually using.Expand

Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs, certain constraint satisfaction problems and maximum facility location problems.Expand