World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
51
Citations
10000
World Ranking
5359
National Ranking
2453

Research.com Recognitions

  • 2018 - Fellow of Alfred P. Sloan Foundation

Overview

Daniel Wichs is affiliated with Northeastern University in the United States and has a research focus centered around Computer Science, with a specific emphasis on Artificial Intelligence, Computer Vision and Pattern Recognition, and Computational Theory and Mathematics. Their work spans various subfields including Computer Networks and Communications and Information Systems.

The primary topics addressed in Daniel Wichs's research include Cryptography and Data Security, Cryptographic Implementations and Security, and Privacy-Preserving Technologies in Data. They have also contributed to areas concerning Chaos-based Image/Signal Encryption, Complexity and Algorithms in Graphs, Coding theory and cryptography, and Advanced Steganography and Watermarking Techniques.

Among recent publications, Daniel Wichs has co-authored multiple papers such as:

  • "Use Your Brain! Arithmetic 3PC for Any Modulus with Active Security" (2020), published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Is There an Oblivious RAM Lower Bound for Online Reads?" (2021), appearing in the Journal of Cryptology
  • "A system capable of verifiably and privately screening global DNA synthesis" (2024), available through arXiv (Cornell University)
  • "Adaptively Secure MPC with Sublinear Communication Complexity" (2023), also published in the Journal of Cryptology
  • "Efficient Maliciously Secure Oblivious Exponentiations" (2024), featured in IACR Communications in Cryptology

Frequent collaborators in their research include Willy Quach, Vinod Vaikuntanathan, Yevgeniy Dodis, Ethan Mook, and Hoeteck Wee.

Daniel Wichs frequently publishes in venues such as Leibniz-Zentrum für Informatik (Schloss Dagstuhl), the Journal of Cryptology, IACR Communications in Cryptology, arXiv (Cornell University), and OPAL (Open@LaTrobe) from La Trobe University.

In recognition of professional achievements, Daniel Wichs was named a Fellow of the Alfred P. Sloan Foundation in 2018.

Best Publications

  • Separating succinct non-interactive arguments from all falsifiable assumptions

    Craig Gentry;Daniel Wichs

  • Multiparty computation with low communication, computation and interaction via threshold FHE

    Gilad Asharov;Abhishek Jain;Adriana López-Alt;Eran Tromer

  • Proofs of Retrievability via Hardness Amplification

    Yevgeniy Dodis;Salil Vadhan;Daniel Wichs

  • Two Round Multiparty Computation via Multi-key FHE

    Pratyay Mukherjee;Daniel Wichs

  • Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model.

    Joël Alwen;Yevgeniy Dodis;Daniel Wichs

  • Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors

    Ronald Cramer;Yevgeniy Dodis;Serge Fehr;Carles Padró

  • Dynamic Proofs of Retrievability Via Oblivious RAM

    David Cash;Alptekin Küpçü;Daniel Wichs

  • Cryptography against Continuous Memory Attacks

    Yevgeniy Dodis;Kristiyan Haralambiev;Adriana Lopez-Alt;Daniel Wichs

  • Leveled Fully Homomorphic Signatures from Standard Lattices

    Sergey Gorbunov;Vinod Vaikuntanathan;Daniel Wichs

  • Non-Malleable Codes

    Stefan Dziembowski;Krzysztof Pietrzak;Daniel Wichs

  • Public-Key encryption in the bounded-retrieval model

    Joël Alwen;Yevgeniy Dodis;Moni Naor;Gil Segev

  • Optimizing ORAM and Using It Efficiently for Secure Computation

    Craig Gentry;Kenny A. Goldman;Shai Halevi;Charanjit Julta

  • Efficient Public-Key Cryptography in the Presence of Key Leakage.

    Yevgeniy Dodis;Kristiyan Haralambiev;Adriana López-Alt;Daniel Wichs

  • Learning with Rounding, Revisited

    Joël Alwen;Stephan Krenn;Krzysztof Pietrzak;Daniel Wichs

  • Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM

    Srinivas Devadas;Marten van Dijk;Christopher W. Fletcher;Ling Ren

  • Fully Homomorphic Message Authenticators

    Rosario Gennaro;Daniel Wichs

  • Fiat-Shamir: from practice to theory

    Ran Canetti;Yilei Chen;Justin Holmgren;Alex Lombardi

  • Non-malleable extractors and symmetric key cryptography from weak secrets

    Yevgeniy Dodis;Daniel Wichs

  • Security analysis of pseudo-random number generators with input: /dev/random is not robust

    Yevgeniy Dodis;David Pointcheval;Sylvain Ruhault;Damien Vergniaud

  • Obfuscating Compute-and-Compare Programs under LWE

    Daniel Wichs;Giorgos Zirdelis

  • Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE.

    Gilad Asharov;Abhishek Jain;Daniel Wichs

Frequent Co-Authors

Yevgeniy Dodis
Yevgeniy Dodis New York University
Krzysztof Pietrzak
Krzysztof Pietrzak Institute of Science and Technology Austria
Craig Gentry
Craig Gentry TripleBlind
Shai Halevi
Shai Halevi Amazon (United States)
Hoeteck Wee
Hoeteck Wee École Normale Supérieure
Brent Waters
Brent Waters The University of Texas at Austin
Mariana Raykova
Mariana Raykova Google (United States)
Sanjam Garg
Sanjam Garg University of California, Berkeley
Stefan Dziembowski
Stefan Dziembowski University of Warsaw

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring your education options in Computer Science doesn’t stop at traditional bachelor’s degrees. Many students opt for advanced studies to deepen expertise or pivot careers. Pursuing an affordable graduate school program online can open doors to specialized IT roles and leadership positions—while helping to control tuition costs.

If you’re interested in leadership in tech-driven organizations, the best online doctorate in organizational leadership programs can offer the advanced skills needed to drive change and manage technology teams at the highest level.

For students who want to quickly build credentials and job-ready skills, earning an associate degree in 6 months online is an accessible pathway—ideal for those looking to enter the workforce sooner or gain foundational knowledge before transferring to a 4-year program.

Finally, educators and those aiming to advance within academia often pursue the cheapest online edd programs no gre, which offer specialized training in educational technology and policy—without the hurdle of standardized test requirements.

Best Scientists Citing Daniel Wichs

Trending Scientists