Iftach Haitner
Iftach Haitner
Verified email at cs.tau.ac.il
Title
Cited by
Cited by
Year
Bounded key-dependent message security
B Barak, I Haitner, D Hofheinz, Y Ishai
Annual International Conference on the Theory and Applications of …, 2010
1302010
On the (im) possibility of key dependent encryption
I Haitner, T Holenstein
Theory of Cryptography Conference, 202-219, 2009
1162009
Statistically-hiding commitment from any one-way function
I Haitner, O Reingold
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
1022007
Efficiency improvements in constructing pseudorandom generators from one-way functions
I Haitner, O Reingold, S Vadhan
SIAM Journal on Computing 42 (3), 1405-1430, 2013
912013
Finding collisions in interactive protocols-a tight lower bound on the round complexity of statistically-hiding commitments
I Haitner, JJ Hoch, O Reingold, G Segev
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 669-679, 2007
842007
Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
I Haitner, MH Nguyen, SJ Ong, O Reingold, S Vadhan
SIAM Journal on Computing 39 (3), 1153-1218, 2009
792009
Semi-honest to malicious oblivious transfer—the black-box way
I Haitner
Theory of Cryptography Conference, 412-426, 2008
732008
On the power of the randomized iterate
I Haitner, D Harnik, O Reingold
SIAM Journal on Computing 40 (6), 1486-1528, 2011
64*2011
Reducing complexity assumptions for statistically-hiding commitment
I Haitner, O Horvitz, J Katz, CY Koo, R Morselli, R Shaltiel
Journal of cryptology 22 (3), 283-310, 2009
62*2009
Inaccessible entropy
I Haitner, O Reingold, S Vadhan, H Wee
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
552009
Implementing oblivious transfer using collection of dense trapdoor permutations
I Haitner
Theory of Cryptography Conference, 394-409, 2004
442004
Black-box constructions of protocols for secure computation
I Haitner, Y Ishai, E Kushilevitz, Y Lindell, E Petrank
SIAM Journal on Computing 40 (2), 225-266, 2011
382011
Universal one-way hash functions via inaccessible entropy
I Haitner, T Holenstein, O Reingold, S Vadhan, H Wee
Annual International Conference on the Theory and Applications of …, 2010
382010
A parallel repetition theorem for any interactive argument
I Haitner
SIAM Journal on Computing 42 (6), 2487-2501, 2013
36*2013
On the instantiability of hash-and-sign RSA signatures
Y Dodis, I Haitner, A Tentes
Theory of Cryptography Conference, 112-132, 2012
34*2012
A new interactive hashing theorem
I Haitner, O Reingold
Journal of cryptology 27 (1), 109-138, 2014
31*2014
Efficient pseudorandom generators from exponentially hard one-way functions
I Haitner, D Harnik, O Reingold
International Colloquium on Automata, Languages, and Programming, 228-239, 2006
282006
Limits on the usefulness of random oracles
I Haitner, E Omri, H Zarosim
Journal of Cryptology 29 (2), 283-335, 2016
27*2016
On the (im) possibility of arthur-merlin witness hiding protocols
I Haitner, A Rosen, R Shaltiel
Theory of Cryptography Conference, 220-237, 2009
262009
Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
I Haitner, JJ Hoch, O Reingold, G Segev
SIAM Journal on Computing 44 (1), 193-242, 2015
232015
The system can't perform the operation now. Try again later.
Articles 1–20