Jonathan Katz

Professor
3225 A.V. Williams Building
(301) 405-1226
Education: 
Ph.D. (with distinction) Columbia University
Special Awards/Honors: 
National Science Foundation (NSF) Career Award
Biography: 

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.

Publications

2007


Garay JA, Katz J, Koo C-Y, Ostrovsky R.  2007.  Round Complexity of Authenticated Broadcast with a Dishonest Majority. Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on.
:658-668.

Goh EJ, Jarecki S, Katz J, Wang N.  2007.  Efficient signature schemes with tight reductions to the Diffie-Hellman problems. Journal of Cryptology. 20(4):493-514.

2006


Dodis Y, Katz J, Reyzin L, Smith A.  2006.  Robust fuzzy extractors and authenticated key agreement from close secrets. Advances in Cryptology-CRYPTO 2006.
:232-250.

Katz J, Koo CY.  2006.  On expected constant-round protocols for Byzantine agreement. Advances in Cryptology-CRYPTO 2006.
:445-462.

Morselli R, Bhattacharjee B, Katz J, Marsh MA.  2006.  KeyChains: A Decentralized Public-Key Infrastructure. Technical Reports from UMIACS, UMIACS-TR-2006-12.

Koo C-Y, Bhandari V, Katz J, Vaidya NH.  2006.  Reliable broadcast in radio networks: the bounded collision case. Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing.
:258-264.

Gordon S, Katz J.  2006.  Rational secret sharing, revisited. Security and Cryptography for Networks.
:229-241.

2005


Katz J, Ostrovsky R, Rabin M.  2005.  Identity-based zero-knowledge. Security in Communication Networks.
:180-192.

Gennaro R, Gertner Y, Katz J, Trevisan L.  2005.  Bounds on the efficiency of generic cryptographic constructions. SIAM Journal on Computing. 35(1):217-217.

Katz J, MacKenzie P, Taban G, Gligor V.  2005.  Two-server password-only authenticated key exchange. Applied Cryptography and Network Security.
:175-206.

Horvitz O, Katz J.  2005.  Bounds on the efficiency of black-box commitment schemes. Automata, Languages and Programming.
:62-62.

Du W, Deng J, Han YS, Varshney PK, Katz J, Khalili A.  2005.  A pairwise key predistribution scheme for wireless sensor networks. ACM Trans. Inf. Syst. Secur.. 8(2):228-258.

Canetti R, Halevi S, Katz J, Lindell Y, MacKenzie P.  2005.  Universally composable password-based key exchange. Advances in Cryptology–Eurocrypt 2005.
:557-557.

Katz J, Shin J S.  2005.  Modeling insider attacks on group key-exchange protocols. Proceedings of the 12th ACM conference on Computer and communications security.
:180-189.

Boyen X, Dodis Y, Katz J, Ostrovsky R, Smith A.  2005.  Secure remote authentication using biometric data. Advances in Cryptology–EUROCRYPT 2005.
:147-163.

Canetti R, Halevi S, Katz J.  2005.  Adaptively-secure, non-interactive public-key encryption. Theory of Cryptography.
:150-168.

Haitner I, Horvitz O, Katz J, Koo CY, Morselli R, Shaltiel R.  2005.  Reducing complexity assumptions for statistically-hiding commitment. Advances in Cryptology–EUROCRYPT 2005.
:614-614.

Dodis Y, Katz J.  2005.  Chosen-ciphertext security of multiple encryption. Theory of Cryptography.
:188-209.

2004


Canetti R, Halevi S, Katz J.  2004.  Chosen-ciphertext security from identity-based encryption. Advances in Cryptology-Eurocrypt 2004.
:207-222.

Katz J.  2004.  Binary tree encryption: Constructions and applications. Information Security and Cryptology-ICISC 2003.
:1-11.

Jeong IR, Katz J, Lee DH.  2004.  One-round protocols for two-party authenticated key exchange. Applied Cryptography and Network Security.
:220-232.

Canetti R, Halevi S, Katz J.  2004.  Adaptively-Secure, Non-Interactive Public-Key Encryption. Model reduction methods for vector autoregressive processes.
:150-150.

Morselli R, Bhattacharjee B, Katz J, Keleher P.  2004.  Trust-preserving set operations. INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies. 4:2231-2241vol.4-2231-2241vol.4.

Dodis Y, Franklin M, Katz J, Miyaji A, Yung M.  2004.  A generic construction for intrusion-resilient public-key encryption. Topics in Cryptology–CT-RSA 2004.
:1997-1997.

Morselli R, Katz J, Bhattacharjee B.  2004.  A game-theoretic framework for analyzing trust-inference protocols. Workshop on Economics of Peer-to-Peer Systems.

Katz J, Ostrovsky R.  2004.  Round-optimal secure two-party computation. Advances in Cryptology–CRYPTO 2004.
:3-34.

Katz J.  2004.  Secure routing in ad hoc networks. Workshop on Security of ad hoc and Sensor Networks: Proceedings of the 2 nd ACM workshop on Security of ad hoc and sensor networks.

2003


Katz J.  2003.  Efficient and non-malleable proofs of plaintext knowledge and applications. Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques.
:211-228.

Katz J, Ostrovsky R, Smith A.  2003.  Round efficiency of multi-party computation with a dishonest majority. Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques.
:578-595.

Canetti R, Halevi S, Katz J.  2003.  A forward-secure public-key encryption scheme. Advances in Cryptology—Eurocrypt 2003.
:646-646.

Katz J, Ostrovsky R, Yung M.  2003.  Forward secrecy in password-only key exchange protocols. Proceedings of the 3rd international conference on Security in communication networks.
:29-44.

Khalili A, Katz J, Arbaugh WA.  2003.  Toward secure key distribution in truly ad-hoc networks. Applications and the Internet Workshops, 2003. Proceedings. 2003 Symposium on.
:342-346.

Gennaro R, Gertner Y, Katz J.  2003.  Lower bounds on the efficiency of encryption and digital signature schemes. Proceedings of the thirty-fifth annual ACM symposium on Theory of computing.
:417-425.

Katz J, Wang N.  2003.  Efficiency improvements for signature schemes with tight security reductions. Proceedings of the 10th ACM conference on Computer and communications security.
:155-164.

Dodis Y, Franklin M, Katz J, Miyaji A, Yung M.  2003.  Intrusion-resilient public-key encryption. Topics in Cryptology—CT-RSA 2003.
:19-32.

Katz J, Yung M.  2003.  Scalable protocols for authenticated group key exchange. Advances in Cryptology-CRYPTO 2003.
:110-125.

2002


Katz J, Yung M.  2002.  Threshold cryptosystems based on factoring. Advances in Cryptology—ASIACRYPT 2002.
:139-147.

Dodis Y, Katz J, Xu S, Yung M.  2002.  Key-insulated public key cryptosystems. Advances in Cryptology—Eurocrypt 2002.
:65-82.

Jallad K, Katz J, Schneier B.  2002.  Implementation of chosen-ciphertext attacks against PGP and GnuPG. Information Security.
:90-101.

Buonanno E, Katz J, Yung M.  2002.  Incremental unforgeable encryption. Fast Software Encryption.
:317-325.

Dodis Y, Katz J, Xu S, Yung M.  2002.  Strong key-insulated signature schemes. Public Key Cryptography—PKC 2003.
:130-144.

2001


Katz J, Myers S, Ostrovsky R.  2001.  Cryptographic counters and applications to electronic voting. Advances in Cryptology—Eurocrypt 2001.
:78-92.

Katz J, Ostrovsky R, Yung M.  2001.  Efficient password-authenticated key exchange using human-memorable passwords. Advances in Cryptology—EUROCRYPT 2001.
:475-494.

Di Crescenzo G, Katz J, Ostrovsky R, Smith A.  2001.  Efficient and Non-interactive Non-malleable Commitment. Advances in Cryptology — EUROCRYPT 2001Advances in Cryptology — EUROCRYPT 2001. 2045:40-59.

2000


Katz J, Trevisan L.  2000.  On the efficiency of local decoding procedures for error-correcting codes. Proceedings of the thirty-second annual ACM symposium on Theory of computing.
:80-86.

Katz J, Yung M.  2000.  Complete characterization of security notions for probabilistic private-key encryption. Proceedings of the thirty-second annual ACM symposium on Theory of computing.
:245-254.

1989


Katz J.  1989.  Rational Common Ground in the Sociology of Knowledge. Philosophy of the social sciences. 19(3):257-271.

Pages