Seguir
Iftach Haitner
Iftach Haitner
E-mail confirmado em cs.tau.ac.il
Título
Citado por
Citado por
Ano
Bounded key-dependent message security
B Barak, I Haitner, D Hofheinz, Y Ishai
Advances in Cryptology–EUROCRYPT 2010: 29th Annual International Conference …, 2010
1522010
On the (im) possibility of key dependent encryption
I Haitner, T Holenstein
Theory of Cryptography Conference, 202-219, 2009
1302009
Efficiency improvements in constructing pseudorandom generators from one-way functions
I Haitner, O Reingold, S Vadhan
Proceedings of the forty-second ACM symposium on Theory of computing, 437-446, 2010
1212010
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
1212007
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
1082009
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
1012007
On the power of the randomized iterate
I Haitner, D Harnik, O Reingold
SIAM Journal on Computing 40 (6), 1486-1528, 2011
85*2011
Semi-honest to malicious oblivious transfer—the black-box way
I Haitner
Theory of Cryptography Conference, 412-426, 2008
832008
Reducing complexity assumptions for statistically-hiding commitment
I Haitner, O Horvitz, J Katz, CY Koo, R Morselli, R Shaltiel
Available at SSRN 1157394, 2007
752007
Inaccessible entropy
I Haitner, O Reingold, S Vadhan, H Wee
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
642009
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
512011
A parallel repetition theorem for any interactive argument
I Haitner
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 241-250, 2009
502009
Implementing oblivious transfer using collection of dense trapdoor permutations
I Haitner
Theory of Cryptography Conference, 394-409, 2004
502004
Universal one-way hash functions via inaccessible entropy
I Haitner, T Holenstein, O Reingold, S Vadhan, H Wee
Advances in Cryptology–EUROCRYPT 2010: 29th Annual International Conference …, 2010
492010
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
462015
On the instantiability of hash-and-sign RSA signatures
Y Dodis, I Haitner, A Tentes
Theory of Cryptography: 9th Theory of Cryptography Conference, TCC 2012 …, 2012
45*2012
Limits on the usefulness of random oracles
I Haitner, E Omri, H Zarosim
Journal of Cryptology 29 (2), 283-335, 2016
402016
An almost-optimally fair three-party coin-flipping protocol
I Haitner, E Tsfadia
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
362014
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
352006
On the (im) possibility of arthur-merlin witness hiding protocols
I Haitner, A Rosen, R Shaltiel
Theory of Cryptography: 6th Theory of Cryptography Conference, TCC 2009, San …, 2009
342009
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20