| 2009 |
|---|
| 8 | EE | Nenad Dedic,
Gene Itkis,
Leonid Reyzin,
Scott Russell:
Upper and Lower Bounds on Black-Box Steganography.
J. Cryptology 22(3): 365-394 (2009) |
| 2008 |
|---|
| 7 | EE | Nenad Dedic,
Danny Harnik,
Leonid Reyzin:
Saving Private Randomness in One-Way Functions and Pseudorandom Generators.
TCC 2008: 607-625 |
| 6 | EE | Nenad Dedic,
Gene Itkis,
Leonid Reyzin,
Scott Russell:
Upper and Lower Bounds on Black-Box Steganography
CoRR abs/0806.0837: (2008) |
| 2007 |
|---|
| 5 | EE | Nenad Dedic,
Payman Mohassel:
Constant-Round Private Database Queries.
ICALP 2007: 255-266 |
| 4 | EE | Nenad Dedic,
Mariusz H. Jakubowski,
Ramarathnam Venkatesan:
A Graph Game Model for Software Tamper Protection.
Information Hiding 2007: 80-95 |
| 2005 |
|---|
| 3 | EE | Nenad Dedic,
Gene Itkis,
Leonid Reyzin,
Scott Russell:
Upper and Lower Bounds on Black-Box Steganography.
TCC 2005: 227-244 |
| 2002 |
|---|
| 2 | EE | Nenad Dedic,
Leonid Reyzin,
Salil P. Vadhan:
An Improved Pseudorandom Generator Based on Hardness of Factoring.
SCN 2002: 88-101 |
| 2001 |
|---|
| 1 | | Predrag Janicic,
Nenad Dedic,
Goran Terzic:
On Different Models for Generating Random SAT Problems.
Computers and Artificial Intelligence 20(5): (2001) |
