Jonathan Katz
Artificial Intelligence · 2001–2023
A researcher in the Science corpus: 29 papers; trusts 137 researchers and is trusted by 93 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 334 citations into it; #2,924 of 36,961 by trust here, #3,636 by citations
- Computational Theory and Mathematics — 160 citations into it; #423 of 12,489 by trust here, #622 by citations
- Information Systems — 105 citations into it; #2,993 of 9,233 by trust here, #2,122 by citations
- Computer Networks and Communications — 102 citations into it; #2,992 of 9,996 by trust here, #1,611 by citations
- Privacy & Security — 68 citations into it
- Computer Vision and Pattern Recognition — 61 citations into it; #5,656 of 21,973 by trust here, #7,900 by citations
- Electrical and Electronic Engineering — 23 citations into it; #12,801 of 16,595 by trust here, #8,829 by citations
- Atomic and Molecular Physics, and Optics — 17 citations into it
Whom Jonathan Katz trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Mihir Bellare
- Yehuda Lindell
- Dan Boneh
- Benny Pinkas
- Ran Canetti
- Oded Goldreich
- Brent Waters
- Vladimir Kolesnikov
- Silvio Micali
- Craig Gentry
Who trusts Jonathan Katz overall
- Brent Waters
- Allison Bishop
- Dan Boneh
- David E. Evans
- David Mandell Freeman
- Amit Sahai
- Adrià Gascón
- Thomas Schneider
- Eike Kiltz
- Andrej Bogdanov
Papers from Jonathan Katz's perspective
Ordered by how strongly the researchers Jonathan Katz trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- New Directions in Cryptography
- Probabilistic Encryption
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Protocols for secure computations
- Fair exchange with a semi-trusted third party (extended abstract)
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- Fairplay - Secure Two-Party Computation System
- How to share a secret
- A method for obtaining digital signatures and public-key cryptosystems
Their papers
- A Watermark for Large Language Models (2023) — 964 citations
- Chosen-Ciphertext Security from Identity-Based Encryption (2004) — 1,135 citations
- A Forward-Secure Public-Key Encryption Scheme (2003) — 951 citations
- Introduction to Modern Cryptography, Second Edition (2014) — 546 citations
- Coupled-Worlds Privacy: Exploiting Adversarial Uncertainty in Statistical Data Privacy (2013) — 100 citations
- Key-Insulated Public Key Cryptosystems (2002) — 412 citations
- ALITHEIA: Towards Practical Verifiable Graph Processing (2014) — 31 citations
- Global-Scale Secure Multiparty Computation (2017) — 224 citations
- Secure two-party computation in sublinear (amortized) time (2012) — 199 citations
- Faster Secure Two-Party Computation in the Single-Execution Setting (2017) — 51 citations
- Efficient Secure Computation with Garbled Circuits (2011) — 135 citations
- A pairwise key predistribution scheme for wireless sensor networks (2005) — 1,122 citations
- Signing a Linear Subspace: Signature Schemes for Network Coding (2009) — 362 citations
- Constant-Round Multi-party Private Set Union Using Reversed Laurent Series (2012) — 37 citations
- Faster Two-Party Computation Secure Against Malicious Adversaries in the Single-Execution Setting (2016) — 14 citations
- All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption (2016) — 526 citations
- Efficiently Enforcing Input Validity in Secure Two-party Computation (2016) — 25 citations
- Permacoin: Repurposing Bitcoin Work for Data Preservation (2014) — 300 citations
- Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? (2012) — 486 citations
- Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution (2012) — 116 citations