Folgen
Eyal Kushilevitz
Eyal Kushilevitz
Computer Science Department, Technion
Bestätigte E-Mail-Adresse bei cs.technion.ac.il
Titel
Zitiert von
Zitiert von
Jahr
Private information retrieval
B Chor, O Goldreich, E Kushilevitz, M Sudan
Foundations of Computer Science, 1995. Proceedings., 36th Annual Symposium …, 1995
30001995
Communication complexity
E Kushilevitz
Advances in Computers 44, 331-360, 1997
25021997
Replication is not needed: Single database, computationally-private information retrieval
E Kushilevitz, R Ostrovsky
Proceedings 38th annual symposium on foundations of computer science, 364-373, 1997
12321997
Efficient search for approximate nearest neighbor in high dimensional spaces
E Kushilevitz, R Ostrovsky, Y Rabani
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
6991998
Protecting data privacy in private information retrieval schemes
Y Gertner, Y Ishai, E Kushilevitz, T Malkin
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
6371998
Learning decision trees using the Fourier spectrum
E Kushilevitz, Y Mansour
Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991
5751991
Zero-knowledge from secure multiparty computation
Y Ishai, E Kushilevitz, R Ostrovsky, A Sahai
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
460*2007
Public key encryption that allows PIR queries
D Boneh, E Kushilevitz, R Ostrovsky, WE Skeith
Advances in Cryptology-CRYPTO 2007: 27th Annual International Cryptology …, 2007
3652007
An (D log (N/D)) Lower Bound for Broadcast in Radio Networks
E Kushilevitz, Y Mansour
SIAM Journal on Computing 27 (3), 702-712, 1998
344*1998
Cryptography in
B Applebaum, Y Ishai, E Kushilevitz
SIAM Journal on Computing 36 (4), 845-888, 2006
3382006
Breaking the o (n/sup 1/(2k-1)/) barrier for information-theoretic private information retrieval
A Beimel, Y Ishai, E Kushilevitz, JF Raymond
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002
3092002
Randomizing polynomials: A new representation with applications to round-efficient secure computation
Y Ishai, E Kushilevitz
Proceedings 41st Annual Symposium on Foundations of Computer Science, 294-304, 2000
3032000
On the (in) security of hash-based oblivious RAM and a new balancing scheme
E Kushilevitz, S Lu, R Ostrovsky
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
3002012
A zero-one law for Boolean privacy
B Chor, E Kushilevitz
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
2561989
Batch codes and their applications
Y Ishai, E Kushilevitz, R Ostrovsky, A Sahai
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
2462004
Exposure-resilient functions and all-or-nothing transforms
R Canetti, Y Dodis, S Halevi, E Kushilevitz, A Sahai
Advances in Cryptology—EUROCRYPT 2000, 453-469, 2000
2442000
Privacy and communication complexity
E Kushelvitz
SIAM Journal on Discrete Mathematics 5 (2), 273-284, 1992
2341992
From secrecy to soundness: Efficient verification via secure computation
B Applebaum, Y Ishai, E Kushilevitz
Work 716835, 0627781, 2010
2192010
On the limitations of universally composable two-party computation without set-up assumptions
R Canetti, E Kushilevitz, Y Lindell
Advances in Cryptology—EUROCRYPT 2003: International Conference on the …, 2003
1972003
Perfect constant-round secure computation via perfect randomizing polynomials
Y Ishai, E Kushilevitz
Automata, Languages and Programming: 29th International Colloquium, ICALP …, 2002
1932002
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20