Sciweavers

Share
SIAMCOMP
2011
8 years 6 months ago
Black-Box Constructions of Protocols for Secure Computation
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...
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yeh...
ECCC
2007
91views more  ECCC 2007»
8 years 11 months ago
Which Languages Have 4-Round Zero-Knowledge Proofs?
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...
Jonathan Katz
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
9 years 3 months ago
Lower Bounds for Swapping Arthur and Merlin
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 )...
Scott Diehl
CP
2007
Springer
9 years 5 months ago
An Integrated White+Black Box Approach for Designing and Tuning Stochastic Local Search
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...
Steven Halim, Roland H. C. Yap, Hoong Chuin Lau
books