| * | 2009 |
|---|
| 9 | EE | Benny Applebaum,
David Cash,
Chris Peikert,
Amit Sahai:
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems.
CRYPTO 2009: 595-618 |
| 2008 |
|---|
| 8 | EE | Benny Applebaum,
Boaz Barak,
David Xiao:
On Basing Lower-Bounds for Learning on Worst-Case Assumptions.
FOCS 2008: 211-220 |
| 7 | EE | Benny Applebaum,
Yuval Ishai,
Eyal Kushilevitz:
On Pseudorandom Generators with Linear Stretch in NC0.
Computational Complexity 17(1): 38-69 (2008) |
| 2007 |
|---|
| 6 | EE | Benny Applebaum,
Yuval Ishai,
Eyal Kushilevitz:
Cryptography with Constant Input Locality.
CRYPTO 2007: 92-110 |
| 2006 |
|---|
| 5 | EE | Benny Applebaum,
Yuval Ishai,
Eyal Kushilevitz:
On Pseudorandom Generators with Linear Stretch in NC0.
APPROX-RANDOM 2006: 260-271 |
| 4 | EE | Benny Applebaum,
Yuval Ishai,
Eyal Kushilevitz:
Computationally Private Randomizing Polynomials and Their Applications.
Computational Complexity 15(2): 115-162 (2006) |
| 3 | EE | Benny Applebaum,
Yuval Ishai,
Eyal Kushilevitz:
Cryptography in NC0.
SIAM J. Comput. 36(4): 845-888 (2006) |
| 2005 |
|---|
| 2 | EE | Benny Applebaum,
Yuval Ishai,
Eyal Kushilevitz:
Computationally Private Randomizing Polynomials and Their Applications.
IEEE Conference on Computational Complexity 2005: 260-274 |
| 2004 |
|---|
| 1 | EE | Benny Applebaum,
Yuval Ishai,
Eyal Kushilevitz:
Cryptography in NC0.
FOCS 2004: 166-175 |
