20042023

Research activity per year

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

Search results

  • 2022

    Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications

    Applebaum, B., Ishai, Y., Karni, O. & Patra, A., 2022, Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings. Dodis, Y. & Shrimpton, T. (eds.). Springer Science and Business Media Deutschland GmbH, p. 453-482 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13510 LNCS).

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

  • Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security: (Extended Abstract)

    Applebaum, B., Kachlon, E. & Patra, A., 2022, Theory of Cryptography - 20th International Conference, TCC 2022, Proceedings. Kiltz, E. & Vaikuntanathan, V. (eds.). Springer Science and Business Media Deutschland GmbH, p. 103-120 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13748 LNCS).

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

  • Secret Sharing, Slice Formulas, and Monotone Real Circuits

    Applebaum, B., Beimel, A., Nir, O., Peter, N. & Pitassi, T., 1 Jan 2022, 13th Innovations in Theoretical Computer Science Conference, ITCS 2022. Braverman, M. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 8. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 215).

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

  • Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority: (Extended Abstract)

    Applebaum, B., Kachlon, E. & Patra, A., 2022, Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings. Dodis, Y. & Shrimpton, T. (eds.). Springer Science and Business Media Deutschland GmbH, p. 33-56 24 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13510 LNCS).

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

  • 2021

    On Actively-Secure Elementary MPC Reductions

    Applebaum, B. & Goel, A., 2021, Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings. Nissim, K., Waters, B. & Waters, B. (eds.). Springer Science and Business Media Deutschland GmbH, p. 717-749 33 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13042 LNCS).

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

  • On the randomness complexity of interactive proofs and statistical zero-knowledge proofs

    Applebaum, B. & Golombek, E., 1 Jul 2021, 2nd Conference on Information-Theoretic Cryptography, ITC 2021. Tessaro, S. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 4. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 199).

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

  • Upslices, Downslices, and Secret-Sharing with Complexity of 1. 5 n

    Applebaum, B. & Nir, O., 2021, Advances in Cryptology – CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Proceedings. Malkin, T. & Peikert, C. (eds.). Springer Science and Business Media Deutschland GmbH, p. 627-655 29 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12827 LNCS).

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

  • 2020

    Better secret sharing via robust conditional disclosure of secrets

    Applebaum, B., Beimel, A., Nir, O. & Peter, N., 8 Jun 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). Association for Computing Machinery, p. 280-293 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

  • Separating two-round secure computation from oblivious transfer

    Applebaum, B., Brakerski, Z., Garg, S., Ishai, Y. & Srinivasan, A., Jan 2020, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. Vidick, T. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 71. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 151).

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

  • The resiliency of MPC with low interaction: The benefit of making errors (extended abstract)

    Applebaum, B., Kachlon, E. & Patra, A., 2020, Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings. Pass, R. & Pietrzak, K. (eds.). Springer Science and Business Media Deutschland GmbH, p. 562-594 33 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

  • The round complexity of perfect mpc with active security and optimal resiliency

    Applebaum, B., Kachlon, E. & Patra, A., Nov 2020, Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE Computer Society, p. 1277-1284 8 p. 9317951. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2020-November).

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

  • 2019

    Degree 2 is complete for the round-complexity of malicious MPC

    Applebaum, B., Brakerski, Z. & Tsabary, R., 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. 504-531 28 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11477 LNCS).

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

  • Placing conditional disclosure of secrets in the communication complexity universe

    Applebaum, B. & Vasudevan, P. N., 1 Jan 2019, 10th Innovations in Theoretical Computer Science, ITCS 2019. Blum, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 4. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 124).

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

  • Sampling graphs without forbidden subgraphs and unbalanced expanders with negligible error

    Applebaum, B. & Kachlon, E., Nov 2019, Proceedings - 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, FOCS 2019. IEEE Computer Society, p. 171-179 9 p. 8948701. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2019-November).

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

  • Secret-sharing schemes for general and uniform access structures

    Applebaum, B., Beimel, A., Farràs, O., Nir, O. & Peter, N., 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. 441-471 31 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

  • 2018

    On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate

    Applebaum, B. & Arkis, B., 2018, Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings. Beimel, A. & Dziembowski, S. (eds.). Springer Verlag, p. 317-344 28 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

  • Perfect secure computation in two rounds

    Applebaum, B., Brakerski, Z. & Tsabary, R., 2018, Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings. Beimel, A. & Dziembowski, S. (eds.). Springer Verlag, p. 152-174 23 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

  • The communication complexity of private simultaneous messages, revisited

    Applebaum, B., Holenstein, T., Mishra, M. & Shayevitz, O., 2018, Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2018 Proceedings. Nielsen, J. B. & Rijmen, V. (eds.). Springer Verlag, p. 261-286 26 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10821 LNCS).

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

  • 2017

    Conditional disclosure of secrets: Amplification, closure, amortization, lower-bounds, and separations

    Applebaum, B., Arkis, B., Raykov, P. & Vasudevan, P. N., 2017, Advances in Cryptology – CRYPTO 2017 - 37th Annual International Cryptology Conference, Proceedings. Shacham, H. & Katz, J. (eds.). Springer Verlag, p. 727-757 31 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10401 LNCS).

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

  • Exponentially-hard Gap-CSP and local PRG via local hardcore functions

    Applebaum, B., 10 Nov 2017, Proceedings - 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017. IEEE Computer Society, p. 836-847 12 p. 8104114. (Annual Symposium on Foundations of Computer Science - Proceedings; vol. 2017-October).

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

  • Low-complexity cryptographic hash functions

    Applebaum, B., Haramaty-Krasne, N., Ishai, Y., Kushilevitz, E. & Vaikuntanathan, V., 1 Nov 2017, 8th Innovations in Theoretical Computer Science Conference, ITCS 2017. Papadimitriou, C. H. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 67).

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

  • Secure arithmetic computation with constant computational overhead

    Applebaum, B., Damgård, I., Ishai, Y., Nielsen, M. & Zichron, L., 2017, Advances in Cryptology – CRYPTO 2017 - 37th Annual International Cryptology Conference, Proceedings. Shacham, H. & Katz, J. (eds.). Springer Verlag, p. 223-254 32 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10401 LNCS).

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

  • 2016

    Algebraic attacks against random local Functions and their countermeasures

    Applebaum, B. & Lovett, S., 19 Jun 2016, STOC 2016 - Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing. Mansour, Y. & Wichs, D. (eds.). Association for Computing Machinery, p. 1087-1100 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 19-21-June-2016).

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

    Open Access
  • Fast pseudorandom functions based on expander graphs

    Applebaum, B. & Raykov, P., 2016, Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings. Smith, A. & Hirt, M. (eds.). Springer Verlag, p. 27-56 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9985 LNCS).

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

  • From private simultaneous messages to zero-information Arthur-Merlin protocols and back

    Applebaum, B. & Raykov, P., 2016, Theory of Cryptography - 3th International Conference, TCC 2016-A, Proceedings. Kushilevitz, E. & Malkin, T. (eds.). Springer Verlag, p. 65-82 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9563).

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

  • On the relationship between statistical zero-knowledge and statistical randomized encodings

    Applebaum, B. & Raykov, P., 2016, Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings. Robshaw, M. & Katz, J. (eds.). Springer Verlag, p. 449-477 29 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9816).

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

  • 2015

    Arithmetic cryptography [extended abstract]

    Applebaum, B., Avron, J. & Brzuska, C., 11 Jan 2015, ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science. Association for Computing Machinery, Inc, p. 143-151 9 p. (ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science).

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

  • Deterministic rateless codes for BSC [extended abstract]

    Applebaum, B., David, L. & Even, G., 11 Jan 2015, ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science. Association for Computing Machinery, Inc, p. 31-40 10 p. (ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science).

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

  • Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (extended abstract)

    Applebaum, B., Artemenko, S., Shaltiel, R. & Yang, G., 1 Jun 2015, 30th Conference on Computational Complexity, CCC 2015. Zuckerman, D. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 582-600 19 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 33).

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

  • Obfuscating circuits via composite-order graded encoding

    Applebaum, B. & Brakerski, Z., 2015, Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings. Dodis, Y. & Nielsen, J. B. (eds.). Springer Verlag, p. 528-556 29 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9015).

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

  • 2014

    Bootstrapping obfuscators via fast pseudorandom functions

    Applebaum, B., 2014, Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II. Sarkar, P. & Iwata, T. (eds.). Springer Verlag, p. 162-172 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8874).

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

    Open Access
  • 2013

    Cryptographic hardness of random local functions - Survey

    Applebaum, B., 2013, Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings. p. 599 1 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
  • Encoding functions with constant online rate or how to compress garbled circuits keys

    Applebaum, B., Ishai, Y., Kushilevitz, E. & Waters, B., 2013, Advances in Cryptology, CRYPTO 2013 - 33rd Annual Cryptology Conference, Proceedings. PART 2 ed. p. 166-184 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8043 LNCS, no. PART 2).

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

    Open Access
  • Garbling XOR gates "for free" in the standard model

    Applebaum, B., 2013, Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings. p. 162-181 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
  • Locally computable UOWHF with linear shrinkage

    Applebaum, B. & Moses, Y., 2013, Advances in Cryptology, EUROCRYPT 2013 - 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. p. 486-502 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7881 LNCS).

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

    Open Access
  • 2012

    A dichotomy for local small-bias generators

    Applebaum, B., Bogdanov, A. & Rosen, A., 2012, Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings. p. 600-617 18 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
  • Pseudorandom generators with long stretch and low locality from random local one-way functions

    Applebaum, B., 2012, STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing. p. 805-815 11 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

  • 2011

    How to garble arithmetic circuits

    Applebaum, B., Ishai, Y. & Kushilevitz, E., 2011, Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. p. 120-129 10 p. 6108157. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

  • Key-dependent message security: Generic amplification and completeness

    Applebaum, B., 2011, Advances in Cryptology - EUROCRYPT 2011, 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Springer Verlag, p. 527-546 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6632 LNCS).

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

    Open Access
  • Randomly encoding functions: A new cryptographic paradigm(Invited Talk)

    Applebaum, B., 2011, Information Theoretic Security - 5th International Conference, ICITS 2011, Proceedings. p. 25-31 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6673 LNCS).

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

  • Semantic Security under Related-Key Attacks and Applications

    Applebaum, B., Harnik, D. & Ishai, Y., 7 Jan 2011, Innovations in Computer Science - ICS 2011: Tsinghua University. Beijing, China, p. 45-60

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

  • 2010

    Collaborative, privacy-preserving data aggregation at scale

    Applebaum, B., Ringberg, H., Freedman, M. J., Caesar, M. & Rexford, J., 2010, Privacy Enhancing Technologies - 10th International Symposium, PETS 2010, Proceedings. p. 56-74 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6205 LNCS).

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

  • Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?

    Applebaum, B., Ishai, Y. & Kushilevitz, E., 5 Jan 2010, Innovations in Computer Science - ICS 2010: Tsinghua University. Beijing, China, p. 1-19

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

  • From secrecy to soundness: Efficient verification via secure computation

    Applebaum, B., Ishai, Y. & Kushilevitz, E., 2010, Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 1 ed. p. 152-163 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6198 LNCS, no. PART 1).

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

  • Public-key cryptography from different assumptions

    Applebaum, B., Barak, B. & Wigderson, A., 2010, STOC'10 - Proceedings of the 2010 ACM International Symposium on Theory of Computing. p. 171-180 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

  • 2009

    Fast cryptographic primitives and circular-secure encryption based on hard learning problems

    Applebaum, B., Cash, D., Peikert, C. & Sahai, A., 2009, Advances in Cryptology - CRYPTO 2009 - 29th Annual International Cryptology Conference, Proceedings. p. 595-618 24 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5677 LNCS).

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

    Open Access
  • 2008

    On basing lower-bounds for learning on worst-case assumptions

    Applebaum, B., Barak, B. & Xiao, D., 2008, Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. p. 211-220 10 p. 4690955. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

  • 2007

    Cryptography with constant input locality

    Applebaum, B., Ishai, Y. & Kushilevitz, E., 2007, Advances in Cryptology - CRYPTO 2007 - 27th Annual International Cryptology Conference, Proceedings. Springer Verlag, p. 92-110 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4622 LNCS).

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

    Open Access
  • 2006

    On pseudorandom generators with linear stretch in NC0

    Applebaum, B., Ishai, Y. & Kushilevitz, E., 2006, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 a. Springer Verlag, p. 260-271 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4110 LNCS).

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

  • 2005

    Computationally private randomizing polynomials and their applications

    Applebaum, B., Ishai, Y. & Kushilevitz, E., 11 Jun 2005, 20th Annual IEEE Conference on Computational Complexity. San Jose, California, p. 260-274 15 p. (Proceedings of the Annual IEEE Conference on Computational Complexity).

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

    Open Access