20042022

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2022

    Highly Efficient OT-Based Multiplication Protocols

    Haitner, I., Makriyannis, N., Ranellucci, S. & Tsfadia, E., 2022, Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings. Dunkelman, O. & Dziembowski, S. (eds.). Springer Science and Business Media Deutschland GmbH, p. 180-209 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13275 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On the complexity of two-party differential privacy

    Haitner, I., Mazor, N., Silbak, J. & Tsfadia, E., 6 Sep 2022, STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. Leonardi, S. & Gupta, A. (eds.). Association for Computing Machinery, p. 1392-1405 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2020

    A tight lower bound on adaptively secure full-information coin flip

    Haitner, I. & Karidi-Heller, Y., Nov 2020, Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE Computer Society, p. 1268-1276 9 p. 9317971. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2020-November).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • A tight parallel repetition theorem for partially simulatable interactive arguments via smooth kl-divergence

    Berman, I., Haitner, I. & Tsfadia, E., 2020, Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, Proceedings. Micciancio, D. & Ristenpart, T. (eds.). Springer, p. 544-573 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12172 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Lower bounds on the time/memory tradeoff of function inversion

    Chawin, D., Haitner, I. & Mazor, N., 2020, Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings. Pass, R. & Pietrzak, K. (eds.). Springer Science and Business Media Deutschland GmbH, p. 305-334 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12552 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On the round complexity of the shuffle model

    Beimel, A., Haitner, I., Nissim, K. & Stemmer, U., 2020, Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings. Pass, R. & Pietrzak, K. (eds.). Springer Science and Business Media Deutschland GmbH, p. 683-712 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12551 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2019

    Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation

    Haitner, I., Mazor, N., Shaltiel, R. & Silbak, J., 2019, Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings. Hofheinz, D. & Rosen, A. (eds.). Springer, p. 531-560 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11891 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Distributional collision resistance beyond one-way functions

    Bitansky, N., Haitner, I., Komargodski, I. & Yogev, E., 2019, Advances in Cryptology – EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Ishai, Y. & Rijmen, V. (eds.). Springer Verlag, p. 667-695 29 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11478 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On the communication complexity of key-agreement protocols

    Haitner, I., Mazor, N., Oshman, R., Reingold, O. & Yehudayoff, A., 1 Jan 2019, 10th Innovations in Theoretical Computer Science, ITCS 2019. Blum, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 40. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 124).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On the round complexity of randomized byzantine agreement

    Cohen, R., Haitner, I., Makriyannis, N., Orland, M. & Samorodnitsky, A., Oct 2019, 33rd International Symposium on Distributed Computing, DISC 2019. Suomela, J. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 12. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 146).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2018

    Computational two-party correlation: A dichotomy for key-agreement protocols

    Haitner, I., Nissim, K., Omri, E., Shaltiel, R. & Silbak, J., 30 Nov 2018, Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018. Thorup, M. (ed.). IEEE Computer Society, p. 136-147 12 p. 8555100. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2018-October).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • From fairness to full security in multiparty computation

    Cohen, R., Haitner, I., Omri, E. & Rotem, L., 2018, Security and Cryptography for Networks - 11th International Conference, SCN 2018, Proceedings. Catalano, D. & De Prisco, R. (eds.). Springer Verlag, p. 216-234 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11035 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On the complexity of fair coin flipping

    Haitner, I., Makriyannis, N. & Omri, E., 2018, Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings. Beimel, A. & Dziembowski, S. (eds.). Springer Verlag, p. 539-562 24 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11239 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Tighter bounds on multi-party coin flipping via augmented weak martingales and differentially private sampling

    Beimel, A., Haitner, I., Makriyannis, N. & Omri, E., 30 Nov 2018, Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018. Thorup, M. (ed.). IEEE Computer Society, p. 838-849 12 p. 8555162. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2018-October).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2017

    Fair coin flipping: Tighter analysis and the many-party case

    Buchbinder, N., Haitner, I., Levi, N. & Tsfadia, E., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 2580-2600 21 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2016

    Characterization of secure multiparty computation without broadcast

    Cohen, R., Haitner, I., Omri, E. & Rotem, L., 2016, Theory of Cryptography - 13th International Conference, TCC 2016-A, Proceedings. Kushilevitz, E. & Malkin, T. (eds.). Springer Verlag, p. 596-616 21 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9562).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2015

    Parallel hashing via list recoverability

    Haitner, I., Ishai, Y., Omri, E. & Shaltiel, R., 2015, Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Proceedings. Robshaw, M. & Gennaro, R. (eds.). Springer Verlag, p. 173-190 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9216).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2014

    An almost-optimally fair three-party coin-flipping protocol

    Haitner, I. & Tsfadia, E., 2014, STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 408-416 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Coin flipping of any constant bias implies one-way functions

    Berman, I., Haitner, I. & Tentes, A., 2014, STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 398-407 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2013

    Hardness preserving reductions via cuckoo hashing

    Berman, I., Haitner, I., Komargodski, I. & Naor, M., 2013, Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings. p. 40-59 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7785 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Limits on the usefulness of random oracles

    Haitner, I., Omri, E. & Zarosim, H., 2013, Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings. p. 437-456 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7785 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2012

    From non-adaptive to adaptive pseudorandom functions

    Berman, I. & Haitner, I., 2012, Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings. p. 357-368 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7194 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • On the instantiability of hash-and-sign RSA signatures

    Dodis, Y., Haitner, I. & Tentes, A., 2012, Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings. p. 112-132 21 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7194 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2011

    Coin flipping with constant bias implies one-way functions

    Haitner, I. & Omri, E., 2011, Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. p. 110-119 10 p. 6108156. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2010

    A new sampling protocol and applications to basing cryptographic primitives on the hardness of NP

    Haitner, I., Mahmoody, M. & Xiao, D., 2010, Proceedings - 25th Annual IEEE Conference on Computational Complexity, CCC 2010. IEEE Computer Society, p. 76-87 12 p. 5497895. (Proceedings of the Annual IEEE Conference on Computational Complexity).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Bounded key-dependent message security

    Barak, B., Haitner, I., Hofheinz, D. & Ishai, Y., 2010, Advances in Cryptology - Eurocrypt 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. p. 423-444 22 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6110 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Efficiency improvements in constructing pseudorandom generators from one-way functions

    Haitner, I., Reingold, O. & Vadhan, S., 2010, STOC'10 - Proceedings of the 2010 ACM International Symposium on Theory of Computing. p. 437-446 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Universal one-way hash functions via inaccessible entropy

    Haitner, I., Holenstein, T., Reingold, O., Vadhan, S. & Wee, H., 2010, Advances in Cryptology - Eurocrypt 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. p. 616-637 22 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6110 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2009

    A parallel repetition theorem for any interactive argument

    Haitner, I., 2009, Proceedings - 50th Annual Symposium on Foundations of Computer Science, FOCS 2009. p. 241-250 10 p. 5438629. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Inaccessible entropy

    Haitner, I., Vadhan, S., Reingold, O. & Wee, H., 2009, STOC'09 - Proceedings of the 2009 ACM International Symposium on Theory of Computing. p. 611-620 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On the (Im)possibility of arthur-merlin witness hiding protocols

    Haitner, I., Rosen, A. & Shaltiel, R., 2009, Theory of Cryptography - 6th Theory of Cryptography Conference, TCC 2009, Proceedings. p. 220-237 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5444 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • On the (Im)possibility of key dependent encryption

    Haitner, I. & Holenstein, T., 2009, Theory of Cryptography - 6th Theory of Cryptography Conference, TCC 2009, Proceedings. p. 202-219 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5444 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2008

    A linear lower bound on the communication complexity of single-server private information retrieval

    Haitner, I., Hoch, J. J. & Segev, G., 2008, Theory of Cryptography - Fifth Theory of Cryptography Conference, TCC 2008, Proceedings. p. 445-464 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4948 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Semi-honest to malicious oblivious transfer-the black-box way

    Haitner, I., 2008, Theory of Cryptography - Fifth Theory of Cryptography Conference, TCC 2008, Proceedings. p. 412-426 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4948 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2007

    A new interactive hashing theorem

    Haitner, I. & Reingold, O., 2007, Proceedings - Twenty-Second Annual IEEE Conference on Computational Complexity, CCC 2007. p. 319-332 14 p. 4262773. (Proceedings of the Annual IEEE Conference on Computational Complexity).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Finding collisions in interactive protocols - A tight lower bound on the round complexity of statistically-hiding commitments

    Haitner, I., Hoch, J. J., Reingold, O. & Segev, G., 2007, Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007. p. 669-679 11 p. 4389535. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Statistically-hiding commitment from any one-way function

    Haitner, I. & Reingold, O., 2007, STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing. p. 1-10 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2006

    Efficient pseudorandom generators from exponentially hard one-way functions

    Haitner, I., Harnik, D. & Reingold, O., 2006, Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings. Springer Verlag, p. 228-239 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4052 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On the power of the randomized iterate

    Haitner, I., Harnik, D. & Reingold, O., 2006, Advances in Cryptology - CRYPTO 2006 - 26th Annual International Cryptology Conference, Proceedings. Springer Verlag, p. 22-40 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4117 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access