Searching for authors named "Iftach Haitner" – sorted by Relevance.
12 documents found, showing 1 through 10.
Next 10 →
-
Implementing oblivious transfer using collection of dense trapdoor permutations
- …Implementing Oblivious Transfer Using a Collection of Dense Trapdoor Permutations Iftach Haitner…
- Cited by 8 (3 self) – Add To MetaCart
-
Semi-honest to malicious oblivious transfer - the black-box way
- …Semi-Honest to Malicious Oblivious Transfer The Black-Box Way Iftach Haitner Dept. of Computer…
- Cited by 3 (0 self) – Add To MetaCart
-
On the (Im)Possibility of Key Dependent Encryption
- …On the (Im)Possibility of Key Dependent Encryption Iftach Haitner ∗ Thomas Holenstein † Abstract…
- Add To MetaCart
-
Statistically-hiding commitment from any one-way function
- …Statistically-Hiding Commitment from Any One-Way Function Iftach Haitner ∗ Omer Reingold…
- Cited by 15 (6 self) – Add To MetaCart
-
A new interactive hashing theorem
- …A New Interactive Hashing Theorem ∗ Iftach Haitner † Omer Reingold † April 13, 2008 Abstract…
- Cited by 6 (4 self) – Add To MetaCart
-
On the Power of the Randomized Iterate ∗ Draft
- …On the Power of the Randomized Iterate ∗ Draft Iftach Haitner † Danny Harnik ‡ Omer Reingold…
- Add To MetaCart
-
Efficient pseudorandom generators from exponentially hard one-way functions
- …Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions Iftach Haitner 1…
- Cited by 3 (3 self) – Add To MetaCart
-
On the power of the randomized iterate
- …On the Power of the Randomized Iterate Iftach Haitner 1 , Danny Harnik 2 , Omer Reingold 3 1 Dept…
- Cited by 10 (5 self) – Add To MetaCart
-
Advisor
- …Thesis for the degree Doctor of Philosophy By Iftach Haitner New Implications and Improved…
- Add To MetaCart
-
A linear lower bound on the communication complexity of single-server private information retreival (preliminary title
- … Retrieval Iftach Haitner ∗ Jonathan J. Hoch ∗ Gil Segev ∗ Abstract We study the communication complexity…
- Cited by 2 (1 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
