Eyal Kushilevitz

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2012
67On the (in)security of hash-based oblivious RAM and a new balancing scheme. Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky. SODA 2012, 143-156. Web SearchBibTeXDownload
2011
66Constant-Rate Oblivious Transfer from Noisy Channels. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, Jürg Wullschleger. CRYPTO 2011, 667-684. Web SearchBibTeXDownload
65Efficient Non-interactive Secure Computation. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai. EUROCRYPT 2011, 406-425. Web SearchBibTeXDownload
64On the (In)security of Hash-based Oblivious RAM and a New Balancing Scheme. Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky. IACR Cryptology ePrint Archive (2011): 327 (2011). Web SearchBibTeXDownload
63On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. Jonathan Katz, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank. SIAM J. Comput. (40): 122-141 (2011). Web SearchBibTeXDownload
62Black-Box Constructions of Protocols for Secure Computation. Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank. SIAM J. Comput. (40): 225-266 (2011). Web SearchBibTeXDownload
2010
61Black-Box Constructions of Protocols for Secure Computation. Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank. IACR Cryptology ePrint Archive (2010): 164 (2010). Web SearchBibTeXDownload
60On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. Jonathan Katz, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank. IACR Cryptology ePrint Archive (2010): 29 (2010). Web SearchBibTeXDownload
59Information-Theoretically Secure Protocols and Security under Composition. Eyal Kushilevitz, Yehuda Lindell, Tal Rabin. SIAM J. Comput. (39): 2090-2112 (2010). Web SearchBibTeXDownload
2009
58Extracting Correlations. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai. FOCS 2009, 261-270. Web SearchBibTeXDownload
57Information-Theoretically Secure Protocols and Security Under Composition. Eyal Kushilevitz, Yehuda Lindell, Tal Rabin. IACR Cryptology ePrint Archive (2009): 630 (2009). Web SearchBibTeXDownload
56Zero-Knowledge Proofs from Secure Multiparty Computation. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai. SIAM J. Comput. (39): 1121-1152 (2009). Web SearchBibTeXDownload
2008
55Cryptography with constant computational overhead. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai. STOC 2008, 433-442. Web SearchBibTeXDownload
2007
54Public Key Encryption That Allows PIR Queries. Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III. CRYPTO 2007, 50-67. Web SearchBibTeXDownload
53Public Key Encryption that Allows PIR Queries. Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III. IACR Cryptology ePrint Archive (2007): 73 (2007). Web SearchBibTeXDownload
52Efficient Arguments without Short PCPs. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky. IEEE Conference on Computational Complexity 2007, 278-291. Web SearchBibTeXDownload
51Zero-knowledge from secure multiparty computation. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai. STOC 2007, 21-30. Web SearchBibTeXDownload
2006
50On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank. CRYPTO 2006, 483-500. Web SearchBibTeXDownload
49Cryptography from Anonymity. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai. FOCS 2006, 239-248. Web SearchBibTeXDownload
48On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. Ran Canetti, Eyal Kushilevitz, Yehuda Lindell. J. Cryptology (19): 135-167 (2006). Web SearchBibTeXDownload
47Black-box constructions for secure computation. Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank. STOC 2006, 99-108. Web SearchBibTeXDownload
46Information-theoretically secure protocols and security under composition. Eyal Kushilevitz, Yehuda Lindell, Tal Rabin. STOC 2006, 109-118. Web SearchBibTeXDownload
2005
45Learning with attribute costs. Haim Kaplan, Eyal Kushilevitz, Yishay Mansour. STOC 2005, 356-365. Web SearchBibTeXDownload
44Sufficient Conditions for Collision-Resistant Hashing. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky. TCC 2005, 445-456. Web SearchBibTeXDownload
2004
43On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions. Ran Canetti, Eyal Kushilevitz, Yehuda Lindell. IACR Cryptology ePrint Archive (2004): 116 (2004). Web SearchBibTeXDownload
42Batch codes and their applications. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai. STOC 2004, 262-271. Web SearchBibTeXDownload
2003
41On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. Ran Canetti, Eyal Kushilevitz, Yehuda Lindell. EUROCRYPT 2003, 68-86. Web SearchBibTeXDownload
40Amortizing Randomness in Private Multiparty Computations. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén. SIAM J. Discrete Math. (16): 533-544 (2003). Web SearchBibTeXDownload
39Dynamic routing on networks with fixed-size buffers. William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosén. SODA 2003, 771-780. Web SearchBibTeXDownload
2002
38PAC learning with nasty noise. Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz. Theor. Comput. Sci. (288): 255-275 (2002). Web SearchBibTeXDownload
2001
37Private approximation of NP-hard functions. Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, Kobbi Nissim. STOC 2001, 550-559. Web SearchBibTeXDownload
2000
36One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval. Eyal Kushilevitz, Rafail Ostrovsky. EUROCRYPT 2000, 104-121. Web SearchBibTeXDownload
35Adaptive Packet Routing for Bursty Adversarial Traffic. William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén. J. Comput. Syst. Sci. (60): 482-509 (2000). Web SearchBibTeXDownload
34Randomness versus Fault-Tolerance. Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén. J. Cryptology (13): 107-142 (2000). Web SearchBibTeXDownload
33Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani. SIAM J. Comput. (30): 457-474 (2000). Web SearchBibTeXDownload
32Reducibility and Completeness in Private Computations. Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky. SIAM J. Comput. (29): 1189-1208 (2000). Web SearchBibTeXDownload
1999
31PAC Learning with Nasty Noise. Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz. ATL 1999, 206-218. Web SearchBibTeXDownload
30The Linear-Array Conjecture in Communication Complexity Is False. Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky. Combinatorica (19): 241-254 (1999). Web SearchBibTeXDownload
29Characterizing Linear Size Circuits in Terms of Pricacy. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén. J. Comput. Syst. Sci. (58): 129-136 (1999). Web SearchBibTeXDownload
1998
28Private Information Retrieval. Carlo Blundo, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan. J. ACM (45): 965-981 (1998). Web SearchBibTeXDownload
27Amortizing Randomness in Private Multiparty Computations. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén. PODC 1998, 81-90. Web SearchBibTeXDownload
26On Learning Read-k-Satisfy-j DNF. Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth, Dan Roth. SIAM J. Comput. (27): 1515-1530 (1998). Web SearchBibTeXDownload
25Log-Space Polynomial End-to-End Communication. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén. SIAM J. Comput. (27): 1531-1549 (1998). Web SearchBibTeXDownload
24Adaptive Packet Routing for Bursty Adversarial Traffic. William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén. STOC 1998, 359-368. Web SearchBibTeXDownload
23Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani. STOC 1998, 614-623. Web SearchBibTeXDownload
1997
22Communication Complexity. Dömötör Pálvölgyi, Michael Sipser. Advances in Computers (44): 331-360 (1997). Web SearchBibTeXDownload
21Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval. Eyal Kushilevitz, Rafail Ostrovsky. FOCS 1997, 364-373. Web SearchBibTeXDownload
20Online Learning versus Offline Learning. Shai Ben-David, Eyal Kushilevitz, Yishay Mansour. Machine Learning (29): 45-63 (1997). Web SearchBibTeXDownload
19Randomness vs. Fault-Tolerance. Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén. PODC 1997, 35-44. Web SearchBibTeX
18A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes. Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz. STOC 1997, 324-333. Web SearchBibTeXDownload
1996
17A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes. Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz. Electronic Colloquium on Computational Complexity (ECCC) (3) (1996). Web SearchBibTeXDownload
16On Learning Visual Concepts and DNF Formulae. Eyal Kushilevitz, Dan Roth. Machine Learning (24): 65-85 (1996). Web SearchBibTeXDownload
15The Linear-Array Conjecture in Communication Complexity is False. Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky. STOC 1996, 1-10. Web SearchBibTeXDownload
14Characterizing Linear Size Circuits in Terms of Privacy. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén. STOC 1996, 541-550. Web SearchBibTeXDownload
1995
13On Self-Directed Learning. Shai Ben-David, Nadav Eiron, Eyal Kushilevitz. COLT 1995, 136-143. Web SearchBibTeXDownload
12Online learning versus offline learning. Shai Ben-David, Eyal Kushilevitz, Yishay Mansour. EuroCOLT 1995, 38-52. Web SearchBibTeXDownload
11Private Information Retrieval. Carlo Blundo, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan. FOCS 1995, 41-50. Web SearchBibTeXDownload
10Learning by Distances. Shai Ben-David, Alon Itai, Eyal Kushilevitz. Inf. Comput. (117): 240-250 (1995). Web SearchBibTeXDownload
9Log-Space Polynomial End-to-End Communication (Abstract). Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén. PODC 1995, 254. Web SearchBibTeX
8Amortized Communication Complexity. Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan. SIAM J. Comput. (24): 736-750 (1995). Web SearchBibTeXDownload
7Log-space polynomial end-to-end communication. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén. STOC 1995, 559-568. Web SearchBibTeXDownload
1994
6On Learning Read-k-Satisfy-j DNF. Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth, Dan Roth. COLT 1994, 110-117. Web SearchBibTeXDownload
5Reducibility and Completeness in Multi-Party Private Computations. Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky. FOCS 1994, 478-489. Web SearchBibTeXDownload
4On Ultrafilters and NP. Shai Ben-David, Mauricio Karchmer, Eyal Kushilevitz. Structure in Complexity Theory Conference 1994, 97-105. Web SearchBibTeX
1993
3On Learning Visual Concepts and DNF Formulae. Eyal Kushilevitz, Dan Roth. COLT 1993, 317-326. Web SearchBibTeXDownload
1991
2Amortized Communication Complexity (Preliminary Version). Tomás Feder, Eyal Kushilevitz, Moni Naor. FOCS 1991, 239-248. Web SearchBibTeXDownload
1990
1Learning by Distances. Shai Ben-David, Alon Itai, Eyal Kushilevitz. COLT 1990, 232-245. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research