Iftach Haitner

	2012
42		Yevgeniy Dodis, Iftach Haitner, Aris Tentes: On the Instantiability of Hash-and-Sign RSA Signatures. TCC 2012: 112-132
41		Itay Berman, Iftach Haitner: From Non-adaptive to Adaptive Pseudorandom Functions. TCC 2012: 357-368
	2011
40		Iftach Haitner, Eran Omri: Coin Flipping with Constant Bias Implies One-Way Functions. FOCS 2011: 110-119
39		Iftach Haitner, Itay Berman: From Non-Adaptive to Adaptive Pseudorandom Functions. IACR Cryptology ePrint Archive 2011: 504 (2011)
38		Yevgeniy Dodis, Iftach Haitner, Aris Tentes: On the (In)Security of RSA Signatures. IACR Cryptology ePrint Archive 2011: 87 (2011)
37		Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: Black-Box Constructions of Protocols for Secure Computation. SIAM J. Comput. 40(2): 225-266 (2011)
36		Iftach Haitner, Danny Harnik, Omer Reingold: On the Power of the Randomized Iterate. SIAM J. Comput. 40(6): 1486-1528 (2011)
	2010
35		Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai: Bounded Key-Dependent Message Security. EUROCRYPT 2010: 423-444
34		Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Universal One-Way Hash Functions via Inaccessible Entropy. EUROCRYPT 2010: 616-637
33		Iftach Haitner, Mohammad Mahmoody, David Xiao: A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. IEEE Conference on Computational Complexity 2010: 76-87
32		Iftach Haitner, Omer Reingold, Salil P. Vadhan: Efficiency improvements in constructing pseudorandom generators from one-way functions. STOC 2010: 437-446
31		Iftach Haitner, Mohammad Mahmoody, David Xiao: A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. Electronic Colloquium on Computational Complexity (ECCC) 17: 1 (2010)
30		Iftach Haitner, Omer Reingold, Salil P. Vadhan: Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions. Electronic Colloquium on Computational Complexity (ECCC) 17: 89 (2010)
29		Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Universal One-Way Hash Functions via Inaccessible Entropy. IACR Cryptology ePrint Archive 2010: 120 (2010)
28		Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: Black-Box Constructions of Protocols for Secure Computation. IACR Cryptology ePrint Archive 2010: 164 (2010)
	2009
27		Iftach Haitner: A Parallel Repetition Theorem for Any Interactive Argument. FOCS 2009: 241-250
26		Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Inaccessible entropy. STOC 2009: 611-620
25		Iftach Haitner, Thomas Holenstein: On the (Im)Possibility of Key Dependent Encryption. TCC 2009: 202-219
24		Iftach Haitner, Alon Rosen, Ronen Shaltiel: On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. TCC 2009: 220-237
23		Iftach Haitner: A Parallel Repetition Theorem for Any Interactive Argument. Electronic Colloquium on Computational Complexity (ECCC) 16: 27 (2009)
22		Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Inaccessible Entropy. Electronic Colloquium on Computational Complexity (ECCC) 16: 45 (2009)
21		Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai: Bounded Key-Dependent Message Security. IACR Cryptology ePrint Archive 2009: 511 (2009)
20		Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel: Reducing Complexity Assumptions for Statistically-Hiding Commitment. J. Cryptology 22(3): 283-310 (2009)
19		Iftach Haitner, Minh-Huyen Nguyen, Shien Jin Ong, Omer Reingold, Salil P. Vadhan: Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function. SIAM J. Comput. 39(3): 1153-1218 (2009)
	2008
18		Iftach Haitner: Semi-honest to Malicious Oblivious Transfer - The Black-Box Way. TCC 2008: 412-426
17		Iftach Haitner, Jonathan J. Hoch, Gil Segev: A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. TCC 2008: 445-464
16		Iftach Haitner, Thomas Holenstein: On the (Im)Possibility of Key Dependent Encryption. IACR Cryptology ePrint Archive 2008: 164 (2008)
	2007
15		Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev: Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. FOCS 2007: 669-679
14		Iftach Haitner, Omer Reingold: A New Interactive Hashing Theorem. IEEE Conference on Computational Complexity 2007: 319-332
13		Iftach Haitner, Omer Reingold: Statistically-hiding commitment from any one-way function. STOC 2007: 1-10
12		Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev: Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. Electronic Colloquium on Computational Complexity (ECCC) 14(038): (2007)
11		Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev: Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. IACR Cryptology ePrint Archive 2007: 145 (2007)
10		Iftach Haitner, Jonathan J. Hoch, Gil Segev: A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. IACR Cryptology ePrint Archive 2007: 351 (2007)
	2006
9		Iftach Haitner, Danny Harnik, Omer Reingold: On the Power of the Randomized Iterate. CRYPTO 2006: 22-40
8		Iftach Haitner, Danny Harnik, Omer Reingold: Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. ICALP (2) 2006: 228-239
7		Iftach Haitner, Omer Reingold: A New Interactive Hashing Theorem. Electronic Colloquium on Computational Complexity (ECCC) 13(096): (2006)
6		Iftach Haitner, Omer Reingold: Statistically-Hiding Commitment from Any One-Way Function. IACR Cryptology ePrint Archive 2006: 436 (2006)
	2005
5		Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel: Reducing Complexity Assumptions for Statistically-Hiding Commitment. EUROCRYPT 2005: 58-77
4		Iftach Haitner, Danny Harnik, Omer Reingold: On the Power of the Randomized Iterate Electronic Colloquium on Computational Complexity (ECCC)(135): (2005)
	2004
3		Iftach Haitner: Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations. TCC 2004: 394-409
2		Iftach Haitner, Ronen Shaltiel: Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions Electronic Colloquium on Computational Complexity (ECCC)(115): (2004)
1		Iftach Haitner, Ronen Shaltiel: Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions. IACR Cryptology ePrint Archive 2004: 335 (2004)

Coauthor Index

1	Boaz Barak	[21] [35]
2	Itay Berman	[39] [41]
3	Yevgeniy Dodis	[38] [42]
4	Danny Harnik	[4] [8] [9] [36]
5	Jonathan J. Hoch	[10] [11] [12] [15] [17]
6	Dennis Hofheinz	[21] [35]
7	Thomas Holenstein	[16] [25] [29] [34]
8	Omer Horvitz	[5] [20]
9	Yuval Ishai	[21] [28] [35] [37]
10	Jonathan Katz	[5] [20]
11	Chiu-Yuen Koo	[5] [20]
12	Eyal Kushilevitz	[28] [37]
13	Yehuda Lindell	[28] [37]
14	Mohammad Mahmoody	[31] [33]
15	Ruggero Morselli	[5] [20]
16	Minh-Huyen Nguyen	[19]
17	Eran Omri	[40]
18	Shien Jin Ong	[19]
19	Erez Petrank	[28] [37]
20	Omer Reingold	[4] [6] [7] [8] [9] [11] [12] [13] [14] [15] [19] [22] [26] [29] [30] [32] [34] [36]
21	Alon Rosen	[24]
22	Gil Segev	[10] [11] [12] [15] [17]
23	Ronen Shaltiel	[1] [2] [5] [20] [24]
24	Aris Tentes	[38] [42]
25	Salil P. Vadhan	[19] [22] [26] [29] [30] [32] [34]
26	Hoeteck Wee	[22] [26] [29] [34]
27	David Xiao	[31] [33]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page