Jonathan Katz

Affiliations: 
Computer Science University of Maryland, College Park, College Park, MD 
Area:
Theoretical Computer Science,Security
Google:
"Jonathan Katz"
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Gordon SD, Katz J, Kumaresan R, et al. (2014) Authenticated broadcast with a partially compromised public-key infrastructure Information and Computation. 234: 17-25
Dachman-Soled D, Fleischhacker N, Katz J, et al. (2014) Feasibility and infeasibility of secure computation with malicious PUFs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8617: 405-420
Choi SG, Katz J, Schröder D, et al. (2014) (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8349: 638-662
Katz J. (2013) Review of Applied Information Security by David Basin, Patrick Schaller, and Michael Schläpfer Sigact News. 44: 38-40
Katz J, Vaikuntanathan V. (2013) Round-Optimal Password-Based Authenticated Key Exchange Journal of Cryptology. 26: 714-743
Katz J, Sahai A, Waters B. (2013) Predicate encryption supporting disjunctions, polynomial equations, and inner products Journal of Cryptology. 26: 191-224
Katz J. (2012) Review of efficient secure two-party protocols: techniques and constructions by Carmit Hazay and Yehuda Lindell Sigact News. 43: 21-23
Katz J, MacKenzie P, Taban G, et al. (2012) Two-server password-only authenticated key exchange Journal of Computer and System Sciences. 78: 651-669
Gordon SD, Katz J. (2012) Partial fairness in secure two-party computation Journal of Cryptology. 25: 14-40
Gordon SD, Hazay C, Katz J, et al. (2011) Complete fairness in secure two-party computation Journal of the Acm. 58
See more...