Jonathan Katz is a professor in the Department of Computer Science and director of the Maryland Cybersecurity Center (MC2).
His research interests lie broadly in the areas of cryptography, computer and network security, and complexity theory, with his most recent work focusing on secure multi-party computation, database privacy, and the science of cybersecurity. He has co-authored the textbook, "Introduction to Modern Cryptography" (CRC Press, 2007), and a monograph on digital signature schemes (Springer, 2010).
Katz received undergraduate degrees in chemistry and mathematics from MIT in 1996, and a doctorate in computer science from Columbia University in 2002. He has held visiting appointments at UCLA, the École normale supérieure in Paris, France, and IBM in Hawthorne, NY. He has been awarded the National Science Foundation (NSF) CAREER Award, given to outstanding junior faculty who exemplify the role of teacher-scholars so they can further their research in their areas of expertise.
2012. Two-server password-only authenticated key exchange. Journal of Computer and System Sciences. 78(2):651-669.
2012. Review of efficient secure two-party protocols: techniques and constructions by Carmit Hazay and Yehuda Lindell. SIGACT News. 43(1):21-23.
2012. Which Languages Have 4-Round Zero-Knowledge Proofs? Journal of cryptology. 25(1):41-56.
2012. Secure multi-party computation of boolean circuits with applications to privacy in on-line marketplaces. Topics in Cryptology–CT-RSA 2012. :416-432.
2012. Quid Pro Quo-tocols: Strengthening Semi-Honest Protocols with Dual Execution. IEEE Symposium on Security and Privacy.
2011. Efficient Secure Computation with Garbled Circuits. Information Systems Security. :28-48.
2011. Impossibility of blind signatures from one-way permutations. Theory of Cryptography. :615-629.
2011. Efficient privacy-preserving biometric identification. Network and Distributed System Security Symposium.
2011. Round-optimal password-based authenticated key exchange. Theory of Cryptography. :293-310.
2011. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? 19th Network and Distributed Security Symposium.
2011. Constant-Round Private Function Evaluation with Linear Complexity. Advances in Cryptology–ASIACRYPT 2011. :556-571.
2011. Limits on the power of zero-knowledge proofs in cryptographic constructions. Theory of Cryptography. :559-578.
2011. Faster secure two-party computation using garbled circuits. USENIX Security Symposium.
2011. Complete Fairness in Secure Two-Party Computation. Journal of the ACM. 58(6):24:1–24:37-24:1–24:37.
2011. Adaptively secure broadcast, revisited. Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing.
2011. On Achieving the" Best of Both Worlds" in Secure Multiparty Computation. SIAM Journal on Computing. 40(1):122-122.
2011. Limits of computational differential privacy in the client/server setting. Theory of Cryptography. :417-431.
2010. Authenticated broadcast with a partially compromised public-key infrastructure. Stabilization, Safety, and Security of Distributed Systems. :144-158.
2010. Digital Signatures. :192.
2010. Bounds on the efficiency of black-box commitment schemes. Theoretical Computer Science. 411(10):1251-1260.
2010. A New Framework for Password-Based Authenticated Key Exchange. ACM CCCS 2010.
2010. Parallel and concurrent security of the HB and HB+ protocols. Journal of cryptology. 23(3):402-421.
2010. Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage. Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on. :501-510.
2010. Secure network coding over the integers. Public Key Cryptography–PKC 2010. :142-160.
2010. A group signature scheme from lattice assumptions. Advances in Cryptology-ASIACRYPT 2010. :395-412.
2010. A new framework for efficient password-based authenticated key exchange. Proceedings of the 17th ACM conference on Computer and communications security. :516-525.
2010. Partial fairness in secure two-party computation. Advances in Cryptology–EUROCRYPT 2010. :157-176.
2010. Public-Key Cryptography. Handbook of Information and Communication Security. :21-34.
2010. Secure text processing with applications to private DNA matching. Proceedings of the 17th ACM conference on Computer and communications security. :485-492.
2010. Efficient rational secret sharing in standard communication networks. Theory of Cryptography. :419-436.
2009. Proofs of storage from homomorphic identification protocols. Advances in Cryptology–ASIACRYPT 2009. :319-333.
2009. Signature schemes with bounded leakage resilience. Advances in Cryptology–ASIACRYPT 2009. :703-720.
2009. On expected constant-round protocols for Byzantine agreement. Journal of Computer and System Sciences. 75(2):91-112.
2009. Smooth projective hashing and password-based authenticated key exchange from lattices. Advances in Cryptology–ASIACRYPT 2009. :636-652.
2009. On black-box constructions of predicate encryption from trapdoor permutations. Advances in Cryptology–ASIACRYPT 2009. :197-213.
2009. Reducing complexity assumptions for statistically-hiding commitment. Journal of cryptology. 22(3):283-310.
2009. Ring signatures: Stronger definitions, and constructions without random oracles. Journal of Cryptology. 22(1):114-138.
2009. Signing a linear subspace: Signature schemes for network coding. Public Key Cryptography–PKC 2009. :68-87.
2009. Attacking cryptographic schemes based on "perturbation polynomials". Proceedings of the 16th ACM conference on Computer and communications security. :1-10.
2009. Composability and on-line deniability of authentication. Theory of Cryptography. :146-162.
2009. Complete fairness in multi-party computation without an honest majority. Theory of Cryptography. :19-35.
2009. Collusion-free multiparty computation in the mediated model. Advances in Cryptology-CRYPTO 2009. :524-540.
2009. Improving the round complexity of VSS in point-to-point networks. Information and Computation. 207(8):889-899.
2009. Efficient and secure authenticated key exchange using weak passwords. Journal of the ACM (JACM). 57(1):3:1–3:39-3:1–3:39.
2008. Bridging game theory and cryptography: recent results and future directions. Proceedings of the 5th conference on Theory of cryptography. :251-272.
2008. Which languages have 4-round zero-knowledge proofs? Theory of Cryptography. :73-88.
2008. Predicate encryption supporting disjunctions, polynomial equations, and inner products. Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology. :146-162.
2008. Digital Signatures.
2008. Improving the round complexity of vss in point-to-point networks. Automata, Languages and Programming. :499-510.
2008. Aggregate message authentication codes. Topics in Cryptology–CT-RSA 2008. :155-169.
2008. How to encrypt with a malicious random number generator. Fast Software Encryption. :303-315.
2008. Handling expected polynomial-time strategies in simulation-based security proofs. Journal of Cryptology. 21(3):303-349.
2008. Universally composable multi-party computation with an unreliable common reference string. Theory of Cryptography. :142-154.
2007. Round-efficient secure computation in point-to-point networks. Advances in Cryptology-EUROCRYPT 2007. :311-328.
2007. Exploiting approximate transitivity of trust. Broadband Communications, Networks and Systems, 2007. BROADNETS 2007. Fourth International Conference on. :515-524.
2007. On achieving the "best of both worlds" in secure multiparty computation. Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. :11-20.
2007. Efficient cryptographic protocols based on the hardness of learning parity with noise. Proceedings of the 11th IMA international conference on Cryptography and coding. :1-15.
2007. A forward-secure public-key encryption scheme. Journal of Cryptology. 20(3):265-294.
2007. Round Complexity of Authenticated Broadcast with a Dishonest Majority. Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on. :658-668.
2007. Efficient signature schemes with tight reductions to the Diffie-Hellman problems. Journal of Cryptology. 20(4):493-514.
2007. Chosen-ciphertext security from identity-based encryption. SIAM Journal on Computing. 36(5):1301-1328.
2007. Scalable protocols for authenticated group key exchange. Journal of Cryptology. 20(1):85-113.
2007. Universally-composable two-party computation in two rounds. Proceedings of the 27th annual international cryptology conference on Advances in cryptology. :111-129.