Moni Naor

View Scopus Profile

Moni Naor

Professor

 https://orcid.org/0000-0003-3381-0221

  • Rehovot

    Israel

Calculated based on number of publications stored in Pure and citations from Scopus
1989 …2024

Research activity per year

Search results

  • 2024

    Adjacency Sketches in Adversarial Environments

    Naor, M. & Pekel, E., 4 Jan 2024, Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Wooddruff, D. P. (ed.). Association for Computing Machinery (ACM), p. 1067-1098 32 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    1 Citation (Scopus)

  • Are Your Keys Protected? Time Will Tell

    Dov, Y. B., David, L., Naor, M. & Tzalik, E., Aug 2024, 5th Conference on Information-Theoretic Cryptography, ITC 2024. Aggarwal, D. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 28 p. 3. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 304).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • From Donkeys to Kings in Tournaments

    Abboud, A., Grossman, T., Naor, M. & Solomon, T., 23 Sept 2024, 32nd Annual European Symposium on Algorithms, ESA 2024. Chan, T., Fischer, J., Iacono, J. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 14 p. 3. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 308).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    File
    10 Downloads (Pure)

  • MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably

    Alon, B., Naor, M., Omri, E. & Stemmer, U., 16 Aug 2024, (Published Online) Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings. Reyzin, L. & Stebila, D. (eds.). Springer Science and Business Media B.V., p. 74-108 35 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • That’s Not My Signature! Fail-Stop Signatures for a Post-quantum World

    Boschini, C., Dahari, H., Naor, M. & Ronen, E., 16 Aug 2024, (Published Online) Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings. Reyzin, L. & Stebila, D. (eds.). Springer Science and Business Media B.V., p. 107-140 34 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 14920 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Citation (Scopus)
  • 2023

    Mirror games against an open book player

    Magen, R. & Naor, M., 17 Oct 2023, In: Theoretical Computer Science. 976, 11 p., 114159.

    Research output: Contribution to journal › Article › peer-review

    Open Access

  • New Algorithms and Applications for Risk-Limiting Audits

    Karov, B. & Naor, M., 1 Jun 2023, 4th Symposium on Foundations of Responsible Computing, FORC 2023. Talwar, K. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 256).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Private Everlasting Prediction

    Naor, M., Nissim, K., Stemmer, U. & Yan, C., 2023, In: Advances in Neural Information Processing Systems. 36

    Research output: Contribution to journal › Conference article › peer-review

    Open Access
    2 Citations (Scopus)

  • Resistance to Timing Attacks for Sampling and Privacy Preserving Schemes

    Dov, Y. B., David, L., Naor, M. & Tzalik, E., 1 Jun 2023, 4th Symposium on Foundations of Responsible Computing, FORC 2023. Talwar, K. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 11. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 256).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2022

    CHIP and CRISP: Protecting All Parties Against Compromise Through Identity-Binding PAKEs

    Cremers, C., Naor, M., Paz, S. & Ronen, E., 2022, Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings. Dodis, Y. & Shrimpton, T. (eds.). Springer Science and Business Media B.V., Vol. 13508. p. 668-698 31 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 13508 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    5 Citations (Scopus)

  • Keep That Card in Mind: Card Guessing with Limited Memory

    Menuhin, B. & Naor, M., 2022, 13th Innovations in Theoretical Computer Science Conference, ITCS 2022. Braverman, M. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 28 p. 107. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 215).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    4 Citations (Scopus)

  • Mirror Games Against an Open Book Player

    Magen, R. & Naor, M., 23 May 2022, 11th International Conference on Fun with Algorithms, FUN 2022. Fraigniaud, P. & Uno, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 20. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 226).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    1 Citation (Scopus)

  • ONE-WAY FUNCTIONS AND (IM)PERFECT OBFUSCATION

    Komargodski, I., Moran, T., Naor, M., Pass, R., Rosen, A. & Yogev, E., 2022, In: SIAM Journal on Computing. 51, 6, p. 1769-1795 27 p.

    Research output: Contribution to journal › Article › peer-review

    1 Citation (Scopus)
  • 2021

    Adversarial laws of large numbers and optimal regret in online classification

    Alon, N., Ben-Eliezer, O., Dagan, Y., Moran, S., Naor, M. & Yogev, E., 15 Jun 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). p. 447-455 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    34 Citations (Scopus)

  • Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations

    Asharov, G., Naor, M., Segev, G. & Shahaf, I., Jan 2021, In: SIAM Journal on Computing. 50, 5, p. 1501-1536 36 p.

    Research output: Contribution to journal › Article › peer-review

  • 2020

    Can two walk together: Privacy enhancing methods and preventing tracking of users

    Naor, M. & Vexler, N., 1 May 2020, 1st Symposium on Foundations of Responsible Computing, FORC 2020. Roth, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 20 p. 4. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 156).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    3 Citations (Scopus)

  • Instance complexity and unlabeled certificates in the decision tree model

    Grossman, T., Komargodski, I. & Naor, M., Jan 2020, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. Vidick, T. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 38 p. 56. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 151).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    4 Citations (Scopus)

  • Out-of-band authenticated group key exchange: From strong authentication to immediate key delivery

    Naor, M., Rotem, L. & Segev, G., 1 Jun 2020, 1st Conference on Information-Theoretic Cryptography, ITC 2020. Kalai, Y. T., Smith, A. D. & Wichs, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 25 p. 9. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 163).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    1 Citation (Scopus)

  • Privately Learning Thresholds: Closing the Exponential Gap

    Kaplan, H., Ligett, K., Mansour, Y., Naor, M. & Stemmer, U., 2020, In: Proceedings of Machine Learning Research. 125, p. 2263-2285 23 p.

    Research output: Contribution to journal › Conference article › peer-review

    40 Citations (Scopus)

  • The Power of Distributed Verifiers in Interactive Proofs

    Naor, M., Parter, M. & Yogev, E., 2020, Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'20). Association for Computing Machinery (ACM), p. 1096-1115 20 p. (Symposium on Discrete Algorithms (SODA 2020)).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    44 Citations (Scopus)

  • The Security of Lazy Users in Out-of-Band Authentication

    Naor, M., Rotem, L. & Segev, G., May 2020, In: ACM Transactions on Privacy and Security. 23, 2, 32 p., 9.

    Research output: Contribution to journal › Article › peer-review

  • 2019

    Bloom filters in adversarial environments

    Naor, M. & Eylon, Y., May 2019, In: ACM Transactions on Algorithms. 15, 3, 30 p., 35.

    Research output: Contribution to journal › Article › peer-review

    26 Citations (Scopus)

  • Hardness-Preserving Reductions via Cuckoo Hashing

    Berman, I., Haitner, I., Komargodski, I. & Naor, M., 15 Apr 2019, In: Journal of Cryptology. 32, 2, p. 361-392 32 p.

    Research output: Contribution to journal › Article › peer-review

    6 Citations (Scopus)

  • How to (not) Share a Password: Privacy Preserving Protocols for Finding Heavy Hitters with Adversarial Behavior

    Naor, M., Pinkas, B. & Ronen, E., Nov 2019, CCS '19: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery (ACM), p. 1369-1386 18 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    18 Citations (Scopus)

  • Incrementally Verifiable Computation via Incremental PCPs

    Naor, M., Paneth, O. & Rothblum, G. N., 22 Nov 2019, Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings. Hofheinz, D. & Rosen, A. (eds.). Springer Verlag, Vol. 11892. p. 552-576 25 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 11892 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Citations (Scopus)

  • White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing

    Komargodski, I., Naor, M. & Yogev, E., 28 Sept 2019, In: Journal of the ACM. 66, 5, 28 p., 34.

    Research output: Contribution to journal › Article › peer-review

    13 Citations (Scopus)
  • 2018

    Collision resistant hashing for paranoids: dealing with multiple collisions

    Komargodski, I., Naor, M. & Yogev, E., 31 Mar 2018, (Published Online) Advances in Cryptology - EUROCRYPT 2018 : 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part II. Nielsen, J. B. & Rijmen, V. (eds.). Springer-Verlag Italia, p. 162-194 33 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 proceeding › Conference contribution

    31 Citations (Scopus)

  • How to Share a Secret, Infinitely

    Komargodski, I., Naor, M. & Yogev, E., Jun 2018, In: IEEE Transactions on Information Theory. 64, 6, p. 4179-4190 12 p.

    Research output: Contribution to journal › Article › peer-review

    17 Citations (Scopus)

  • The Security of Lazy Users in Out-of-Band Authentication

    Naor, M., Rotem, L. & Segev, G., 8 Nov 2018, Theory of Cryptography : 16th International Conference, TCC 2018, Proceedings. Beimel, A. & Dziembowski, S. (eds.). Springer Science and Business Media B.V., p. 575-599 25 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 11240 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Citations (Scopus)
  • 2017

    Secret-Sharing for NP

    Komargodski, I., Naor, M. & Yogev, E., 1 Apr 2017, In: Journal of Cryptology. 30, 2, p. 444-469 26 p.

    Research output: Contribution to journal › Article › peer-review

    31 Citations (Scopus)

  • The Journey from NP to TFNP Hardness

    Hubácek, P., Naor, M. & Yogev, E., 28 Nov 2017, 8th Innovations in Theoretical Computer Science Conference, ITCS 2017. Papadimitriou, C. H. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 60:1-60:21 (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 67).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    21 Citations (Scopus)
  • 2016

    An Optimally Fair Coin Toss

    Moran, T., Naor, M. & Segev, G., Jul 2016, In: Journal of Cryptology. 29, 3, p. 491-513 23 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    24 Citations (Scopus)

  • Basic notions

    Hutchison, D., Kanad, T., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., Naor, M., Pandu Rangan, C., Steffen, B., Terzopoulos, D., Tygar, D., Weikum, G. & Skrzypczak, M., 6 Aug 2016, Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity. Springer Verlag, p. 1-26 26 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9802 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

  • Collapse for unambiguous automata

    Hutchison, D., Kanad, T., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., Naor, M., Rangan, C. P., Steffen, B., Terzopoulos, D., Tygar, D., Weikum, G. & Skrzypczak, M., 6 Aug 2016, Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity. Springer Verlag, p. 37-43 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9802 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

  • Conclusions

    Hutchison, D., Kanade, T., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., Naor, M., Pandu Rangan, C., Steffen, B., Terzopoulos, D., Tygar, D., Weikum, G. & Skrzypczak, M., 2016, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, p. 205-206 2 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9802 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

  • Descriptive complexity of MSO+U

    Hutchison, D., Kanade, T., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., Naor, M., Pandu Rangan, C., Steffen, B., Terzopoulos, D., Tygar, D., Weikum, G. & Skrzypczak, M., 6 Aug 2016, Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity. Springer Verlag, p. 159-171 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9802 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

  • How to share a secret, infinitely

    Komargodski, I., Naor, M. & Yogev, E., 2016, Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings. Smith, A. & Hirt, M. (eds.). Springer Verlag, p. 485-514 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9986 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    27 Citations (Scopus)

  • Index problems for game automata

    Hutchison, D., Kanad, T., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., Naor, M., Pandu Rangan, C., Steffen, B., Terzopoulos, D., Tygar, D., Weikum, G. & Skrzypczak, M., 6 Aug 2016, Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity. Springer Verlag, p. 71-89 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9802 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

  • Introduction

    Hutchison, D., Kanad, T., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., Naor, M., Rangan, C. P., Steffen, B., Terzopoulos, D., Tygar, D., Weikum, G. & Skrzypczak, M., 6 Aug 2016, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, p. 29-36 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9802 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

  • Is There an Oblivious RAM Lower Bound?

    Boyle, E. & Naor, M., 2016, In: ITCS'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INNOVATIONS IN THEORETICAL COMPUTER SCIENCE. p. 357-368

    Research output: Contribution to journal › Meeting Abstract › peer-review

    58 Citations (Scopus)

  • Recognition by thin algebras

    Hutchison, D., Kanad, T., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., Naor, M., Pandu Rangan, C., Steffen, B., Terzopoulos, D., Tygar, D., Weikum, G. & Skrzypczak, M., 6 Aug 2016, Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity. Springer Verlag, p. 121-135 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9802 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

  • Searchable symmetric encryption: Optimal locality in linear space via two-dimensional balanced allocations

    Asharov, G., Naor, M., Segev, G. & Shahaf, I., 19 Jun 2016, STOC 2016 - Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing. Mansour, Y. & Wichs, D. (eds.). p. 1101-1114 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing, Vol. 19-21-June-2016).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    85 Citations (Scopus)

  • Separation for ωB- and ωS-regular Languages

    Hutchison, D., Kanade, T., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., Naor, M., Pandu Rangan, C., Steffen, B., Terzopoulos, D., Tygar, D., Weikum, G. & Skrzypczak, M., 6 Aug 2016, Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity. Springer Verlag, p. 183-203 21 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9802 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

  • Spooky interaction and its discontents: Compilers for succinct two-message argument systems

    Dwork, C., Naor, M. & Rothblum, G. N., 21 Jul 2016, Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings. Robshaw, M. & Katz, J. (eds.). Springer Verlag, p. 123-145 23 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 proceeding › Conference contribution › peer-review

    3 Citations (Scopus)

  • The family holiday gathering problem or fair and periodic scheduling of independent sets

    Amir, A., Kapah, O., Kopelowitz, T., Naor, M. & Porat, E., 11 Jul 2016, SPAA 2016 - Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures. p. 367-375 9 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures, Vol. 11-13-July-2016).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    2 Citations (Scopus)

  • Undecidability of MSO+U

    Hutchison, D., Kanade, T., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., Naor, M., Pandu Rangan, C., Steffen, B., Terzopoulos, D., Tygar, D., Weikum, G. & Skrzypczak, M., 6 Aug 2016, Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity. Springer Verlag, p. 173-181 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9802 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

  • Uniformization on thin trees

    Hutchison, D., Kanade, T., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., Naor, M., Pandu Rangan, C., Steffen, B., Terzopoulos, D., Tygar, D., Weikum, G. & Skrzypczak, M., 6 Aug 2016, Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity. Springer Verlag, p. 137-156 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9802 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

  • Universal constructions and robust combiners for indistinguishability obfuscation and witness encryption

    Ananth, P., Jain, A., Naor, M., Sahai, A. & Yogev, E., 21 Jul 2016, Advances in Cryptology : 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings. Robshaw, M. & Katz, J. (eds.). Springer Verlag, p. 491-520 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9815).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    23 Citations (Scopus)

  • When a Büchi language is definable in WMSO

    Hutchison, D., Kanad, T., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., Naor, M., Pandu Rangan, C., Steffen, B., Terzopoulos, D., Tygar, D., Weikum, G. & Skrzypczak, M., 6 Aug 2016, Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity. Springer Verlag, p. 45-69 25 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9802 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

  • When a thin language is definable in WMSO

    Hutchison, D., Kanad, T., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., Naor, M., Pandu Rangan, C., Steffen, B., Terzopoulos, D., Tygar, D., Weikum, G. & Skrzypczak, M., 6 Aug 2016, Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity. Springer Verlag, p. 93-119 27 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9802 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review