Search the dblp DataBase

Publications of Author

1. Iftach Haitner, Danny Harnik, Omer Reingold
   On the Power of the Randomized Iterate. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2006, pp:22-40 [Conf]
   
2. Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel
   Reducing Complexity Assumptions for Statistically-Hiding Commitment. [Citation Graph (0, 0)][DBLP]
   EUROCRYPT, 2005, pp:58-77 [Conf]
   
3. Iftach Haitner, Danny Harnik, Omer Reingold
   Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. [Citation Graph (0, 0)][DBLP]
   ICALP (2), 2006, pp:228-239 [Conf]
   
4. Iftach Haitner
   Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations. [Citation Graph (0, 0)][DBLP]
   TCC, 2004, pp:394-409 [Conf]
   
5. Iftach Haitner, Ronen Shaltiel
   Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:115, pp:- [Journal]
   
6. Iftach Haitner, Danny Harnik, Omer Reingold
   On the Power of the Randomized Iterate [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:135, pp:- [Journal]
   
7. Iftach Haitner, Omer Reingold
   A New Interactive Hashing Theorem. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2007, pp:319-332 [Conf]
   
8. Iftach Haitner, Omer Reingold
   Statistically-hiding commitment from any one-way function. [Citation Graph (0, 0)][DBLP]
   STOC, 2007, pp:1-10 [Conf]
   
9. 
   A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. [Citation Graph (, )][DBLP]
   
   
10. 
    Bounded Key-Dependent Message Security. [Citation Graph (, )][DBLP]
    
    
11. 
    Universal One-Way Hash Functions via Inaccessible Entropy. [Citation Graph (, )][DBLP]
    
    
12. 
    Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. [Citation Graph (, )][DBLP]
    
    
13. 
    A Parallel Repetition Theorem for Any Interactive Argument. [Citation Graph (, )][DBLP]
    
    
14. 
    Inaccessible entropy. [Citation Graph (, )][DBLP]
    
    
15. 
    Efficiency improvements in constructing pseudorandom generators from one-way functions. [Citation Graph (, )][DBLP]
    
    
16. 
    A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. [Citation Graph (, )][DBLP]
    
    
17. 
    Semi-honest to Malicious Oblivious Transfer - The Black-Box Way. [Citation Graph (, )][DBLP]
    
    
18. 
    On the (Im)Possibility of Key Dependent Encryption. [Citation Graph (, )][DBLP]
    
    
19. 
    On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. [Citation Graph (, )][DBLP]
    
    
20. 
    Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. [Citation Graph (, )][DBLP]
    
    
21. 
    A New Interactive Hashing Theorem. [Citation Graph (, )][DBLP]