The Knowledge Complexity of Interactive Proof Systems
Completely fair SFE and coalition-safe cheap talk
Local zero knowledge
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC ’06
SIAM Journal on Computing
21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing - PODC ’04
Chris Peikert
Shafi Goldwasser
Vijay V. Vazirani
Charles Rackoff
Rafael Pass
Matt Lepinski
Beyond nash equilibrium
A near-linear time ?-approximation algorithm for geometric bipartite matching
Two prover protocols