Searching for authors named "Eyal Kushilevitz" – sorted by Relevance.
-
Privacy and Communication Complexity
- Privacy and Communication Complexity Eyal Kushilevitz y Abstract Each of two parties PX and P
- Cited by 404 (17 self) – Add To MetaCart
-
A Simple Algorithm for Learning
- A Simple Algorithm for Learning O(log n)-Term DNF Eyal Kushilevitz y Department of Computer
- Add To MetaCart
-
Randomness in Private Computations
- RANDOMNESS IN PRIVATE COMPUTATIONS # EYAL KUSHILEVITZ + AND YISHAY MANSOUR # SIAM J. DISCRETE
- Cited by 10 (3 self) – Add To MetaCart
-
A Randomness-Rounds Tradeoff in Private Computation
- A RANDOMNESS-ROUNDS TRADEOFF IN PRIVATE COMPUTATION EYAL KUSHILEVITZ y AND ADI ROS ' EN z
- Cited by 12 (6 self) – Add To MetaCart
-
On the hardness of information-theoretic multiparty computation
- On the Hardness of Information-Theoretic Multiparty Computation ⋆ Yuval Ishai and Eyal Kushilevitz
- Cited by 1 (0 self) – Add To MetaCart
-
Secret Sharing Over Infinite Domains
- Secret Sharing Over Infinite Domains Benny Chor y Eyal Kushilevitz z Department of Computer
- Cited by 6 (2 self) – Add To MetaCart
-
From Differential Cryptanalysis to Ciphertext-Only Attacks
- From Differential Cryptanalysis to Ciphertext-Only Attacks Alex Biryukov 1 and Eyal Kushilevitz 2
- Cited by 2 (1 self) – Add To MetaCart
-
A Communication-Privacy Tradeoff for Modular Addition
- Technion Haifa 32000, Israel Eyal Kushilevitz y Aiken Computation Lab. Harvard University Cambridge, MA
- Cited by 7 (3 self) – Add To MetaCart
-
An \Omega\Gamma D log(N=D)) Lower Bound for Broadcast in Radio Networks
- An \Omega\Gamma D log(N=D)) Lower Bound for Broadcast in Radio Networks Eyal Kushilevitz Yishay
- Cited by 4 (2 self) – Add To MetaCart
-
Learning Boxes in High Dimension
- Learning Boxes in High Dimension Amos Beimel y Eyal Kushilevitz z April 21, 1998 Abstract We
- Cited by 4 (3 self) – Add To MetaCart

