![]() | ![]() |
| 2012 | ||
|---|---|---|
| 174 | Seung Geol Choi, Kyung-Wook Hwang, Jonathan Katz, Tal Malkin, Dan Rubenstein: Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces. CT-RSA 2012: 416-432 | |
| 173 | Adam Groce, Jonathan Katz: Fair Computation with Rational Players. EUROCRYPT 2012: 81-98 | |
| 172 | Jae Hong Seo, Jung Hee Cheon, Jonathan Katz: Constant-Round Multi-party Private Set Union Using Reversed Laurent Series. Public Key Cryptography 2012: 398-412 | |
| 171 | Seung Geol Choi, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou: On the Security of the "Free-XOR" Technique. TCC 2012: 39-53 | |
| 170 | Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Jonathan Katz, Koyel Mukherjee: A Game-Theoretic Model Motivated by the DARPA Network Challenge CoRR abs/1204.6552: (2012) | |
| 169 | Jonathan Katz, Philip D. MacKenzie, Gelareh Taban, Virgil D. Gligor: Two-server password-only authenticated key exchange. J. Comput. Syst. Sci. 78(2): 651-669 (2012) | |
| 168 | S. Dov Gordon, Jonathan Katz: Partial Fairness in Secure Two-Party Computation. J. Cryptology 25(1): 14-40 (2012) | |
| 167 | Jonathan Katz: Which Languages Have 4-Round Zero-Knowledge Proofs? J. Cryptology 25(1): 41-56 (2012) | |
| 166 | Jonathan Katz: Review of efficient secure two-party protocols: techniques and constructions by Carmit Hazay and Yehuda Lindell. SIGACT News 43(1): 21-23 (2012) | |
| 2011 | ||
| 165 | John S. Baras, Jonathan Katz, Eitan Altman: Decision and Game Theory for Security - Second International Conference, GameSec 2011, College Park, MD, Maryland, USA, November 14-15, 2011. Proceedings Springer 2011 | |
| 164 | Jonathan Katz, Lior Malka: Constant-Round Private Function Evaluation with Linear Complexity. ASIACRYPT 2011: 556-571 | |
| 163 | Yan Huang, Chih-Hao Shen, David Evans, Jonathan Katz, Abhi Shelat: Efficient Secure Computation with Garbled Circuits. ICISS 2011: 28-48 | |
| 162 | Yan Huang, Lior Malka, David Evans, Jonathan Katz: Efficient Privacy-Preserving Biometric Identification. NDSS 2011 | |
| 161 | Juan A. Garay, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou: Adaptively secure broadcast, revisited. PODC 2011: 179-186 | |
| 160 | Jonathan Katz, Vinod Vaikuntanathan: Round-Optimal Password-Based Authenticated Key Exchange. TCC 2011: 293-310 | |
| 159 | Adam Groce, Jonathan Katz, Arkady Yerukhimovich: Limits of Computational Differential Privacy in the Client/Server Setting. TCC 2011: 417-431 | |
| 158 | Zvika Brakerski, Jonathan Katz, Gil Segev, Arkady Yerukhimovich: Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions. TCC 2011: 559-578 | |
| 157 | Jonathan Katz, Dominique Schröder, Arkady Yerukhimovich: Impossibility of Blind Signatures from One-Way Permutations. TCC 2011: 615-629 | |
| 156 | Yan Huang, David Evans, Jonathan Katz, Lior Malka: Faster Secure Two-Party Computation Using Garbled Circuits. USENIX Security Symposium 2011 | |
| 155 | Seung Geol Choi, Kyung-Wook Hwang, Jonathan Katz, Tal Malkin, Dan Rubenstein: Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces. IACR Cryptology ePrint Archive 2011: 257 (2011) | |
| 154 | Jonathan Katz, Ueli Maurer, Björn Tackmann, Vassilis Zikas: Universally Composable Synchronous Computation. IACR Cryptology ePrint Archive 2011: 310 (2011) | |
| 153 | Adam Groce, Jonathan Katz: Fair Computation with Rational Players. IACR Cryptology ePrint Archive 2011: 396 (2011) | |
| 152 | Joël Alwen, Jonathan Katz, Ueli Maurer, Vassilis Zikas: Collusion-Preserving Computation. IACR Cryptology ePrint Archive 2011: 433 (2011) | |
| 151 | S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov, Tal Malkin, Mariana Raykova, Yevgeniy Vahlis: Secure Computation with Sublinear Amortized Work. IACR Cryptology ePrint Archive 2011: 482 (2011) | |
| 150 | Seung Geol Choi, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou: On the Security of the Free-XOR Technique. IACR Cryptology ePrint Archive 2011: 510 (2011) | |
| 149 | S. Dov Gordon, Jonathan Katz, Vinod Vaikuntanathan: A Group Signature Scheme from Lattice Assumptions. IACR Cryptology ePrint Archive 2011: 60 (2011) | |
| 148 | Seung Geol Choi, Jonathan Katz, Dominique Schröder, Arkady Yerukhimovich, Hong-Sheng Zhou: (Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens. IACR Cryptology ePrint Archive 2011: 689 (2011) | |
| 147 | S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell: Complete Fairness in Secure Two-Party Computation. J. ACM 58(6): 24 (2011) | |
| 146 | Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. SIAM J. Comput. 40(1): 122-141 (2011) | |
| 2010 | ||
| 145 | Jonathan Katz, Lior Malka: Secure text processing with applications to private DNA matching. ACM Conference on Computer and Communications Security 2010: 485-492 | |
| 144 | Adam Groce, Jonathan Katz: A new framework for efficient password-based authenticated key exchange. ACM Conference on Computer and Communications Security 2010: 516-525 | |
| 143 | S. Dov Gordon, Jonathan Katz, Vinod Vaikuntanathan: A Group Signature Scheme from Lattice Assumptions. ASIACRYPT 2010: 395-412 | |
| 142 | S. Dov Gordon, Jonathan Katz: Partial Fairness in Secure Two-Party Computation. EUROCRYPT 2010: 157-176 | |
| 141 | Zvika Brakerski, Yael Tauman Kalai, Jonathan Katz, Vinod Vaikuntanathan: Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage. FOCS 2010: 501-510 | |
| 140 | Rosario Gennaro, Jonathan Katz, Hugo Krawczyk, Tal Rabin: Secure Network Coding over the Integers. Public Key Cryptography 2010: 142-160 | |
| 139 | S. Dov Gordon, Jonathan Katz, Ranjit Kumaresan, Arkady Yerukhimovich: Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure. SSS 2010: 144-158 | |
| 138 | Georg Fuchsbauer, Jonathan Katz, David Naccache: Efficient Rational Secret Sharing in Standard Communication Networks. TCC 2010: 419-436 | |
| 137 | Jonathan Katz: Public-Key Cryptography. Handbook of Information and Communication Security 2010: 21-34 | |
| 136 | Adam Groce, Jonathan Katz: A New Framework for Password-Based Authenticated Key Exchange. IACR Cryptology ePrint Archive 2010: 147 (2010) | |
| 135 | Zvika Brakerski, Yael Tauman Kalai, Jonathan Katz, Vinod Vaikuntanathan: Overcoming the Hole In The Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage. IACR Cryptology ePrint Archive 2010: 278 (2010) | |
| 134 | Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. IACR Cryptology ePrint Archive 2010: 29 (2010) | |
| 133 | Jonathan Katz, Vinod Vaikuntanathan: One-Round Password-Based Authenticated Key Exchange. IACR Cryptology ePrint Archive 2010: 368 (2010) | |
| 132 | Yevgeniy Dodis, Bhavana Kanukurthi, Jonathan Katz, Leonid Reyzin, Adam Smith: Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. IACR Cryptology ePrint Archive 2010: 456 (2010) | |
| 131 | Jonathan Katz, Lior Malka: Constant-Round Private Function Evaluation with Linear Complexity. IACR Cryptology ePrint Archive 2010: 528 (2010) | |
| 130 | Lior Malka, Jonathan Katz: VMCrypt - Modular Software Architecture for Scalable Secure Computation. IACR Cryptology ePrint Archive 2010: 584 (2010) | |
| 129 | Jonathan Katz, Ji Sun Shin, Adam Smith: Parallel and Concurrent Security of the HB and HB+ Protocols. J. Cryptology 23(3): 402-421 (2010) | |
| 128 | Omer Horvitz, Jonathan Katz: Bounds on the efficiency of black-box commitment schemes. Theor. Comput. Sci. 411(10): 1251-1260 (2010) | |
| 2009 | ||
| 127 | Martin R. Albrecht, Craig Gentry, Shai Halevi, Jonathan Katz: Attacking cryptographic schemes based on "perturbation polynomials". ACM Conference on Computer and Communications Security 2009: 1-10 | |
| 126 | Jonathan Katz, Arkady Yerukhimovich: On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations. ASIACRYPT 2009: 197-213 | |
| 125 | Giuseppe Ateniese, Seny Kamara, Jonathan Katz: Proofs of Storage from Homomorphic Identification Protocols. ASIACRYPT 2009: 319-333 | |
| 124 | Jonathan Katz, Vinod Vaikuntanathan: Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices. ASIACRYPT 2009: 636-652 | |
| 123 | Jonathan Katz, Vinod Vaikuntanathan: Signature Schemes with Bounded Leakage Resilience. ASIACRYPT 2009: 703-720 | |
| 122 | Joël Alwen, Jonathan Katz, Yehuda Lindell, Giuseppe Persiano, Abhi Shelat, Ivan Visconti: Collusion-Free Multiparty Computation in the Mediated Model. CRYPTO 2009: 524-540 | |
| 121 | Dan Boneh, David Mandell Freeman, Jonathan Katz, Brent Waters: Signing a Linear Subspace: Signature Schemes for Network Coding. Public Key Cryptography 2009: 68-87 | |
| 120 | Yevgeniy Dodis, Jonathan Katz, Adam Smith, Shabsi Walfish: Composability and On-Line Deniability of Authentication. TCC 2009: 146-162 | |
| 119 | S. Dov Gordon, Jonathan Katz: Complete Fairness in Multi-party Computation without an Honest Majority. TCC 2009: 19-35 | |
| 118 | Jonathan Katz: Signature Schemes with Bounded Leakage Resilience. IACR Cryptology ePrint Archive 2009: 133 (2009) | |
| 117 | Jonathan Katz: Signature Schemes with Bounded Leakage Resilience. IACR Cryptology ePrint Archive 2009: 220 (2009) | |
| 116 | S. Dov Gordon, Jonathan Katz, Ranjit Kumaresan, Arkady Yerukhimovich: Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure. IACR Cryptology ePrint Archive 2009: 410 (2009) | |
| 115 | Rosario Gennaro, Jonathan Katz, Hugo Krawczyk, Tal Rabin: Secure Network Coding Over the Integers. IACR Cryptology ePrint Archive 2009: 569 (2009) | |
| 114 | Martin R. Albrecht, Craig Gentry, Shai Halevi, Jonathan Katz: Attacking Cryptographic Schemes Based on "Perturbation Polynomials". IACR Cryptology ePrint Archive 2009: 98 (2009) | |
| 113 | Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan: Improving the round complexity of VSS in point-to-point networks. Inf. Comput. 207(8): 889-899 (2009) | |
| 112 | Jonathan Katz, Rafail Ostrovsky, Moti Yung: Efficient and secure authenticated key exchange using weak passwords. J. ACM 57(1): (2009) | |
| 111 | Jonathan Katz, Chiu-Yuen Koo: On expected constant-round protocols for Byzantine agreement. J. Comput. Syst. Sci. 75(2): 91-112 (2009) | |
| 110 | Adam Bender, Jonathan Katz, Ruggero Morselli: Ring Signatures: Stronger Definitions, and Constructions without Random Oracles. J. Cryptology 22(1): 114-138 (2009) | |
| 109 | Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel: Reducing Complexity Assumptions for Statistically-Hiding Commitment. J. Cryptology 22(3): 283-310 (2009) | |
| 2008 | ||
| 108 | Jonathan Katz, Andrew Y. Lindell: Aggregate Message Authentication Codes. CT-RSA 2008: 155-169 | |
| 107 | Jonathan Katz, Amit Sahai, Brent Waters: Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products. EUROCRYPT 2008: 146-162 | |
| 106 | Seny Kamara, Jonathan Katz: How to Encrypt with a Malicious Random Number Generator. FSE 2008: 303-315 | |
| 105 | Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan: Improving the Round Complexity of VSS in Point-to-Point Networks. ICALP (2) 2008: 499-510 | |
| 104 | S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell: Complete fairness in secure two-party computation. STOC 2008: 413-422 | |
| 103 | Vipul Goyal, Jonathan Katz: Universally Composable Multi-party Computation with an Unreliable Common Reference String. TCC 2008: 142-154 | |
| 102 | Jonathan Katz: Bridging Game Theory and Cryptography: Recent Results and Future Directions. TCC 2008: 251-272 | |
| 101 | Jonathan Katz: Which Languages Have 4-Round Zero-Knowledge Proofs? TCC 2008: 73-88 | |
| 100 | Jonathan Katz: Cryptography. Wiley Encyclopedia of Computer Science and Engineering 2008 | |
| 99 | S. Dov Gordon, Jonathan Katz: Partial Fairness in Secure Two-Party Computation. IACR Cryptology ePrint Archive 2008: 206 (2008) | |
| 98 | S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell: Complete Fairness in Secure Two-Party Computation. IACR Cryptology ePrint Archive 2008: 303 (2008) | |
| 97 | Dan Boneh, David Mandell Freeman, Jonathan Katz, Brent Waters: Signing a Linear Subspace: Signature Schemes for Network Coding. IACR Cryptology ePrint Archive 2008: 316 (2008) | |
| 96 | S. Dov Gordon, Jonathan Katz: Complete Fairness in Multi-Party Computation Without an Honest Majority. IACR Cryptology ePrint Archive 2008: 458 (2008) | |
| 95 | Georg Fuchsbauer, Jonathan Katz, David Naccache: Efficient Rational Secret Sharing in Standard Communication Networks. IACR Cryptology ePrint Archive 2008: 488 (2008) | |
| 94 | Jonathan Katz, Yehuda Lindell: Collusion-Free Multiparty Computation in the Mediated Model. IACR Cryptology ePrint Archive 2008: 533 (2008) | |
| 93 | Jonathan Katz, Yehuda Lindell: Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. J. Cryptology 21(3): 303-349 (2008) | |
| 2007 | ||
| 92 | Jonathan Katz, Yehuda Lindell: Introduction to Modern Cryptography Chapman and Hall/CRC Press 2007 | |
| 91 | Jonathan Katz, Moti Yung: Applied Cryptography and Network Security, 5th International Conference, ACNS 2007, Zhuhai, China, June 5-8, 2007, Proceedings Springer 2007 | |
| 90 | Ruggero Morselli, Bobby Bhattacharjee, Jonathan Katz, Michael A. Marsh: Exploiting approximate transitivity of trust. BROADNETS 2007: 515-524 | |
| 89 | Omer Horvitz, Jonathan Katz: Universally-Composable Two-Party Computation in Two Rounds. CRYPTO 2007: 111-129 | |
| 88 | Jonathan Katz: Universally Composable Multi-party Computation Using Tamper-Proof Hardware. EUROCRYPT 2007: 115-128 | |
| 87 | Jonathan Katz, Chiu-Yuen Koo: Round-Efficient Secure Computation in Point-to-Point Networks. EUROCRYPT 2007: 311-328 | |
| 86 | Juan A. Garay, Jonathan Katz, Chiu-Yuen Koo, Rafail Ostrovsky: Round Complexity of Authenticated Broadcast with a Dishonest Majority. FOCS 2007: 658-668 | |
| 85 | Jonathan Katz: Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise. IMA Int. Conf. 2007: 1-15 | |
| 84 | Jonathan Katz: On achieving the "best of both worlds" in secure multiparty computation. STOC 2007: 11-20 | |
| 83 | Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell: Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions. TCC 2007: 323-341 | |
| 82 | Jonathan Katz: Which Languages Have 4-Round Zero-Knowledge Proofs?. Electronic Colloquium on Computational Complexity (ECCC) 14(065): (2007) | |
| 81 | Jonathan Katz: Which Languages Have 4-Round Zero-Knowledge Proofs? IACR Cryptology ePrint Archive 2007: 265 (2007) | |
| 80 | Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan: Improving the Round Complexity of VSS in Point-to-Point Networks. IACR Cryptology ePrint Archive 2007: 358 (2007) | |
| 79 | Vipul Goyal, Jonathan Katz: Universally Composable Multi-Party Computation with an Unreliable Common Reference String. IACR Cryptology ePrint Archive 2007: 369 (2007) | |
| 78 | Jonathan Katz, Amit Sahai, Brent Waters: Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products. IACR Cryptology ePrint Archive 2007: 404 (2007) | |
| 77 | Jonathan Katz, Moti Yung: Scalable Protocols for Authenticated Group Key Exchange. J. Cryptology 20(1): 85-113 (2007) | |
| 76 | Ran Canetti, Shai Halevi, Jonathan Katz: A Forward-Secure Public-Key Encryption Scheme. J. Cryptology 20(3): 265-294 (2007) | |
| 75 | Eu-Jin Goh, Stanislaw Jarecki, Jonathan Katz, Nan Wang: Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems. J. Cryptology 20(4): 493-514 (2007) | |
| 74 | Dan Boneh, Ran Canetti, Shai Halevi, Jonathan Katz: Chosen-Ciphertext Security from Identity-Based Encryption. SIAM J. Comput. 36(5): 1301-1328 (2007) | |
| 73 | Jonathan Katz: Review of "Probability and Computing: Randomized Algorithms and Probabilitic Analysis by Michael Mitzenmacher and Eli Upfal", Cambridge University Press, 2005. SIGACT News 38(3): 20-22 (2007) | |
| 2006 | ||
| 72 | Yevgeniy Dodis, Jonathan Katz, Leonid Reyzin, Adam Smith: Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. CRYPTO 2006: 232-250 | |
| 71 | Jonathan Katz, Chiu-Yuen Koo: On Expected Constant-Round Protocols for Byzantine Agreement. CRYPTO 2006: 445-462 | |
| 70 | Jonathan Katz, Ji Sun Shin: Parallel and Concurrent Security of the HB and HB+ Protocols. EUROCRYPT 2006: 73-87 | |
| 69 | Chiu-Yuen Koo, Vartika Bhandari, Jonathan Katz, Nitin H. Vaidya: Reliable broadcast in radio networks: the bounded collision case. PODC 2006: 258-264 | |
| 68 | S. Dov Gordon, Jonathan Katz: Rational Secret Sharing, Revisited. SCN 2006: 229-241 | |
| 67 | Adam Bender, Jonathan Katz, Ruggero Morselli: Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles. TCC 2006: 60-79 | |
| 66 | Jonathan Katz, Chiu-Yuen Koo: On Expected Constant-Round Protocols for Byzantine Agreement. Electronic Colloquium on Computational Complexity (ECCC) 13(028): (2006) | |
| 65 | S. Dov Gordon, Jonathan Katz: Rational Secret Sharing, Revisited. IACR Cryptology ePrint Archive 2006: 142 (2006) | |
| 64 | Jonathan Katz, Adam Smith: Analyzing the HB and HB+ Protocols in the "Large Error" Case. IACR Cryptology ePrint Archive 2006: 326 (2006) | |
| 63 | Jonathan Katz: On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. IACR Cryptology ePrint Archive 2006: 455 (2006) | |
| 62 | Jonathan Katz, Chiu-Yuen Koo: On Expected Constant-Round Protocols for Byzantine Agreement. IACR Cryptology ePrint Archive 2006: 65 (2006) | |
| 61 | Jonathan Katz, Moti Yung: Characterization of Security Notions for Probabilistic Private-Key Encryption. J. Cryptology 19(1): 67-95 (2006) | |
| 60 | Jonathan Katz: Review of "A Computational Introduction to Number Theory and Algebra by Victor Shoup", Cambridge University Press, 2005. SIGACT News 37(1): 12-13 (2006) | |
| 59 | Jonathan Katz: Review of "Primality Testing in Polynomial Time by Martin Dietzfelbinger", Springer-Verlag, 2004. SIGACT News 37(1): 14-15 (2006) | |
| 2005 | ||
| 58 | Jonathan Katz, Ji Sun Shin: Modeling insider attacks on group key-exchange protocols. ACM Conference on Computer and Communications Security 2005: 180-189 | |
| 57 | Jonathan Katz, Philip D. MacKenzie, Gelareh Taban, Virgil D. Gligor: Two-Server Password-Only Authenticated Key Exchange. ACNS 2005: 1-16 | |
| 56 | Dan Boneh, Jonathan Katz: Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption. CT-RSA 2005: 87-103 | |
| 55 | Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith: Secure Remote Authentication Using Biometric Data. EUROCRYPT 2005: 147-163 | |
| 54 | Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie: Universally Composable Password-Based Key Exchange. EUROCRYPT 2005: 404-421 | |
| 53 | Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel: Reducing Complexity Assumptions for Statistically-Hiding Commitment. EUROCRYPT 2005: 58-77 | |
| 52 | Omer Horvitz, Jonathan Katz: Bounds on the Efficiency of "Black-Box" Commitment Schemes. ICALP 2005: 128-139 | |
| 51 | Jonathan Katz, Yehuda Lindell: Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. TCC 2005: 128-149 | |
| 50 | Ran Canetti, Shai Halevi, Jonathan Katz: Adaptively-Secure, Non-interactive Public-Key Encryption. TCC 2005: 150-168 | |
| 49 | Yevgeniy Dodis, Jonathan Katz: Chosen-Ciphertext Security of Multiple Encryption. TCC 2005: 188-209 | |
| 48 | Wenliang Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney, Jonathan Katz, Aram Khalili: A pairwise key predistribution scheme for wireless sensor networks. ACM Trans. Inf. Syst. Secur. 8(2): 228-258 (2005) | |
| 47 | Jonathan Katz, Ji Sun Shin: Modeling Insider Attacks on Group Key-Exchange Protocols. IACR Cryptology ePrint Archive 2005: 163 (2005) | |
| 46 | Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie: Universally Composable Password-Based Key Exchange. IACR Cryptology ePrint Archive 2005: 196 (2005) | |
| 45 | Adam Bender, Jonathan Katz, Ruggero Morselli: Ring Signatures: Stronger Definitions, and Constructions without Random Oracles. IACR Cryptology ePrint Archive 2005: 304 (2005) | |
| 44 | Jonathan Katz, Chiu-Yuen Koo: On Constructing Universal One-Way Hash Functions from Arbitrary One-Way Functions. IACR Cryptology ePrint Archive 2005: 328 (2005) | |
| 43 | Jonathan Katz, Yehuda Lindell: Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. IACR Cryptology ePrint Archive 2005: 379 (2005) | |
| 42 | Jonathan Katz, Ji Sun Shin: Parallel and Concurrent Security of the HB and HB+ Protocols. IACR Cryptology ePrint Archive 2005: 461 (2005) | |
| 41 | Rosario Gennaro, Yael Gertner, Jonathan Katz, Luca Trevisan: Bounds on the Efficiency of Generic Cryptographic Constructions. SIAM J. Comput. 35(1): 217-246 (2005) | |
| 40 | Jonathan Katz: Comparative book review: Cryptography: An Introduction by V. V. Yaschenko (American Mathematical Society, 2002); Cryptanalysis of Number Theoretic Ciphers by S.S. Wagstaff, Jr. (Chapman & Hall/CRC Press, 2003); RSA and Public-Key Cryptography by R. A. Mollin (Chapman & Hall/CRC Press, 2003); Foundations of Cryptography, vol. 1: Basic Tools by O. Goldreich, (Cambridge University Press, 2001). SIGACT News 36(2): 14-19 (2005) | |
| 2004 | ||
| 39 | Ik Rae Jeong, Jonathan Katz, Dong Hoon Lee: One-Round Protocols for Two-Party Authenticated Key Exchange. ACNS 2004: 220-232 | |
| 38 | Jonathan Katz, Rafail Ostrovsky: Round-Optimal Secure Two-Party Computation. CRYPTO 2004: 335-354 | |
| 37 | Yevgeniy Dodis, Matthew K. Franklin, Jonathan Katz, Atsuko Miyaji, Moti Yung: A Generic Construction for Intrusion-Resilient Public-Key Encryption. CT-RSA 2004: 81-98 | |
| 36 | Ran Canetti, Shai Halevi, Jonathan Katz: Chosen-Ciphertext Security from Identity-Based Encryption. EUROCRYPT 2004: 207-222 | |
| 35 | Ruggero Morselli, Samrat Bhattacharjee, Jonathan Katz, Peter J. Keleher: Trust-Preserving Set Operations. INFOCOM 2004 | |
| 34 | Jonathan Katz, Rafail Ostrovsky, Michael O. Rabin: Identity-Based Zero Knowledge. SCN 2004: 180-192 | |
| 33 | Dan Boneh, Jonathan Katz: Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption. IACR Cryptology ePrint Archive 2004: 261 (2004) | |
| 32 | Ran Canetti, Shai Halevi, Jonathan Katz: Adaptively-Secure, Non-Interactive Public-Key Encryption. IACR Cryptology ePrint Archive 2004: 317 (2004) | |
| 31 | Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli: Reducing Complexity Assumptions for Statistically-Hiding Commitment. IACR Cryptology ePrint Archive 2004: 341 (2004) | |
| 2003 | ||
| 30 | Jonathan Katz, Nan Wang: Efficiency improvements for signature schemes with tight security reductions. ACM Conference on Computer and Communications Security 2003: 155-164 | |
| 29 | Jonathan Katz, Moti Yung: Scalable Protocols for Authenticated Group Key Exchange. CRYPTO 2003: 110-125 | |
| 28 | Yevgeniy Dodis, Matthew K. Franklin, Jonathan Katz, Atsuko Miyaji, Moti Yung: Intrusion-Resilient Public-Key Encryption. CT-RSA 2003: 19-32 | |
| 27 | Jonathan Katz: Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications. EUROCRYPT 2003: 211-228 | |
| 26 | Ran Canetti, Shai Halevi, Jonathan Katz: A Forward-Secure Public-Key Encryption Scheme. EUROCRYPT 2003: 255-271 | |
| 25 | Jonathan Katz, Rafail Ostrovsky, Adam Smith: Round Efficiency of Multi-party Computation with a Dishonest Majority. EUROCRYPT 2003: 578-595 | |
| 24 | Jonathan Katz: Binary Tree Encryption: Constructions and Applications. ICISC 2003: 1-11 | |
| 23 | Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung: Strong Key-Insulated Signature Schemes. Public Key Cryptography 2003: 130-144 | |
| 22 | Aram Khalili, Jonathan Katz, William A. Arbaugh: Toward Secure Key Distribution in Truly Ad-Hoc Networks. SAINT Workshops 2003: 342-346 | |
| 21 | Rosario Gennaro, Yael Gertner, Jonathan Katz: Lower bounds on the efficiency of encryption and digital signature schemes. STOC 2003: 417-425 | |
| 20 | Jonathan Katz, Moti Yung: Scalable Protocols for Authenticated Group Key Exchange. IACR Cryptology ePrint Archive 2003: 171 (2003) | |
| 19 | Ran Canetti, Shai Halevi, Jonathan Katz: Chosen-Ciphertext Security from Identity-Based Encryption. IACR Cryptology ePrint Archive 2003: 182 (2003) | |
| 18 | Ran Canetti, Shai Halevi, Jonathan Katz: A Forward-Secure Public-Key Encryption Scheme. IACR Cryptology ePrint Archive 2003: 83 (2003) | |
| 2002 | ||
| 17 | Jonathan Katz, Moti Yung: Threshold Cryptosystems Based on Factoring. ASIACRYPT 2002: 192-205 | |
| 16 | Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung: Key-Insulated Public Key Cryptosystems. EUROCRYPT 2002: 65-82 | |
| 15 | Kahil Jallad, Jonathan Katz, Bruce Schneier: Implementation of Chosen-Ciphertext Attacks against PGP and GnuPG. ISC 2002: 90-101 | |
| 14 | Jonathan Katz, Rafail Ostrovsky, Moti Yung: Forward Secrecy in Password-Only Key Exchange Protocols. SCN 2002: 29-44 | |
| 13 | Jonathan Katz: Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications. IACR Cryptology ePrint Archive 2002: 27 (2002) | |
| 12 | Jonathan Katz: A Forward-Secure Public-Key Encryption Scheme. IACR Cryptology ePrint Archive 2002: 60 (2002) | |
| 11 | Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung: Key-Insulated Public-Key Cryptosystems. IACR Cryptology ePrint Archive 2002: 77 (2002) | |
| 2001 | ||
| 10 | Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith: Efficient and Non-interactive Non-malleable Commitment. EUROCRYPT 2001: 40-59 | |
| 9 | Jonathan Katz, Rafail Ostrovsky, Moti Yung: Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords. EUROCRYPT 2001: 475-494 | |
| 8 | Jonathan Katz, Steven Myers, Rafail Ostrovsky: Cryptographic Counters and Applications to Electronic Voting. EUROCRYPT 2001: 78-92 | |
| 7 | Enrico Buonanno, Jonathan Katz, Moti Yung: Incremental Unforgeable Encryption. FSE 2001: 109-124 | |
| 6 | Jonathan Katz, Rafail Ostrovsky, Moti Yung: Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords. IACR Cryptology ePrint Archive 2001: 31 (2001) | |
| 5 | Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith: Efficient and Non-Interactive Non-Malleable Commitment. IACR Cryptology ePrint Archive 2001: 32 (2001) | |
| 4 | Jonathan Katz, Moti Yung: Threshold Cryptosystems Based on Factoring. IACR Cryptology ePrint Archive 2001: 93 (2001) | |
| 2000 | ||
| 3 | Jonathan Katz, Moti Yung: Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation. FSE 2000: 284-299 | |
| 2 | Jonathan Katz, Moti Yung: Complete characterization of security notions for probabilistic private-key encryption. STOC 2000: 245-254 | |
| 1 | Jonathan Katz, Luca Trevisan: On the efficiency of local decoding procedures for error-correcting codes. STOC 2000: 80-86 | |
Colors in the list of coauthors
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page