| 2008 |
|---|
| 11 | EE | Iftach Haitner:
Semi-honest to Malicious Oblivious Transfer - The Black-Box Way.
TCC 2008: 412-426 |
| 10 | EE | Iftach Haitner,
Jonathan J. Hoch,
Gil Segev:
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.
TCC 2008: 445-464 |
| 2007 |
|---|
| 9 | EE | Iftach Haitner,
Jonathan J. Hoch,
Omer Reingold,
Gil Segev:
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.
FOCS 2007: 669-679 |
| 8 | EE | Iftach Haitner,
Omer Reingold:
A New Interactive Hashing Theorem.
IEEE Conference on Computational Complexity 2007: 319-332 |
| 7 | EE | Iftach Haitner,
Omer Reingold:
Statistically-hiding commitment from any one-way function.
STOC 2007: 1-10 |
| 2006 |
|---|
| 6 | EE | Iftach Haitner,
Danny Harnik,
Omer Reingold:
On the Power of the Randomized Iterate.
CRYPTO 2006: 22-40 |
| 5 | EE | Iftach Haitner,
Danny Harnik,
Omer Reingold:
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions.
ICALP (2) 2006: 228-239 |
| 2005 |
|---|
| 4 | EE | Iftach Haitner,
Omer Horvitz,
Jonathan Katz,
Chiu-Yuen Koo,
Ruggero Morselli,
Ronen Shaltiel:
Reducing Complexity Assumptions for Statistically-Hiding Commitment.
EUROCRYPT 2005: 58-77 |
| 3 | EE | Iftach Haitner,
Danny Harnik,
Omer Reingold:
On the Power of the Randomized Iterate
Electronic Colloquium on Computational Complexity (ECCC)(135): (2005) |
| 2004 |
|---|
| 2 | EE | Iftach Haitner:
Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations.
TCC 2004: 394-409 |
| 1 | EE | Iftach Haitner,
Ronen Shaltiel:
Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions
Electronic Colloquium on Computational Complexity (ECCC)(115): (2004) |
