The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jonathan Katz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ik Rae Jeong, Jonathan Katz, Dong Hoon Lee
    One-Round Protocols for Two-Party Authenticated Key Exchange. [Citation Graph (0, 0)][DBLP]
    ACNS, 2004, pp:220-232 [Conf]
  2. Jonathan Katz, Philip D. MacKenzie, Gelareh Taban, Virgil D. Gligor
    Two-Server Password-Only Authenticated Key Exchange. [Citation Graph (0, 0)][DBLP]
    ACNS, 2005, pp:1-16 [Conf]
  3. Jonathan Katz, Moti Yung
    Threshold Cryptosystems Based on Factoring. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2002, pp:192-205 [Conf]
  4. Jonathan Katz, Ji Sun Shin
    Modeling insider attacks on group key-exchange protocols. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2005, pp:180-189 [Conf]
  5. Jonathan Katz, Nan Wang
    Efficiency improvements for signature schemes with tight security reductions. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2003, pp:155-164 [Conf]
  6. Jonathan Katz, Rafail Ostrovsky
    Round-Optimal Secure Two-Party Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:335-354 [Conf]
  7. Jonathan Katz, Moti Yung
    Scalable Protocols for Authenticated Group Key Exchange. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:110-125 [Conf]
  8. Yevgeniy Dodis, Jonathan Katz, Leonid Reyzin, Adam Smith
    Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:232-250 [Conf]
  9. Jonathan Katz, Chiu-Yuen Koo
    On Expected Constant-Round Protocols for Byzantine Agreement. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:445-462 [Conf]
  10. Dan Boneh, Jonathan Katz
    Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2005, pp:87-103 [Conf]
  11. Yevgeniy Dodis, Matthew K. Franklin, Jonathan Katz, Atsuko Miyaji, Moti Yung
    Intrusion-Resilient Public-Key Encryption. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2003, pp:19-32 [Conf]
  12. Yevgeniy Dodis, Matthew K. Franklin, Jonathan Katz, Atsuko Miyaji, Moti Yung
    A Generic Construction for Intrusion-Resilient Public-Key Encryption. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2004, pp:81-98 [Conf]
  13. Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
    Secure Remote Authentication Using Biometric Data. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2005, pp:147-163 [Conf]
  14. Ran Canetti, Shai Halevi, Jonathan Katz
    A Forward-Secure Public-Key Encryption Scheme. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:255-271 [Conf]
  15. Ran Canetti, Shai Halevi, Jonathan Katz
    Chosen-Ciphertext Security from Identity-Based Encryption. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:207-222 [Conf]
  16. Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie
    Universally Composable Password-Based Key Exchange. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2005, pp:404-421 [Conf]
  17. Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith
    Efficient and Non-interactive Non-malleable Commitment. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:40-59 [Conf]
  18. Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung
    Key-Insulated Public Key Cryptosystems. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2002, pp:65-82 [Conf]
  19. Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel
    Reducing Complexity Assumptions for Statistically-Hiding Commitment. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2005, pp:58-77 [Conf]
  20. Jonathan Katz
    Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:211-228 [Conf]
  21. Jonathan Katz, Steven Myers, Rafail Ostrovsky
    Cryptographic Counters and Applications to Electronic Voting. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:78-92 [Conf]
  22. Jonathan Katz, Rafail Ostrovsky, Adam Smith
    Round Efficiency of Multi-party Computation with a Dishonest Majority. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:578-595 [Conf]
  23. Jonathan Katz, Rafail Ostrovsky, Moti Yung
    Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:475-494 [Conf]
  24. Jonathan Katz, Ji Sun Shin
    Parallel and Concurrent Security of the HB and HB+ Protocols. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:73-87 [Conf]
  25. Enrico Buonanno, Jonathan Katz, Moti Yung
    Incremental Unforgeable Encryption. [Citation Graph (0, 0)][DBLP]
    FSE, 2001, pp:109-124 [Conf]
  26. Jonathan Katz, Moti Yung
    Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation. [Citation Graph (0, 0)][DBLP]
    FSE, 2000, pp:284-299 [Conf]
  27. Omer Horvitz, Jonathan Katz
    Bounds on the Efficiency of "Black-Box" Commitment Schemes. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:128-139 [Conf]
  28. Jonathan Katz
    Binary Tree Encryption: Constructions and Applications. [Citation Graph (0, 0)][DBLP]
    ICISC, 2003, pp:1-11 [Conf]
  29. Ruggero Morselli, Samrat Bhattacharjee, Jonathan Katz, Peter J. Keleher
    Trust-Preserving Set Operations. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  30. Kahil Jallad, Jonathan Katz, Bruce Schneier
    Implementation of Chosen-Ciphertext Attacks against PGP and GnuPG. [Citation Graph (0, 0)][DBLP]
    ISC, 2002, pp:90-101 [Conf]
  31. Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung
    Strong Key-Insulated Signature Schemes. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2003, pp:130-144 [Conf]
  32. Chiu-Yuen Koo, Vartika Bhandari, Jonathan Katz, Nitin H. Vaidya
    Reliable broadcast in radio networks: the bounded collision case. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:258-264 [Conf]
  33. Aram Khalili, Jonathan Katz, William A. Arbaugh
    Toward Secure Key Distribution in Truly Ad-Hoc Networks. [Citation Graph (0, 0)][DBLP]
    SAINT Workshops, 2003, pp:342-346 [Conf]
  34. Jonathan Katz, Rafail Ostrovsky, Michael O. Rabin
    Identity-Based Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    SCN, 2004, pp:180-192 [Conf]
  35. Jonathan Katz, Rafail Ostrovsky, Moti Yung
    Forward Secrecy in Password-Only Key Exchange Protocols. [Citation Graph (0, 0)][DBLP]
    SCN, 2002, pp:29-44 [Conf]
  36. S. Dov Gordon, Jonathan Katz
    Rational Secret Sharing, Revisited. [Citation Graph (0, 0)][DBLP]
    SCN, 2006, pp:229-241 [Conf]
  37. Rosario Gennaro, Yael Gertner, Jonathan Katz
    Lower bounds on the efficiency of encryption and digital signature schemes. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:417-425 [Conf]
  38. Jonathan Katz, Luca Trevisan
    On the efficiency of local decoding procedures for error-correcting codes. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:80-86 [Conf]
  39. Jonathan Katz, Moti Yung
    Complete characterization of security notions for probabilistic private-key encryption. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:245-254 [Conf]
  40. Adam Bender, Jonathan Katz, Ruggero Morselli
    Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:60-79 [Conf]
  41. Ran Canetti, Shai Halevi, Jonathan Katz
    Adaptively-Secure, Non-interactive Public-Key Encryption. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:150-168 [Conf]
  42. Yevgeniy Dodis, Jonathan Katz
    Chosen-Ciphertext Security of Multiple Encryption. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:188-209 [Conf]
  43. Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell
    Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:323-341 [Conf]
  44. Jonathan Katz, Yehuda Lindell
    Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:128-149 [Conf]
  45. Jonathan Katz, Moti Yung
    Characterization of Security Notions for Probabilistic Private-Key Encryption. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2006, v:19, n:1, pp:67-95 [Journal]
  46. Rosario Gennaro, Yael Gertner, Jonathan Katz, Luca Trevisan
    Bounds on the Efficiency of Generic Cryptographic Constructions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:217-246 [Journal]
  47. Dan Boneh, Ran Canetti, Shai Halevi, Jonathan Katz
    Chosen-Ciphertext Security from Identity-Based Encryption. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1301-1328 [Journal]
  48. Wenliang Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney, Jonathan Katz, Aram Khalili
    A pairwise key predistribution scheme for wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Inf. Syst. Secur., 2005, v:8, n:2, pp:228-258 [Journal]
  49. Omer Horvitz, Jonathan Katz
    Universally-Composable Two-Party Computation in Two Rounds. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:111-129 [Conf]
  50. Jonathan Katz
    Universally Composable Multi-party Computation Using Tamper-Proof Hardware. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2007, pp:115-128 [Conf]
  51. Jonathan Katz, Chiu-Yuen Koo
    Round-Efficient Secure Computation in Point-to-Point Networks. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2007, pp:311-328 [Conf]
  52. Jonathan Katz
    On achieving the "best of both worlds" in secure multiparty computation. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:11-20 [Conf]
  53. Jonathan Katz, Moti Yung
    Scalable Protocols for Authenticated Group Key Exchange. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2007, v:20, n:1, pp:85-113 [Journal]
  54. Ran Canetti, Shai Halevi, Jonathan Katz
    A Forward-Secure Public-Key Encryption Scheme. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2007, v:20, n:3, pp:265-294 [Journal]

  55. Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices. [Citation Graph (, )][DBLP]


  56. Proofs of Storage from Homomorphic Identification Protocols. [Citation Graph (, )][DBLP]


  57. Signature Schemes with Bounded Leakage Resilience. [Citation Graph (, )][DBLP]


  58. On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations. [Citation Graph (, )][DBLP]


  59. Exploiting approximate transitivity of trust. [Citation Graph (, )][DBLP]


  60. Attacking cryptographic schemes based on "perturbation polynomials". [Citation Graph (, )][DBLP]


  61. Collusion-Free Multiparty Computation in the Mediated Model. [Citation Graph (, )][DBLP]


  62. Aggregate Message Authentication Codes. [Citation Graph (, )][DBLP]


  63. Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products. [Citation Graph (, )][DBLP]


  64. Partial Fairness in Secure Two-Party Computation. [Citation Graph (, )][DBLP]


  65. Round Complexity of Authenticated Broadcast with a Dishonest Majority. [Citation Graph (, )][DBLP]


  66. How to Encrypt with a Malicious Random Number Generator. [Citation Graph (, )][DBLP]


  67. Improving the Round Complexity of VSS in Point-to-Point Networks. [Citation Graph (, )][DBLP]


  68. Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise. [Citation Graph (, )][DBLP]


  69. Signing a Linear Subspace: Signature Schemes for Network Coding. [Citation Graph (, )][DBLP]


  70. Secure Network Coding over the Integers. [Citation Graph (, )][DBLP]


  71. Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure. [Citation Graph (, )][DBLP]


  72. Complete fairness in secure two-party computation. [Citation Graph (, )][DBLP]


  73. Bridging Game Theory and Cryptography: Recent Results and Future Directions. [Citation Graph (, )][DBLP]


  74. Which Languages Have 4-Round Zero-Knowledge Proofs? [Citation Graph (, )][DBLP]


  75. Universally Composable Multi-party Computation with an Unreliable Common Reference String. [Citation Graph (, )][DBLP]


  76. Composability and On-Line Deniability of Authentication. [Citation Graph (, )][DBLP]


  77. Complete Fairness in Multi-party Computation without an Honest Majority. [Citation Graph (, )][DBLP]


  78. Efficient Rational Secret Sharing in Standard Communication Networks. [Citation Graph (, )][DBLP]


  79. Which Languages Have 4-Round Zero-Knowledge Proofs?. [Citation Graph (, )][DBLP]


  80. On Expected Constant-Round Protocols for Byzantine Agreement. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.604secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002