Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
FOCS
2003
IEEE
12 years 1 months ago
List-Decoding Using The XOR Lemma
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
Luca Trevisan
FOCS
2003
IEEE
12 years 1 months ago
Mixing
Dana Randall
FOCS
2003
IEEE
12 years 1 months ago
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
Rafael Pass, Alon Rosen
FOCS
2003
IEEE
12 years 1 months ago
Always Good Turing: Asymptotically Optimal Probability Estimation
While deciphering the Enigma Code during World War II, I.J. Good and A.M. Turing considered the problem of estimating a probability distribution from a sample of data. They derive...
Alon Orlitsky, Narayana P. Santhanam, Junan Zhang
FOCS
2003
IEEE
12 years 1 months ago
On Certain Connectivity Properties of the Internet Topology
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
Milena Mihail, Christos H. Papadimitriou, Amin Sab...
FOCS
2003
IEEE
12 years 1 months ago
Zero-Knowledge Sets
We show how a polynomial-time prover can commit to an arbitrary finite set Ë of strings so that, later on, he can, for any string Ü, reveal with a proof whether Ü ¾ Ë or Ü ...
Silvio Micali, Michael O. Rabin, Joe Kilian
FOCS
2003
IEEE
12 years 1 months ago
General Composition and Universal Composability in Secure Multi-Party Computation
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
Yehuda Lindell
FOCS
2003
IEEE
12 years 1 months ago
Towards a Characterization of Truthful Combinatorial Auctions
This paper analyzes implementable social choice functions (in dominant strategies) over restricted domains of preferences, the leading example being combinatorial auctions. Our wo...
Ron Lavi, Ahuva Mu'alem, Noam Nisan
books