SIAMCOMP
2011
12 years 11 months ago
2011
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
ECCC
2007
13 years 4 months ago
2007
We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then ¯L ∈ MA. Assuming the polynomial hierarch...
APPROX
2007
Springer
13 years 8 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
CP
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Stochastic Local Search (SLS) is a simple and effective paradigm for attacking a variety of Combinatorial (Optimization) Problems (COP). However, it is often non-trivial...