Sciweavers

28 search results - page 6 / 6
» coco 2007
Sort
View
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
14 years 5 days ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
14 years 5 days ago
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
Emanuele Viola, Avi Wigderson
COCO
2007
Springer
108views Algorithms» more  COCO 2007»
14 years 5 days ago
The Communication Complexity of Correlation
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
Prahladh Harsha, Rahul Jain, David A. McAllester, ...