default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIftach Haitner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2022
[j21]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. J. Cryptol. 35(1): 4 (2022)- [j20]Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky:
On the Round Complexity of Randomized Byzantine Agreement. J. Cryptol. 35(2): 10 (2022) - [j19]Amos Beimel, Iftach Haitner
, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. SIAM J. Comput. 51(4): 1126-1171 (2022) - [j18]Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the complexity of fair coin flipping. Theor. Comput. Sci. 914: 23-38 (2022) - 2020
- [j17]Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. SIAM J. Comput. 49(6): 1041-1082 (2020) - [j16]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. Theory Comput. 16: 1-55 (2020) - 2019
- [j15]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness-Preserving Reductions via Cuckoo Hashing. J. Cryptol. 32(2): 361-392 (2019) - 2018
- [j14]Itay Berman, Iftach Haitner, Aris Tentes:
Coin Flipping of Any Constant Bias Implies One-Way Functions. J. ACM 65(3): 14:1-14:95 (2018) - [j13]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. J. Cryptol. 31(2): 587-609 (2018) - 2017
- [j12]Iftach Haitner, Eliad Tsfadia:
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol. SIAM J. Comput. 46(2): 479-542 (2017) - 2016
- [j11]Iftach Haitner, Eran Omri, Hila Zarosim:
Limits on the Usefulness of Random Oracles. J. Cryptol. 29(2): 283-335 (2016) - 2015
- [j10]Itay Berman, Iftach Haitner:
From Non-adaptive to Adaptive Pseudorandom Functions. J. Cryptol. 28(2): 297-311 (2015) - [j9]Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev:
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. SIAM J. Comput. 44(1): 193-242 (2015) - 2014
- [j8]Iftach Haitner, Omer Reingold:
A New Interactive Hashing Theorem. J. Cryptol. 27(1): 109-138 (2014) - [j7]Iftach Haitner, Eran Omri:
Coin Flipping with Constant Bias Implies One-Way Functions. SIAM J. Comput. 43(2): 389-409 (2014) - 2013
- [j6]Iftach Haitner, Omer Reingold, Salil P. Vadhan:
Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions. SIAM J. Comput. 42(3): 1405-1430 (2013) - [j5]Iftach Haitner:
A Parallel Repetition Theorem for Any Interactive Argument. SIAM J. Comput. 42(6): 2487-2501 (2013) - 2011
- [j4]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) - [j3]Iftach Haitner, Danny Harnik, Omer Reingold:
On the Power of the Randomized Iterate. SIAM J. Comput. 40(6): 1486-1528 (2011) - 2009
- [j2]Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel:
Reducing Complexity Assumptions for Statistically-Hiding Commitment. J. Cryptol. 22(3): 283-310 (2009) - [j1]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)
Conference and Workshop Papers
- 2023
- [c43]Iftach Haitner, Noam Mazor, Jad Silbak:
Incompressiblity and Next-Block Pseudoentropy. ITCS 2023: 66:1-66:18 - 2022
- [c42]Iftach Haitner, Daniel Nukrai, Eylon Yogev:
Lower Bound on SNARGs in the Random Oracle Model. CRYPTO (3) 2022: 97-127 - [c41]Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia:
Highly Efficient OT-Based Multiplication Protocols. EUROCRYPT (1) 2022: 180-209 - [c40]Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia:
On the complexity of two-party differential privacy. STOC 2022: 1392-1405 - 2020
- [c39]Itay Berman, Iftach Haitner, Eliad Tsfadia:
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence. CRYPTO (3) 2020: 544-573 - [c38]Iftach Haitner, Yonatan Karidi-Heller:
A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip. FOCS 2020: 1268-1276 - [c37]Dror Chawin, Iftach Haitner, Noam Mazor:
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. TCC (3) 2020: 305-334 - [c36]Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer:
On the Round Complexity of the Shuffle Model. TCC (2) 2020: 683-712 - 2019
- [c35]Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev:
Distributional Collision Resistance Beyond One-Way Functions. EUROCRYPT (3) 2019: 667-695 - [c34]Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff:
On the Communication Complexity of Key-Agreement Protocols. ITCS 2019: 40:1-40:16 - [c33]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. TCC (1) 2019: 531-560 - [c32]Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky:
On the Round Complexity of Randomized Byzantine Agreement. DISC 2019: 12:1-12:17 - 2018
- [c31]Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. FOCS 2018: 136-147 - [c30]Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. FOCS 2018: 838-849 - [c29]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. SCN 2018: 216-234 - [c28]Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the Complexity of Fair Coin Flipping. TCC (1) 2018: 539-562 - 2017
- [c27]Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia:
Fair Coin Flipping: Tighter Analysis and the Many-Party Case. SODA 2017: 2580-2600 - 2016
- [c26]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. TCC (A1) 2016: 596-616 - 2015
- [c25]Iftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel:
Parallel Hashing via List Recoverability. CRYPTO (2) 2015: 173-190 - 2014
- [c24]Itay Berman, Iftach Haitner, Aris Tentes:
Coin flipping of any constant bias implies one-way functions. STOC 2014: 398-407 - [c23]Iftach Haitner, Eliad Tsfadia:
An almost-optimally fair three-party coin-flipping protocol. STOC 2014: 408-416 - 2013
- [c22]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness Preserving Reductions via Cuckoo Hashing. TCC 2013: 40-59 - [c21]Iftach Haitner, Eran Omri, Hila Zarosim:
Limits on the Usefulness of Random Oracles. TCC 2013: 437-456 - 2012
- [c20]Yevgeniy Dodis, Iftach Haitner, Aris Tentes:
On the Instantiability of Hash-and-Sign RSA Signatures. TCC 2012: 112-132 - [c19]Itay Berman, Iftach Haitner:
From Non-adaptive to Adaptive Pseudorandom Functions. TCC 2012: 357-368 - 2011
- [c18]Iftach Haitner, Eran Omri:
Coin Flipping with Constant Bias Implies One-Way Functions. FOCS 2011: 110-119 - 2010
- [c17]Iftach Haitner, Mohammad Mahmoody, David Xiao:
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. CCC 2010: 76-87 - [c16]Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai:
Bounded Key-Dependent Message Security. EUROCRYPT 2010: 423-444 - [c15]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Universal One-Way Hash Functions via Inaccessible Entropy. EUROCRYPT 2010: 616-637 - [c14]Iftach Haitner, Omer Reingold, Salil P. Vadhan:
Efficiency improvements in constructing pseudorandom generators from one-way functions. STOC 2010: 437-446 - 2009
- [c13]Iftach Haitner:
A Parallel Repetition Theorem for Any Interactive Argument. FOCS 2009: 241-250 - [c12]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible entropy. STOC 2009: 611-620 - [c11]Iftach Haitner, Thomas Holenstein:
On the (Im)Possibility of Key Dependent Encryption. TCC 2009: 202-219 - [c10]Iftach Haitner, Alon Rosen, Ronen Shaltiel:
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. TCC 2009: 220-237 - 2008
- [c9]Iftach Haitner:
Semi-honest to Malicious Oblivious Transfer - The Black-Box Way. TCC 2008: 412-426 - [c8]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 - 2007
- [c7]Iftach Haitner, Omer Reingold:
A New Interactive Hashing Theorem. CCC 2007: 319-332 - [c6]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 - [c5]Iftach Haitner, Omer Reingold:
Statistically-hiding commitment from any one-way function. STOC 2007: 1-10 - 2006
- [c4]Iftach Haitner, Danny Harnik, Omer Reingold:
On the Power of the Randomized Iterate. CRYPTO 2006: 22-40 - [c3]Iftach Haitner, Danny Harnik, Omer Reingold:
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. ICALP (2) 2006: 228-239 - 2005
- [c2]Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel:
Reducing Complexity Assumptions for Statistically-Hiding Commitment. EUROCRYPT 2005: 58-77 - 2004
- [c1]Iftach Haitner:
Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations. TCC 2004: 394-409
Parts in Books or Collections
- 2017
- [p1]Iftach Haitner, Salil P. Vadhan:
The Many Entropies in One-Way Functions. Tutorials on the Foundations of Cryptography 2017: 159-217
Informal and Other Publications
- 2024
- [i68]Dan Boneh, Iftach Haitner, Yehuda Lindell:
Exponent-VRFs and Their Applications. IACR Cryptol. ePrint Arch. 2024: 397 (2024) - 2022
- [i67]Iftach Haitner, Noam Mazor, Jad Silbak:
Incompressiblity and Next-Block Pseudoentropy. Electron. Colloquium Comput. Complex. TR22 (2022) - [i66]Iftach Haitner, Daniel Nukrai, Eylon Yogev:
Lower Bound on SNARGs in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2022: 178 (2022) - [i65]Iftach Haitner, Noam Mazor, Jad Silbak:
Incompressiblity and Next-Block Pseudoentropy. IACR Cryptol. ePrint Arch. 2022: 278 (2022) - 2021
- [i64]Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia:
Fair Coin Flipping: Tighter Analysis and the Many-Party Case. CoRR abs/2104.08820 (2021) - [i63]Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev:
Distributional Collision Resistance Beyond One-Way Functions. CoRR abs/2105.00710 (2021) - [i62]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. CoRR abs/2105.00732 (2021) - [i61]Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. CoRR abs/2105.00743 (2021) - [i60]Dror Chawin, Iftach Haitner, Noam Mazor:
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. CoRR abs/2105.00761 (2021) - [i59]Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. CoRR abs/2105.00765 (2021) - [i58]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. CoRR abs/2105.00770 (2021) - [i57]Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the Complexity of Fair Coin Flipping. CoRR abs/2105.00780 (2021) - [i56]Itay Berman, Iftach Haitner, Eliad Tsfadia:
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence. CoRR abs/2105.00801 (2021) - [i55]Iftach Haitner, Eliad Tsfadia:
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol. CoRR abs/2105.00850 (2021) - [i54]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. CoRR abs/2105.00962 (2021) - [i53]Itay Berman, Iftach Haitner, Aris Tentes:
Coin Flipping of \emph{Any} Constant Bias Implies One-Way Functions. CoRR abs/2105.01400 (2021) - [i52]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness-Preserving Reductions via Cuckoo Hashing. CoRR abs/2105.01409 (2021) - [i51]Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev:
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. CoRR abs/2105.01417 (2021) - [i50]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. CoRR abs/2105.01459 (2021) - [i49]Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff:
On the Communication Complexity of Key-Agreement Protocols. CoRR abs/2105.01958 (2021) - [i48]Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia:
On the Complexity of Two-Party Differential Privacy. CoRR abs/2108.07664 (2021) - [i47]Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia:
On the Complexity of Two-Party Differential Privacy. Electron. Colloquium Comput. Complex. TR21 (2021) - [i46]Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia:
Highly Efficient OT-Based Multiplication Protocols. IACR Cryptol. ePrint Arch. 2021: 1373 (2021) - 2020
- [i45]Iftach Haitner, Yonatan Karidi-Heller:
A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip. CoRR abs/2005.01565 (2020) - [i44]Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer:
On the Round Complexity of the Shuffle Model. CoRR abs/2009.13510 (2020) - [i43]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions. CoRR abs/2010.05586 (2020) - [i42]Dror Chawin, Iftach Haitner, Noam Mazor:
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. Electron. Colloquium Comput. Complex. TR20 (2020) - [i41]Iftach Haitner, Yonatan Karidi-Heller:
A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip. Electron. Colloquium Comput. Complex. TR20 (2020) - [i40]Dror Chawin, Iftach Haitner, Noam Mazor:
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. IACR Cryptol. ePrint Arch. 2020: 687 (2020) - [i39]Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer:
On the Round Complexity of the Shuffle Model. IACR Cryptol. ePrint Arch. 2020: 1182 (2020) - 2019
- [i38]Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky:
On the Round Complexity of Randomized Byzantine Agreement. CoRR abs/1907.11329 (2019) - [i37]Itay Berman, Iftach Haitner, Eliad Tsfadia:
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments. Electron. Colloquium Comput. Complex. TR19 (2019) - [i36]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. Electron. Colloquium Comput. Complex. TR19 (2019) - [i35]Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev:
Distributional Collision Resistance Beyond One-Way Functions. IACR Cryptol. ePrint Arch. 2019: 115 (2019) - [i34]Itay Berman, Iftach Haitner, Eliad Tsfadia:
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments. IACR Cryptol. ePrint Arch. 2019: 393 (2019) - [i33]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. IACR Cryptol. ePrint Arch. 2019: 616 (2019) - [i32]Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky:
On the Round Complexity of Randomized Byzantine Agreement. IACR Cryptol. ePrint Arch. 2019: 868 (2019) - [i31]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. IACR Cryptol. ePrint Arch. 2019: 1344 (2019) - 2018
- [i30]Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the Complexity of Fair Coin Flipping. Electron. Colloquium Comput. Complex. TR18 (2018) - [i29]Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff:
On the Communication Complexity of Key-Agreement Protocols. Electron. Colloquium Comput. Complex. TR18 (2018) - [i28]Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
Computational Two-Party Correlation. Electron. Colloquium Comput. Complex. TR18 (2018) - [i27]Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the Complexity of Fair Coin Flipping. IACR Cryptol. ePrint Arch. 2018: 901 (2018) - 2017
- [i26]Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling. Electron. Colloquium Comput. Complex. TR17 (2017) - [i25]Iftach Haitner, Salil P. Vadhan:
The Many Entropies in One-Way Functions. Electron. Colloquium Comput. Complex. TR17 (2017) - 2015
- [i24]Itay Berman, Iftach Haitner, Aris Tentes:
Coin Flipping of Any Constant Bias Implies One-Way Functions. Electron. Colloquium Comput. Complex. TR15 (2015) - [i23]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. IACR Cryptol. ePrint Arch. 2015: 846 (2015) - 2012
- [i22]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness Preserving Reductions via Cuckoo Hashing. Electron. Colloquium Comput. Complex. TR12 (2012) - [i21]Iftach Haitner, Eran Omri, Hila Zarosim:
On the Power of Random Oracles. Electron. Colloquium Comput. Complex. TR12 (2012) - [i20]Iftach Haitner, Eran Omri, Hila Zarosim:
On the Power of Random Oracles. IACR Cryptol. ePrint Arch. 2012: 573 (2012) - [i19]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness Preserving Reductions via Cuckoo Hashing. IACR Cryptol. ePrint Arch. 2012: 722 (2012) - 2011
- [i18]Yevgeniy Dodis, Iftach Haitner, Aris Tentes:
On the (In)Security of RSA Signatures. IACR Cryptol. ePrint Arch. 2011: 87 (2011) - [i17]Iftach Haitner, Itay Berman:
From Non-Adaptive to Adaptive Pseudorandom Functions. IACR Cryptol. ePrint Arch. 2011: 504 (2011) - 2010
- [i16]Iftach Haitner, Mohammad Mahmoody, David Xiao:
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. Electron. Colloquium Comput. Complex. TR10 (2010) - [i15]Iftach Haitner, Omer Reingold, Salil P. Vadhan:
Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions. Electron. Colloquium Comput. Complex. TR10 (2010) - [i14]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Universal One-Way Hash Functions via Inaccessible Entropy. IACR Cryptol. ePrint Arch. 2010: 120 (2010) - [i13]Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank:
Black-Box Constructions of Protocols for Secure Computation. IACR Cryptol. ePrint Arch. 2010: 164 (2010) - 2009
- [i12]Iftach Haitner:
A Parallel Repetition Theorem for Any Interactive Argument. Electron. Colloquium Comput. Complex. TR09 (2009) - [i11]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy. Electron. Colloquium Comput. Complex. TR09 (2009) - [i10]Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai:
Bounded Key-Dependent Message Security. IACR Cryptol. ePrint Arch. 2009: 511 (2009) - 2008
- [i9]Iftach Haitner, Thomas Holenstein:
On the (Im)Possibility of Key Dependent Encryption. IACR Cryptol. ePrint Arch. 2008: 164 (2008) - 2007
- [i8]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. Electron. Colloquium Comput. Complex. TR07 (2007) - [i7]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 Cryptol. ePrint Arch. 2007: 145 (2007) - [i6]Iftach Haitner, Jonathan J. Hoch, Gil Segev:
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. IACR Cryptol. ePrint Arch. 2007: 351 (2007) - 2006
- [i5]Iftach Haitner, Omer Reingold:
A New Interactive Hashing Theorem. Electron. Colloquium Comput. Complex. TR06 (2006) - [i4]Iftach Haitner, Omer Reingold:
Statistically-Hiding Commitment from Any One-Way Function. IACR Cryptol. ePrint Arch. 2006: 436 (2006) - 2005
- [i3]Iftach Haitner, Danny Harnik, Omer Reingold:
On the Power of the Randomized Iterate. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [i2]Iftach Haitner, Ronen Shaltiel:
Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions. Electron. Colloquium Comput. Complex. TR04 (2004) - [i1]Iftach Haitner, Ronen Shaltiel:
Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions. IACR Cryptol. ePrint Arch. 2004: 335 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
