Jonathan Katz

jonathan-katz's picture
Professor
jkatz@cs.umd.edu
5226 Iribe
(301) 405-1226
Website

Jonathan Katz is a professor in the Department of Computer Science and was the director of the Maryland Cybersecurity Center from 2013 to 2019.  An expert in cryptography and computer security, Katz has published more than 100 scientific articles and two books, including a widely used undergraduate textbook on cryptography. Among other things, he is interested in post-quantum cryptography and provable security against quantum algorithms. Katz holds undergraduate degrees in mathematics and chemistry from MIT, did graduate work in physical chemistry at Columbia University, and received a doctoral degree in computer science from Columbia University. Jonathan Katz was a professor and Eminent Scholar in Cybersecurity in the Department of Computer Science of the Volgenau School of Engineering at George Mason University from 2019 to 2020.  

Publications

2024

J. Katz and Sela, B., “A Quantum "Lifting Theorem" for Constructions of Pseudorandom Generators from Random Oracles”, 2024.

2023

J. Kirchenbauer, Geiping, J., Wen, Y., Katz, J., Miers, I., and Goldstein, T., “A Watermark for Large Language Models”, 2023.

2022

G. Alagic, Bai, C., Katz, J., Majenz, C., and Struck, P., “Post-Quantum Security of the (Tweakable) FX Construction, and Applications”, 2022.
G. Alagic, Bai, C., Katz, J., and Majenz, C., “Post-Quantum Security of the Even-Mansour Cipher”, Eurocrypt, 2022.

2021

M. Barbosa, Barthe, G., Fan, X., Grégoire, B., Hung, S. - H., Katz, J., Strub, P. - Y., Wu, X., and Zhou, L., “EasyPQC: Verifying Post-Quantum Cryptography”, ACM CCS 2021, 2021.
P. Lazos, Marmolejo-Cossío, F. J., Zhou, X., and Katz, J., “RPPLNS: Pay-per-last-N-shares with a Randomised Twist”, 2021.

2019

F. J. Marmolejo-Cossío, Brigham, E., Sela, B., and Katz, J., “Competing (Semi)-Selfish Miners in Bitcoin”, 2019.
N. Gupta, Katz, J., and Chopra, N., “Statistical Privacy in Distributed Average Consensus on Bounded Real Inputs”, 2019.

2018

N. Gupta, Katz, J., and Chopra, N., “Information-Theoretic Privacy For Distributed Average Consensus: Bounded Integral Inputs”, 2018.
H. Chan, Katz, J., Nayak, K., Polychroniadou, A., and Shi, E., “More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting”, 2018.
N. Gupta, Katz, J., and Chopra, N., “Information-Theoretic Privacy in Distributed Average Consensus”, 2018.