Eyal Kushilevitz |
|
|---|---|
Author's Web Page  | |
| 30 papers in database with 866 citations  H-number: 17 | |
Journal Papers |
|
| 1. Ran Canetti, Eyal Kushilevitz, Yehuda Lindell, On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions, Journal of Cryptology,
Volume 19(2), pp. 135 - 167,
Springer, 2006. [  Cited
79 times
 ] | |
| 2. Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén, Randomness versus Fault-Tolerance, Journal of Cryptology,
Volume 13(1), pp. 107 - 142,
Springer, 2000. [ Cited
5 times
] | |
| 3. Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz, On the Structure of the Privacy Hierarchy, Journal of Cryptology,
Volume 7(1), pp. 53 - 60,
Springer, 1994. [ Cited
20 times
] | |
| 4. Benny Chor, Eyal Kushilevitz, Secret Sharing Over Infinite Domains, Journal of Cryptology,
Volume 6(2), pp. 87 - 95,
Springer, 1993. [ Cited
14 times
] | |
| 5. Oded Goldreich, Eyal Kushilevitz, A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm, Journal of Cryptology,
Volume 6(2), pp. 97 - 116,
Springer, 1993. [ Cited
28 times
] | |
Conference Papers |
|
| 1. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai, Cryptography with constant computational overhead, pp. 433 - 442, STOC 2008. [  Electronic
Edition][Cited
12 times
] | |
| 2. Danny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen, OT-Combiners via Secure Computation, pp. 393 - 411, TCC 2008. [ Electronic
Edition][Cited
12 times
] | |
| 3. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai, Zero-knowledge from secure multiparty computation, pp. 21 - 30, STOC 2007. [ Electronic
Edition][Cited
23 times
] | |
| 4. Danny Harnik, Yuval Ishai, Eyal Kushilevitz, How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?, pp. 284 - 302, CRYPTO 2007. [ Electronic
Edition][Cited
5 times
] | |
| 5. Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III, Public Key Encryption That Allows PIR Queries, pp. 50 - 67, CRYPTO 2007. [ Electronic
Edition][Cited
32 times
] | |
| 6. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Cryptography with Constant Input Locality, pp. 92 - 110, CRYPTO 2007. [ Electronic
Edition][Cited
10 times
] | |
| 7. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai, Cryptography from Anonymity, pp. 239 - 248, FOCS 2006. [ Electronic
Edition][Cited
15 times
] | |
| 8. Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank, Black-box constructions for secure computation, pp. 99 - 108, STOC 2006. [ Electronic
Edition][Cited
22 times
] | |
| 9. Eyal Kushilevitz, Yehuda Lindell, Tal Rabin, Information-theoretically secure protocols and security under composition, pp. 109 - 118, STOC 2006. [ Electronic
Edition][Cited
29 times
] | |
| 10. Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank, On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation, pp. 483 - 500, CRYPTO 2006. [ Electronic
Edition][ IACR Online
Archive ][Cited
17 times
] | |
| 11. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Sufficient Conditions for Collision-Resistant Hashing, pp. 445 - 456, TCC 2005. [ Electronic
Edition][IACR Online
Archive][Cited
24 times
] | |
| 12. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Cryptography in NC, pp. 166 - 175, FOCS 2004. [ Electronic
Edition][Cited
33 times
] | |
| 13. Yuval Ishai, Eyal Kushilevitz, On the Hardness of Information-Theoretic Multiparty Computation, pp. 439 - 455, EUROCRYPT 2004. [ Electronic
Edition][IACR Online
Archive][Cited
7 times
] | |
| 14. Ran Canetti, Eyal Kushilevitz, Yehuda Lindell, On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions, pp. 68 - 86, EUROCRYPT 2003. [ Electronic
Edition][IACR Online
Archive][Cited
104 times
] | |
| 15. Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz, Efficient Multi-party Computation over Rings, pp. 596 - 613, EUROCRYPT 2003. [ Electronic
Edition][IACR Online
Archive][Cited
35 times
] | |
| 16. Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin, On 2-Round Secure Multiparty Computation, pp. 178 - 193, CRYPTO 2002. [ Electronic
Edition][IACR Online
Archive][Cited
21 times
] | |
| 17. Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Jean-François Raymond, Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval, pp. 261 - 270, FOCS 2002. [ Electronic
Edition][Cited
97 times
] | |
| 18. Eyal Kushilevitz, Tal Rabin, Fair e-Lotteries and e-Casinos, pp. 100 - 109, CT-RSA 2001. [ Electronic
Edition][Cited
19 times
] | |
| 19. Eyal Kushilevitz, Rafail Ostrovsky, One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval, pp. 104 - 121, EUROCRYPT 2000. [ Electronic
Edition][IACR Online
Archive][Cited
35 times
] | |
| 20. Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai, Exposure-Resilient Functions and All-or-Nothing Transforms, pp. 453 - 469, EUROCRYPT 2000. [ Electronic
Edition][IACR Online
Archive][Cited
115 times
] | |
| 21. Alex Biryukov, Eyal Kushilevitz, From Differential Cryptanalysis to Ciphertext-Only Attacks, pp. 72 - 88, CRYPTO 1998. [ Electronic
Edition][Cited
17 times
] | |
| 22. Alex Biryukov, Eyal Kushilevitz, Improved Cryptanalysis of RC5, pp. 85 - 99, EUROCRYPT 1998. [ Electronic
Edition][Cited
66 times
] | |
| 23. Eyal Kushilevitz, Adi Rosén, A Randomness-Rounds Tradeoff in Private Computation, pp. 397 - 410, CRYPTO 1994. [ Electronic
Edition][Cited
19 times
] | |
| 24. Benny Chor, Eyal Kushilevitz, Secret Sharing Over Infinite Domains (Extended Abstract), pp. 299 - 306, CRYPTO 1989. [ Electronic
Edition][Cited
15 times
] | |
| 25. Oded Goldreich, Eyal Kushilevitz, A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm, pp. 57 - 70, CRYPTO 1988. [ Electronic
Edition][Cited
15 times
] | |
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals