| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky |
On the (in)security of hash-based oblivious RAM and a new balancing scheme.  |
SODA  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz, Anat Paskin-Cherniavsky |
From randomizing polynomials to parallel algorithms. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Draisma, Eyal Kushilevitz, Enav Weinreb |
Partition arguments in multiparty communication complexity. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky |
On the (In)security of Hash-based Oblivious RAM and a New Balancing Scheme. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
Black-Box Constructions of Protocols for Secure Computation. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai |
Efficient Non-interactive Secure Computation. |
EUROCRYPT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, Jürg Wullschleger |
Constant-Rate Oblivious Transfer from Noisy Channels. |
CRYPTO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
How to Garble Arithmetic Circuits. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
Black-Box Constructions of Protocols for Secure Computation. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Yehuda Lindell, Tal Rabin |
Information-Theoretically Secure Protocols and Security under Composition. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
From Secrecy to Soundness: Efficient Verification via Secure Computation. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb |
Choosing, Agreeing, and Eliminating in Communication Complexity. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz |
Communication Complexity: From Two-Party to Multiparty. |
SIROCCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz, Anat Paskin |
Secure Multiparty Computation with Minimal Interaction. |
CRYPTO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature? |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Yehuda Lindell, Tal Rabin |
Information-Theoretically Secure Protocols and Security Under Composition. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
Cryptography with Constant Input Locality. |
J. Cryptology |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Draisma, Eyal Kushilevitz, Enav Weinreb |
Partition Arguments in Multiparty Communication Complexity |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai |
Zero-Knowledge Proofs from Secure Multiparty Computation. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Draisma, Eyal Kushilevitz, Enav Weinreb |
Partition Arguments in Multiparty Communication Complexity. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Enav Weinreb |
The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai |
Extracting Correlations. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
leakage-resilient cryptography, oblivious transfer, secure computation, randomness extractors, noisy channels |
| 1 | Eyal Kushilevitz, Enav Weinreb |
On the complexity of communication complexity. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
protocol tree, lower bounds, communication complexity, hardness of approximation, pseudo random functions |
| 1 | Shirley Halevy, Eyal Kushilevitz |
Distribution-Free Connectivity Testing for Sparse Graphs. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Distribution-free testing, Connectivity testing, Properties of sparse graphs, Property testing |
| 1 | Shirley Halevy, Eyal Kushilevitz |
Testing monotonicity over graph products. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
On Pseudorandom Generators with Linear Stretch in NC0. |
Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
Subject classification. 94A60, 68P25 |
| 1 | Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio |
Learning Automata. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen |
OT-Combiners via Secure Computation. |
TCC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai |
Cryptography with constant computational overhead. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
constant computational overhead, cryptography, universal hashing |
| 1 | Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III |
Public Key Encryption that Allows PIR Queries. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Shirley Halevy, Eyal Kushilevitz |
Distribution-Free Property-Testing. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Harnik, Yuval Ishai, Eyal Kushilevitz |
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? |
CRYPTO |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III |
Public Key Encryption That Allows PIR Queries. |
CRYPTO |
2007 |
DBLP DOI BibTeX RDF |
Public-key Encryption with special properties, Database security, Private Information Retrieval, Searching on encrypted data |
| 1 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
Cryptography with Constant Input Locality. |
CRYPTO |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky |
Efficient Arguments without Short PCPs. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai |
Zero-knowledge from secure multiparty computation. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
cryptography, zero-knowledge, secure computation, black-box reductions |
| 1 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai |
Cryptography from Anonymity. |
IACR Cryptology ePrint Archive |
2006 |
DBLP BibTeX RDF |
|
| 1 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
Computationally Private Randomizing Polynomials and Their Applications. |
Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
Subject classification. 94A60, 68P25, 68Q15 |
| 1 | Ran Canetti, Eyal Kushilevitz, Yehuda Lindell |
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. |
J. Cryptology |
2006 |
DBLP DOI BibTeX RDF |
Universal composability, Secure two-party computation, Impossibility results |
| 1 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
Cryptography in NC0. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. |
CRYPTO |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
On Pseudorandom Generators with Linear Stretch in NC0. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai |
Cryptography from Anonymity. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Yehuda Lindell, Tal Rabin |
Information-theoretically secure protocols and security under composition. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
theory of cryptography, information-theoretic security, secure computation, protocol composition |
| 1 | Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
Black-box constructions for secure computation. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
theory of cryptography, oblivious transfer, secure computation, black-box reductions |
| 1 | Eyal Kushilevitz, Yishay Mansour |
Computation in Noisy Radio Networks. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Yuval Ishai, Eyal Kushilevitz |
General constructions for information-theoretic private information retrieval. |
J. Comput. Syst. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky |
Sufficient Conditions for Collision-Resistant Hashing. |
TCC |
2005 |
DBLP DOI BibTeX RDF |
private information-retrieval, homomorphic encryption, Collision-resistant hash functions |
| 1 | Shirley Halevy, Eyal Kushilevitz |
A Lower Bound for Distribution-Free Monotonicity Testing. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
Computationally Private Randomizing Polynomials and Their Applications. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Eyal Kushilevitz, Yishay Mansour |
Learning with attribute costs. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
approximation algorithms, learning, online |
| 1 | Ran Canetti, Eyal Kushilevitz, Yehuda Lindell |
On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions. |
IACR Cryptology ePrint Archive |
2004 |
DBLP BibTeX RDF |
|
| 1 | Shirley Halevy, Eyal Kushilevitz |
Testing Monotonicity over Graph Products. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz |
On the Hardness of Information-Theoretic Multiparty Computation. |
EUROCRYPT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Shirley Halevy, Eyal Kushilevitz |
Distribution-Free Connectivity Testing. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
Cryptography in NC0. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai |
Batch codes and their applications. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
load balancing, coding, distributed storage, private information retrieval, locally decodable codes |
| 1 | József Balogh, János A. Csirik, Yuval Ishai, Eyal Kushilevitz |
Private computation using a PEZ dispenser. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz |
Efficient Multi-Party Computation over Rings. |
IACR Cryptology ePrint Archive |
2003 |
DBLP BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Amortizing Randomness in Private Multiparty Computations. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosén |
Dynamic routing on networks with fixed-size buffers. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Canetti, Eyal Kushilevitz, Yehuda Lindell |
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. |
EUROCRYPT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz |
Efficient Multi-party Computation over Rings. |
EUROCRYPT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Shirley Halevy, Eyal Kushilevitz |
Distribution-Free Property Testing. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz |
PAC learning with nasty noise. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz |
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz |
Some Applications of Polynomials for the Design of Cryptographic Protocols. |
SCN |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin |
On 2-Round Secure Multiparty Computation. |
CRYPTO |
2002 |
DBLP DOI BibTeX RDF |
lower bounds, Secure multiparty computation, round complexity |
| 1 | Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Jean-François Raymond |
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Felix Geller, Eyal Kushilevitz |
The Query Complexity of Finding Local Minima in the Lattice. |
Inf. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Tal Rabin |
Fair e-Lotteries and e-Casinos. |
CT-RSA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, Kobbi Nissim |
Private approximation of NP-hard functions. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin |
The round complexity of verifiable secret sharing and secure multicast. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Eyal Kushilevitz |
Learning unions of high-dimensional boxes over the reals. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio |
Learning functions represented as multiplicity automata. |
J. ACM |
2000 |
DBLP DOI BibTeX RDF |
learning disjoint, learning polynomials, multiplicity automata, DNF, computational learning |
| 1 | Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Randomness versus Fault-Tolerance. |
J. Cryptology |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Mike Burmester, Yvo Desmedt, Eyal Kushilevitz |
Computing Functions of a Shared Secret. |
SIAM J. Discrete Math. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin |
Protecting Data Privacy in Private Information Retrieval Schemes. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Adaptive Packet Routing for Bursty Adversarial Traffic. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky |
Reducibility and Completeness in Private Computations. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani |
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Rafail Ostrovsky |
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval. |
EUROCRYPT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai |
Exposure-Resilient Functions and All-or-Nothing Transforms. |
EUROCRYPT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz |
Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
randomizing polynomials, round-efficient secure computation, natural representation, degree-3 polynomials, round-efficient secure protocols, protocols, probability, Boolean functions, Boolean functions, communication complexity, communication complexity, polynomials, secure multi-party computation, branching program, low-degree polynomials |
| 1 | Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky |
The Linear-Array Conjecture in Communication Complexity Is False. |
Combinatorica |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q22, 68Q10, 94A05 |
| 1 | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Characterizing Linear Size Circuits in Terms of Pricacy. |
J. Comput. Syst. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz |
PAC Learning with Nasty Noise. |
ATL |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tal Malkin |
One-Way Functions Are Essential for Single-Server Private Information Retrieval. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz |
Improved Upper Bounds on Information-Theoretic Private Information Retrieval (Extended Abstract). |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Eyal Kushilevitz |
Learning Boxes in High Dimension. |
Algorithmica |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan |
Private Information Retrieval. |
J. ACM |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Adi Rosén |
A Randomness-Rounds Tradeoff in Private Computation. |
SIAM J. Discrete Math. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard Aizenstein, Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth |
On Learning Read-k-Satisfy-j DNF. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Log-Space Polynomial End-to-End Communication. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Yishay Mansour |
An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman |
Lower Bounds for Randomized Mutual Exclusion. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Yishay Mansour |
Computation in Noisy Radio Networks. |
SODA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Amortizing Randomness in Private Multiparty Computations. |
PODC |
1998 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")