Daniel Wichs
(he/him/his)
Professor
Research interests
- Modern cryptography
- Information security
Education
- PhD in Computer Science, New York University
- MS in Computer Science, Stanford University
- BS in Mathematics, Stanford University
Biography
Daniel Wichs is a professor in the Khoury College of Computer Sciences at Northeastern University, based in Boston.
Wichs researches all aspects of modern cryptography, including its theoretical foundations and its applications to information security. His recent research relates to the cryptographic challenges involved in outsourcing data and computation to the cloud. In particular, this includes the construction of homomorphic encryption and signature schemes, which allow the cloud to compute on digitally encrypted and signed data while maintaining privacy and authenticity.
Prior to joining Northeastern, Wichs was a postdoctoral researcher at the IBM T.J. Watson Research Center from 2011 to 2013, where he was supported by the prestigious Josef Raviv Memorial Fellowship.
Recent publications
-
Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation
Citation: Fangqi Dong, Zihan Hao, Ethan Mook, Daniel Wichs. (2024). Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation EUROCRYPT (2), 190-218. https://doi.org/10.1007/978-3-031-58723-8_7 -
Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDM
Citation: Brent Waters, Daniel Wichs. (2023). Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDM CRYPTO (2), 674-693. https://doi.org/10.1007/978-3-031-38545-2_22 -
The Pseudorandom Oracle Model and Ideal Obfuscation
Citation: Aayush Jain, Huijia Lin, Ji Luo , Daniel Wichs. (2023). The Pseudorandom Oracle Model and Ideal Obfuscation CRYPTO (4), 233-262. https://doi.org/10.1007/978-3-031-38551-3_8 -
Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE
Citation: Wei-Kai Lin, Ethan Mook, Daniel Wichs. (2023). Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE STOC, 595-608. https://doi.org/10.1145/3564246.3585175 -
Boosting Batch Arguments and RAM Delegation
Citation: Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs. (2023). Boosting Batch Arguments and RAM Delegation STOC, 1545-1552. https://doi.org/10.1145/3564246.3585200 -
Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited
Citation: Yevgeniy Dodis, Willy Quach, Daniel Wichs. (2023). Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited EUROCRYPT (1), 86-116. https://doi.org/10.1007/978-3-031-30545-0_4 -
Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited
Citation: Yevgeniy Dodis, Willy Quach, Daniel Wichs. (2023). Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited EUROCRYPT (1), 86-116. https://doi.org/10.1007/978-3-031-30545-0_4 -
Nearly Optimal Property Preserving Hashing
Citation: Justin Holmgren, Minghao Liu , LaKyah Tyner, Daniel Wichs. (2022). Nearly Optimal Property Preserving Hashing CRYPTO (3), 473-502. https://doi.org/10.1007/978-3-031-15982-4_16 -
Limits on the Adaptive Security of Yao’s Garbling
Citation: Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Daniel Wichs. (2021). Limits on the Adaptive Security of Yao's Garbling CRYPTO (2), 486-515. https://doi.org/10.1007/978-3-030-84245-1_17 -
Targeted Lossy Functions and Applications
Citation: Willy Quach, Brent Waters, Daniel Wichs. (2021). Targeted Lossy Functions and Applications CRYPTO (4), 424-453. https://doi.org/10.1007/978-3-030-84259-8_15 -
Obfuscating Compute-and-Compare Programs under LWE
Citation: Daniel Wichs and Giorgos Zirdelis
Related News
Post Docs
Current PhD Students
Previous PhD Students
-
Willy Quach
-
Ariel Hamlin
-
Zahra Jafargholi
-
Giorgos Zirdelis