I
Iftach Haitner
Researcher at Tel Aviv University
Publications - 113
Citations - 2085
Iftach Haitner is an academic researcher from Tel Aviv University. The author has contributed to research in topics: Hash function & One-way function. The author has an hindex of 25, co-authored 111 publications receiving 1904 citations. Previous affiliations of Iftach Haitner include Weizmann Institute of Science & Microsoft.
Papers
More filters
Book ChapterDOI
On the (Im)Possibility of Key Dependent Encryption
Iftach Haitner,Thomas Holenstein +1 more
TL;DR: There exists no reduction from an encryption scheme secure against key-dependent messages to, essentially, any cryptographic assumption if the adversary can obtain an encryption of g (k ) for an arbitrary g, as long as the reduction's proof of security treats both the adversary and the function g as black boxes.
Book ChapterDOI
Bounded key-dependent message security
TL;DR: In this paper, the first public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of arbitrary efficient functions of the secret key was constructed.
Journal ArticleDOI
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
TL;DR: One-way functions suffice to give statistical zero-knowledge arguments for any NP statement, whereby even a computationally unbounded adversarial verifier learns nothing other than the fact that the assertion being proven is true, and no polynomial-time adversarial prover can convince the verifier of a false statement.
Proceedings ArticleDOI
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
TL;DR: In this paper, a tight lower bound on the round complexity of any fully-black-box construction of a statistically-hiding commitment scheme from oneway permutations, and even front trapdoor permutations was derived.
Book ChapterDOI
Semi-honest to malicious oblivious transfer: the black-box way
TL;DR: In this work, oblivious transfer can be black-box reduced to each of the hardness assumptions known to imply a semi-honest oblivious transfer in a black- box manner.