Jonathan Katz

MaRDI QIDQ1429028zbMATH OpenDBLPWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Rational protocol design: cryptography against incentive-driven adversaries	2025-05-20	Paper
Coupled-worlds privacy: exploiting adversarial uncertainty in statistical data privacy	2025-05-20	Paper
Overcoming the hole in the bucket: public-key cryptography resilient to continual memory leakage	2025-04-29	Paper
Latke: a framework for constructing identity-binding PAKEs	2024-12-04	Paper
State machine replication under changing network conditions Advances in Cryptology – ASIACRYPT 2022	2023-08-25	Paper
An analysis of the algebraic group model Advances in Cryptology – ASIACRYPT 2022	2023-08-21	Paper
Subset predicate encryption and its applications Cryptology and Network Security	2023-08-02	Paper
Boosting the Security of Blind Signature Schemes Lecture Notes in Computer Science	2023-05-26	Paper
Algebraic adversaries in the universal composability framework Lecture Notes in Computer Science	2023-05-12	Paper
\textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions Lecture Notes in Computer Science	2023-05-12	Paper
Efficient 3-party distributed ORAM	2022-12-16	Paper
Universally composable relaxed password authenticated key exchange	2022-11-09	Paper
Spreading the privacy blanket: differentially oblivious shuffling for differential privacy	2022-11-09	Paper
Efficient, reusable fuzzy extractors from LWE Lecture Notes in Computer Science	2022-06-15	Paper
On the security of time-lock puzzles and timed commitments	2022-03-23	Paper
Asynchronous Byzantine agreement with subquadratic communication	2021-12-01	Paper
Introduction to Modern Cryptography	2020-11-16	Paper
Optimizing authenticated garbling for faster secure two-party computation	2020-06-30	Paper
Synchronous consensus with optimal asynchronous fallback guarantees	2020-04-30	Paper
Feasibility and infeasibility of secure computation with malicious PUFs Journal of Cryptology	2020-04-28	Paper
Constant-round group key exchange from the ring-LWE assumption	2020-02-25	Paper
Covert security with public verifiability: faster, leaner, and simpler	2020-02-04	Paper
(Efficient) universally composable oblivious transfer using a minimal number of stateless tokens Journal of Cryptology	2019-06-20	Paper
More is less: perfectly secure oblivious algorithms in the multi-server setting (available as arXiv preprint)	2019-01-23	Paper
Simple and efficient two-server ORAM	2019-01-23	Paper
Provable security of (tweakable) block ciphers based on substitution-permutation networks	2018-09-12	Paper
Faster secure two-party computation in the single-execution setting Lecture Notes in Computer Science	2017-06-23	Paper
Fixing cracks in the concrete: random oracles with auxiliary input, revisited Lecture Notes in Computer Science	2017-06-13	Paper
Selective-Opening Security in the Presence of Randomness Failures Advances in Cryptology – ASIACRYPT 2016	2017-01-06	Paper
A unified approach to idealized model separations via indistinguishability obfuscation Lecture Notes in Computer Science	2016-10-21	Paper
10-round Feistel is indifferentiable from an ideal cipher Advances in Cryptology – EUROCRYPT 2016	2016-07-15	Paper
How fair is your protocol? A utility-based approach to protocol optimality Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing	2016-03-23	Paper
Hash functions from defective ideal ciphers Lecture Notes in Computer Science	2016-03-02	Paper
Efficient and secure authenticated key exchange using weak passwords Journal of the ACM	2015-12-07	Paper
Adaptively secure broadcast, revisited Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing	2015-09-11	Paper
Distributing the setup in universally composable multi-party computation Proceedings of the 2014 ACM symposium on Principles of distributed computing	2015-09-03	Paper
Adaptively secure, universally composable, multiparty computation in constant rounds Theory of Cryptography	2015-07-06	Paper
Multi-client verifiable computation with stronger security guarantees Theory of Cryptography	2015-07-06	Paper
Reliable broadcast in radio networks Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing	2015-03-10	Paper
Introduction to modern cryptography	2014-10-06	Paper
Complete characterization of security notions for probabilistic private-key encryption Proceedings of the thirty-second annual ACM symposium on Theory of computing	2014-09-26	Paper
On the efficiency of local decoding procedures for error-correcting codes Proceedings of the thirty-second annual ACM symposium on Theory of computing	2014-09-26	Paper
Amortizing Garbled Circuits Advances in Cryptology – CRYPTO 2014	2014-08-07	Paper
Efficient three-party computation from cut-and-choose Advances in Cryptology – CRYPTO 2014	2014-08-07	Paper
Feasibility and infeasibility of secure computation with malicious PUFs Advances in Cryptology – CRYPTO 2014	2014-08-07	Paper
Multi-input functional encryption Advances in Cryptology – EUROCRYPT 2014	2014-05-27	Paper
Verifiable oblivious storage Public-Key Cryptography – PKC 2014	2014-03-25	Paper
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens Theory of Cryptography	2014-02-18	Paper
Complete fairness in secure two-party computation Journal of the ACM	2014-02-17	Paper
Authenticated broadcast with a partially compromised public-key infrastructure Information and Computation	2014-02-11	Paper
One-round multi-party communication complexity of distinguishing sums Theoretical Computer Science	2014-01-10	Paper
Functional encryption from (small) hardware tokens Advances in Cryptology - ASIACRYPT 2013	2013-12-10	Paper
Round-optimal password-based authenticated key exchange Journal of Cryptology	2013-11-15	Paper
Efficient secure two-party computation using symmetric cut-and-choose Advances in Cryptology – CRYPTO 2013	2013-09-17	Paper
Predicate encryption supporting disjunctions, polynomial equations, and inner products Journal of Cryptology	2013-06-27	Paper
Feasibility and infeasibility of adaptively secure fully homomorphic encryption Public-Key Cryptography – PKC 2013	2013-04-19	Paper
Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS Public-Key Cryptography – PKC 2013	2013-04-19	Paper
Feasibility and completeness of cryptographic tasks in the quantum world Theory of Cryptography	2013-03-18	Paper
Universally composable synchronous computation Theory of Cryptography	2013-03-18	Paper
Multi-client non-interactive verifiable computation Theory of Cryptography	2013-03-18	Paper
Byzantine agreement with a rational adversary Automata, Languages, and Programming	2012-11-01	Paper
Collusion-preserving computation Lecture Notes in Computer Science	2012-09-25	Paper
Constant-Round Multi-party Private Set Union Using Reversed Laurent Series Public Key Cryptography – PKC 2012	2012-07-20	Paper
Fair computation with rational players Advances in Cryptology – EUROCRYPT 2012	2012-06-29	Paper
On the security of the ``Free-XOR'' technique Theory of Cryptography	2012-06-15	Paper
Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces Lecture Notes in Computer Science	2012-06-08	Paper
Partial fairness in secure two-party computation Journal of Cryptology	2012-05-23	Paper
Which languages have 4-round zero-knowledge proofs? Journal of Cryptology	2012-05-23	Paper
Two-server password-only authenticated key exchange Journal of Computer and System Sciences	2012-05-11	Paper
Constant-round private function evaluation with linear complexity Lecture Notes in Computer Science	2011-12-02	Paper
Limits of computational differential privacy in the client/server setting Theory of Cryptography	2011-05-19	Paper
Round-optimal password-based authenticated key exchange Theory of Cryptography	2011-05-19	Paper
Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions Theory of Cryptography	2011-05-19	Paper
Impossibility of blind signatures from one-way permutations Theory of Cryptography	2011-05-19	Paper
On achieving the ``best of both worlds'' in secure multiparty computation SIAM Journal on Computing	2011-05-17	Paper
A Group Signature Scheme from Lattice Assumptions Advances in Cryptology - ASIACRYPT 2010	2010-12-07	Paper
Parallel and concurrent security of the HB and \(HB^{+}\) protocols Journal of Cryptology	2010-09-21	Paper
Lower bounds on the efficiency of encryption and digital signature schemes Proceedings of the thirty-fifth annual ACM symposium on Theory of computing	2010-08-16	Paper
Partial fairness in secure two-party computation Advances in Cryptology – EUROCRYPT 2010	2010-06-01	Paper
Secure network coding over the integers Public Key Cryptography – PKC 2010	2010-05-28	Paper
Bounds on the efficiency of black-box commitment schemes Theoretical Computer Science	2010-03-10	Paper
Efficient rational secret sharing in standard communication networks Theory of Cryptography	2010-02-24	Paper
Signature schemes with bounded leakage resilience Advances in Cryptology – ASIACRYPT 2009	2009-12-15	Paper
Smooth projective hashing and password-based authenticated key exchange from lattices Advances in Cryptology – ASIACRYPT 2009	2009-12-15	Paper
Proofs of storage from homomorphic identification protocols Advances in Cryptology – ASIACRYPT 2009	2009-12-15	Paper
On black-box constructions of predicate encryption from trapdoor permutations Advances in Cryptology – ASIACRYPT 2009	2009-12-15	Paper
Collusion-Free Multiparty Computation in the Mediated Model Advances in Cryptology - CRYPTO 2009	2009-10-20	Paper
Improving the round complexity of VSS in point-to-point networks Information and Computation	2009-07-15	Paper
Ring signatures: Stronger definitions, and constructions without random oracles Journal of Cryptology	2009-06-30	Paper
Reducing complexity assumptions for statistically-hiding commitment Journal of Cryptology	2009-06-30	Paper
Handling expected polynomial-time strategies in simulation-based security proofs Journal of Cryptology	2009-06-08	Paper
Topics in Cryptology – CT-RSA 2004 Lecture Notes in Computer Science	2009-05-07	Paper
Signing a Linear Subspace: Signature Schemes for Network Coding Public Key Cryptography – PKC 2009	2009-03-24	Paper
On expected constant-round protocols for Byzantine agreement Journal of Computer and System Sciences	2009-03-11	Paper
Universally-Composable Two-Party Computation in Two Rounds Advances in Cryptology - CRYPTO 2007	2009-03-10	Paper
Complete Fairness in Multi-party Computation without an Honest Majority Theory of Cryptography	2009-03-03	Paper
Digital Signatures	2009-02-19	Paper
scientific article; zbMATH DE number 5485432 (Why is no real title available?)	2009-01-05	Paper
Complete fairness in secure two-party computation	2009-01-05	Paper
Rational Secret Sharing, Revisited Lecture Notes in Computer Science	2008-11-27	Paper
How to Encrypt with a Malicious Random Number Generator Fast Software Encryption	2008-09-18	Paper
Improving the Round Complexity of VSS in Point-to-Point Networks Automata, Languages and Programming	2008-08-19	Paper
Reducing Complexity Assumptions for Statistically-Hiding Commitment Lecture Notes in Computer Science	2008-05-06	Paper
Universally Composable Password-Based Key Exchange Lecture Notes in Computer Science	2008-05-06	Paper
Aggregate Message Authentication Codes Topics in Cryptology – CT-RSA 2008	2008-04-24	Paper
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products Advances in Cryptology – EUROCRYPT 2008	2008-04-15	Paper
Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise Cryptography and Coding	2008-03-07	Paper
Bridging Game Theory and Cryptography: Recent Results and Future Directions Theory of Cryptography	2008-03-05	Paper
Which Languages Have 4-Round Zero-Knowledge Proofs? Theory of Cryptography	2008-03-05	Paper
Universally Composable Multi-party Computation with an Unreliable Common Reference String Theory of Cryptography	2008-03-05	Paper
Efficient signature schemes with tight reductions to the Diffie-Hellman problems Journal of Cryptology	2007-12-06	Paper
Round-Efficient Secure Computation in Point-to-Point Networks Advances in Cryptology - EUROCRYPT 2007	2007-11-29	Paper
Universally Composable Multi-party Computation Using Tamper-Proof Hardware Advances in Cryptology - EUROCRYPT 2007	2007-11-29	Paper
Advances in Cryptology - CRYPTO 2003 Lecture Notes in Computer Science	2007-11-28	Paper
Chosen‐Ciphertext Security from Identity‐Based Encryption SIAM Journal on Computing	2007-10-22	Paper
Introduction to modern cryptography.	2007-10-11	Paper
Advances in Cryptology - EUROCRYPT 2004 Lecture Notes in Computer Science	2007-09-25	Paper
Two-Server Password-Only Authenticated Key Exchange Applied Cryptography and Network Security	2007-09-24	Paper
Parallel and Concurrent Security of the HB and HB +  Protocols Advances in Cryptology - EUROCRYPT 2006	2007-09-24	Paper
On Expected Constant-Round Protocols for Byzantine Agreement Lecture Notes in Computer Science	2007-09-04	Paper
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions Theory of Cryptography	2007-08-30	Paper
A forward-secure public-key encryption scheme Journal of Cryptology	2007-08-20	Paper
Scalable protocols for authenticated group key exchange Journal of Cryptology	2007-05-24	Paper
Theory of Cryptography Lecture Notes in Computer Science	2007-02-12	Paper
Security in Communication Networks Lecture Notes in Computer Science	2006-10-10	Paper
Characterization of security notions for probabilistic private-key encryption Journal of Cryptology	2006-08-14	Paper
Automata, Languages and Programming Lecture Notes in Computer Science	2006-01-10	Paper
Information Security and Cryptology - ICISC 2003 Lecture Notes in Computer Science	2005-12-27	Paper
Topics in Cryptology – CT-RSA 2005 Lecture Notes in Computer Science	2005-12-08	Paper
Theory of Cryptography Lecture Notes in Computer Science	2005-12-07	Paper
Theory of Cryptography Lecture Notes in Computer Science	2005-12-07	Paper
Theory of Cryptography Lecture Notes in Computer Science	2005-12-07	Paper
Bounds on the Efficiency of Generic Cryptographic Constructions SIAM Journal on Computing	2005-10-28	Paper
Advances in Cryptology – CRYPTO 2004 Lecture Notes in Computer Science	2005-08-23	Paper
Incremental Unforgeable Encryption Fast Software Encryption	2004-08-12	Paper
scientific article; zbMATH DE number 2086699 (Why is no real title available?)	2004-08-11	Paper
The mathematics and statistics of voting power Statistical Science	2004-03-29	Paper
scientific article; zbMATH DE number 2009960 (Why is no real title available?)	2003-11-26	Paper
scientific article; zbMATH DE number 2009957 (Why is no real title available?)	2003-11-26	Paper
scientific article; zbMATH DE number 1962140 (Why is no real title available?)	2003-08-10	Paper
Poststratification Without Population Level Information on the Poststratifying Variable With Application to Political Polling Journal of the American Statistical Association	2003-08-07	Paper
Strong Key-Insulated Signature Schemes Public Key Cryptography — PKC 2003	2003-07-27	Paper
scientific article; zbMATH DE number 1952887 (Why is no real title available?)	2003-07-24	Paper
Threshold Cryptosystems Based on Factoring Lecture Notes in Computer Science	2003-07-16	Paper
scientific article; zbMATH DE number 1941231 (Why is no real title available?)	2003-06-29	Paper
scientific article; zbMATH DE number 1808213 (Why is no real title available?)	2002-09-30	Paper
scientific article; zbMATH DE number 1759277 (Why is no real title available?)	2002-06-25	Paper
scientific article; zbMATH DE number 1722670 (Why is no real title available?)	2002-03-21	Paper
scientific article; zbMATH DE number 1722672 (Why is no real title available?)	2002-03-21	Paper

Research outcomes over time

This page was built for person: Jonathan Katz