The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Eyal Kushilevitz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz
    PAC Learning with Nasty Noise. [Citation Graph (0, 0)][DBLP]
    ATL, 1999, pp:206-218 [Conf]
  2. Shirley Halevy, Eyal Kushilevitz
    A Lower Bound for Distribution-Free Monotonicity Testing. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:330-341 [Conf]
  3. Shirley Halevy, Eyal Kushilevitz
    Distribution-Free Connectivity Testing. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:393-404 [Conf]
  4. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
    On Pseudorandom Generators with Linear Stretch in NC0. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:260-271 [Conf]
  5. Shai Ben-David, Mauricio Karchmer, Eyal Kushilevitz
    On Ultrafilters and NP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:97-105 [Conf]
  6. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
    Computationally Private Randomizing Polynomials and Their Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:260-274 [Conf]
  7. Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz
    Privacy, Additional Information, and Communication. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:55-65 [Conf]
  8. Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan
    Fractional Covers and Communication Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:262-274 [Conf]
  9. Amos Beimel, Felix Geller, Eyal Kushilevitz
    The Query Complexity of Finding Local Minima in the Lattice. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:294-302 [Conf]
  10. Shai Ben-David, Nadav Eiron, Eyal Kushilevitz
    On Self-Directed Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:136-143 [Conf]
  11. Shai Ben-David, Alon Itai, Eyal Kushilevitz
    Learning by Distances. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:232-245 [Conf]
  12. Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth
    On Learning Read-k-Satisfy-j DNF. [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:110-117 [Conf]
  13. Eyal Kushilevitz
    A Simple Algorithm for Learning O(log n)-Term DNF. [Citation Graph (0, 0)][DBLP]
    COLT, 1996, pp:266-269 [Conf]
  14. Eyal Kushilevitz, Dan Roth
    On Learning Visual Concepts and DNF Formulae. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:317-326 [Conf]
  15. Alex Biryukov, Eyal Kushilevitz
    From Differential Cryptoanalysis to Ciphertext-Only Attacks. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1998, pp:72-88 [Conf]
  16. Benny Chor, Eyal Kushilevitz
    Secret Sharing Over Infinite Domains (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:299-306 [Conf]
  17. Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin
    On 2-Round Secure Multiparty Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2002, pp:178-193 [Conf]
  18. Oded Goldreich, Eyal Kushilevitz
    A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:57-70 [Conf]
  19. Eyal Kushilevitz, Adi Rosén
    A Randomnesss-Rounds Tradeoff in Private Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:397-410 [Conf]
  20. Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
    On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:483-500 [Conf]
  21. Eyal Kushilevitz, Tal Rabin
    Fair e-Lotteries and e-Casinos. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2001, pp:100-109 [Conf]
  22. Amos Beimel, Eyal Kushilevitz
    Learning Boxes in High Dimension. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:3-15 [Conf]
  23. Shai Ben-David, Eyal Kushilevitz, Yishay Mansour
    Online learning versus offline learning. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1995, pp:38-52 [Conf]
  24. Alex Biryukov, Eyal Kushilevitz
    Improved Cryptanalysis of RC5. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1998, pp:85-99 [Conf]
  25. Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai
    Exposure-Resilient Functions and All-or-Nothing Transforms. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:453-469 [Conf]
  26. Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz
    Efficient Multi-party Computation over Rings. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:596-613 [Conf]
  27. Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
    On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:68-86 [Conf]
  28. Yuval Ishai, Eyal Kushilevitz
    On the Hardness of Information-Theoretic Multiparty Computation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:439-455 [Conf]
  29. Eyal Kushilevitz, Rafail Ostrovsky
    One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:104-121 [Conf]
  30. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
    Cryptography in NC0. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:166-175 [Conf]
  31. Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
    On the Applications of Multiplicity Automata in Learning. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:349-358 [Conf]
  32. Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Jean-François Raymond
    Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:261-270 [Conf]
  33. Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
    Private Computations Over the Integers (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:335-344 [Conf]
  34. Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan
    Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:41-50 [Conf]
  35. Tomás Feder, Eyal Kushilevitz, Moni Naor
    Amortized Communication Complexity (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:239-248 [Conf]
  36. Yuval Ishai, Eyal Kushilevitz
    Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:294-304 [Conf]
  37. Eyal Kushilevitz
    Privacy and Communication Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:416-421 [Conf]
  38. Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky
    Reducibility and Completeness in Multi-Party Private Computations [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:478-489 [Conf]
  39. Eyal Kushilevitz, Rafail Ostrovsky
    Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:364-373 [Conf]
  40. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
    Cryptography from Anonymity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:239-248 [Conf]
  41. Shirley Halevy, Eyal Kushilevitz
    Testing Monotonicity over Graph Products. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:721-732 [Conf]
  42. Yuval Ishai, Eyal Kushilevitz
    Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:244-256 [Conf]
  43. Yuval Ishai, Eyal Kushilevitz
    Private Simultaneous Messages Protocols with Applications. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:174-184 [Conf]
  44. Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Randomness vs. Fault-Tolerance. [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:35-44 [Conf]
  45. Eyal Kushilevitz, Yishay Mansour
    An Omega(D log(N/D)) Lower Bound for Broadcast in Radio Networks. [Citation Graph (0, 0)][DBLP]
    PODC, 1993, pp:65-74 [Conf]
  46. Eyal Kushilevitz, Yishay Mansour
    Randomness in Private Computations. [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:181-190 [Conf]
  47. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Log-Space Polynomial End-to-End Communication (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:254- [Conf]
  48. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Amortizing Randomness in Private Multiparty Computations. [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:81-90 [Conf]
  49. Eyal Kushilevitz, Michael O. Rabin
    Randomized Mutual Exclusion Algorithms Revisited. [Citation Graph (0, 0)][DBLP]
    PODC, 1992, pp:275-283 [Conf]
  50. Shirley Halevy, Eyal Kushilevitz
    Distribution-Free Property Testing. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:302-317 [Conf]
  51. Eyal Kushilevitz
    Some Applications of Polynomials for the Design of Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    SCN, 2002, pp:1-13 [Conf]
  52. William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosén
    Dynamic routing on networks with fixed-size buffers. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:771-780 [Conf]
  53. Eyal Kushilevitz, Yishay Mansour
    Computation in Noisy Radio Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:236-243 [Conf]
  54. William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Adaptive Packet Routing for Bursty Adversarial Traffic. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:359-368 [Conf]
  55. Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tal Malkin
    One-Way Functions Are Essential for Single-Server Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:89-98 [Conf]
  56. Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz
    A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:324-333 [Conf]
  57. Benny Chor, Eyal Kushilevitz
    A Zero-One Law for Boolean Privacy (extended abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:62-72 [Conf]
  58. Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin
    The round complexity of verifiable secret sharing and secure multicast. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:580-589 [Conf]
  59. Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin
    Protecting Data Privacy in Private Information Retrieval Schemes. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:151-160 [Conf]
  60. Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, Kobbi Nissim
    Private approximation of NP-hard functions. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:550-559 [Conf]
  61. Yuval Ishai, Eyal Kushilevitz
    Improved Upper Bounds on Information-Theoretic Private Information Retrieval (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:79-88 [Conf]
  62. Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
    Black-box constructions for secure computation. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:99-108 [Conf]
  63. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
    Batch codes and their applications. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:262-271 [Conf]
  64. Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
    Learning with attribute costs. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:356-365 [Conf]
  65. Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
    The Linear-Array Conjecture in Communication Complexity is False. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:1-10 [Conf]
  66. Eyal Kushilevitz, Yehuda Lindell, Tal Rabin
    Information-theoretically secure protocols and security under composition. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:109-118 [Conf]
  67. Eyal Kushilevitz, Yishay Mansour
    Learning Decision Trees Using the Fourier Sprectrum (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:455-464 [Conf]
  68. Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman
    Lower bounds for randomized mutual exclusion. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:154-163 [Conf]
  69. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Log-space polynomial end-to-end communication. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:559-568 [Conf]
  70. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Characterizing Linear Size Circuits in Terms of Privacy. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:541-550 [Conf]
  71. Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
    Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:614-623 [Conf]
  72. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
    Sufficient Conditions for Collision-Resistant Hashing. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:445-456 [Conf]
  73. Eyal Kushilevitz
    Communication Complexity. [Citation Graph (0, 0)][DBLP]
    Advances in Computers, 1997, v:44, n:, pp:331-360 [Journal]
  74. Amos Beimel, Eyal Kushilevitz
    Learning Boxes in High Dimension. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:1/2, pp:76-90 [Journal]
  75. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
    Computationally Private Randomizing Polynomials and Their Applications. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:2, pp:115-162 [Journal]
  76. Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
    The Linear-Array Conjecture in Communication Complexity Is False. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:2, pp:241-254 [Journal]
  77. Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz
    A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:59, pp:- [Journal]
  78. Amos Beimel, Felix Geller, Eyal Kushilevitz
    The Query Complexity of Finding Local Minima in the Lattice. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:171, n:1, pp:69-83 [Journal]
  79. Shai Ben-David, Alon Itai, Eyal Kushilevitz
    Learning by Distances [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:117, n:2, pp:240-250 [Journal]
  80. Amos Beimel, Eyal Kushilevitz
    Learning unions of high-dimensional boxes over the reals. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:5-6, pp:213-220 [Journal]
  81. Benny Chor, Eyal Kushilevitz
    A Communication-Privacy Tradeoff for Modular Addition. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:4, pp:205-210 [Journal]
  82. Eyal Kushilevitz
    A Simple Algorithm for Learning O (log n)-Term DNF. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:6, pp:289-292 [Journal]
  83. Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
    Learning functions represented as multiplicity automata. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:3, pp:506-530 [Journal]
  84. Benny Chor, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan
    Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:6, pp:965-981 [Journal]
  85. William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Adaptive Packet Routing for Bursty Adversarial Traffic. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:3, pp:482-509 [Journal]
  86. Amos Beimel, Yuval Ishai, Eyal Kushilevitz
    General constructions for information-theoretic private information retrieval. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:2, pp:213-247 [Journal]
  87. Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin
    Protecting Data Privacy in Private Information Retrieval Schemes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:3, pp:592-629 [Journal]
  88. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Characterizing Linear Size Circuits in Terms of Pricacy. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:1, pp:129-136 [Journal]
  89. Eyal Kushilevitz, Nathan Linial, Yuri Rabinovich, Michael E. Saks
    Witness Sets for Families of Binary Vectors. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:73, n:2, pp:376-380 [Journal]
  90. Benny Chor, Eyal Kushilevitz
    Secret Sharing Over Infinite Domains. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1993, v:6, n:2, pp:87-95 [Journal]
  91. Oded Goldreich, Eyal Kushilevitz
    A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1993, v:6, n:2, pp:97-116 [Journal]
  92. Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
    On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2006, v:19, n:2, pp:135-167 [Journal]
  93. Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Randomness versus Fault-Tolerance. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2000, v:13, n:1, pp:107-142 [Journal]
  94. Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
    On the Structure of the Privacy Hierarchy. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1994, v:7, n:1, pp:53-60 [Journal]
  95. Shai Ben-David, Eyal Kushilevitz, Yishay Mansour
    Online Learning versus Offline Learning. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1997, v:29, n:1, pp:45-63 [Journal]
  96. Eyal Kushilevitz, Dan Roth
    On Learning Visual Concepts and DNF Formulae. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1996, v:24, n:1, pp:65-85 [Journal]
  97. Howard Aizenstein, Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth
    On Learning Read-k-Satisfy-j DNF. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:6, pp:1515-1530 [Journal]
  98. Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
    Private Computations over the Integers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:376-386 [Journal]
  99. Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan
    Amortized Communication Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:736-750 [Journal]
  100. Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky
    Reducibility and Completeness in Private Computations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:4, pp:1189-1208 [Journal]
  101. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Log-Space Polynomial End-to-End Communication. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:6, pp:1531-1549 [Journal]
  102. Eyal Kushilevitz, Yishay Mansour
    Learning Decision Trees Using the Fourier Spectrum. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1331-1348 [Journal]
  103. Eyal Kushilevitz, Yishay Mansour
    An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:702-712 [Journal]
  104. Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman
    Lower Bounds for Randomized Mutual Exclusion. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:6, pp:1550-1563 [Journal]
  105. Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
    Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:2, pp:457-474 [Journal]
  106. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
    Cryptography in NC0. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:845-888 [Journal]
  107. Amos Beimel, Mike Burmester, Yvo Desmedt, Eyal Kushilevitz
    Computing Functions of a Shared Secret. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:324-345 [Journal]
  108. Benny Chor, Eyal Kushilevitz
    A Zero-One Law for Boolean Privacy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:36-47 [Journal]
  109. Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan
    Fractional Covers and Communication Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:1, pp:76-92 [Journal]
  110. Eyal Kushilevitz
    Privacy and Communication Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:273-284 [Journal]
  111. Eyal Kushilevitz, Yishay Mansour
    Computation in Noisy Radio Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:1, pp:96-108 [Journal]
  112. Eyal Kushilevitz, Yishay Mansour
    Randomness in Private Computations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:4, pp:647-661 [Journal]
  113. Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin
    On Lotteries with Unique Winners. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:1, pp:93-98 [Journal]
  114. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Amortizing Randomness in Private Multiparty Computations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:4, pp:533-544 [Journal]
  115. Eyal Kushilevitz, Adi Rosén
    A Randomness-Rounds Tradeoff in Private Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:1, pp:61-80 [Journal]
  116. József Balogh, János A. Csirik, Yuval Ishai, Eyal Kushilevitz
    Private computation using a PEZ dispenser. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:69-84 [Journal]
  117. Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz
    PAC learning with nasty noise. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:288, n:2, pp:255-275 [Journal]
  118. Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky
    Privacy, additional information and communication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:6, pp:1930-1943 [Journal]
  119. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
    Efficient Arguments without Short PCPs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:278-291 [Conf]
  120. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
    Cryptography with Constant Input Locality. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:92-110 [Conf]
  121. Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III
    Public Key Encryption That Allows PIR Queries. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:50-67 [Conf]
  122. Danny Harnik, Yuval Ishai, Eyal Kushilevitz
    How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:284-302 [Conf]
  123. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
    Zero-knowledge from secure multiparty computation. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:21-30 [Conf]

  124. Secure Multiparty Computation with Minimal Interaction. [Citation Graph (, )][DBLP]


  125. Extracting Correlations. [Citation Graph (, )][DBLP]


  126. The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection. [Citation Graph (, )][DBLP]


  127. Partition Arguments in Multiparty Communication Complexity. [Citation Graph (, )][DBLP]


  128. Choosing, Agreeing, and Eliminating in Communication Complexity. [Citation Graph (, )][DBLP]


  129. From Secrecy to Soundness: Efficient Verification via Secure Computation. [Citation Graph (, )][DBLP]


  130. Communication Complexity: From Two-Party to Multiparty. [Citation Graph (, )][DBLP]


  131. Cryptography with constant computational overhead. [Citation Graph (, )][DBLP]


  132. On the complexity of communication complexity. [Citation Graph (, )][DBLP]


  133. OT-Combiners via Secure Computation. [Citation Graph (, )][DBLP]


  134. Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature? [Citation Graph (, )][DBLP]


  135. Distribution-Free Connectivity Testing for Sparse Graphs. [Citation Graph (, )][DBLP]


  136. On Pseudorandom Generators with Linear Stretch in NC0. [Citation Graph (, )][DBLP]


  137. Partition Arguments in Multiparty Communication Complexity [Citation Graph (, )][DBLP]


Search in 0.045secs, Finished in 0.052secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002