Publications

Export 481 results:
[ Author(Desc)] Title Type Year
Filters: First Letter Of Last Name is K  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
K
Katz J, Vaikuntanathan V.  2009.  Signature schemes with bounded leakage resilience. Advances in Cryptology–ASIACRYPT 2009. :703-720.
Katz J, MacKenzie P, Taban G, Gligor V.  2005.  Two-server password-only authenticated key exchange. Applied Cryptography and Network Security. :175-206.
Katz J, MacKenzie P, Taban G, Gligor V.  2012.  Two-server password-only authenticated key exchange. Journal of Computer and System Sciences. 78(2):651-669.
Katz J, Vaikuntanathan V.  2011.  Round-optimal password-based authenticated key exchange. Theory of Cryptography. :293-310.
Katz J, Schneier B.  2000.  A chosen ciphertext attack against several e-mail encryption protocols. Ninth USENIX Security Symposium.
Katz J, Ostrovsky R.  2004.  Round-optimal secure two-party computation. Advances in Cryptology–CRYPTO 2004. :3-34.
Katz J.  2008.  Bridging game theory and cryptography: recent results and future directions. Proceedings of the 5th conference on Theory of cryptography. :251-272.
Katz J.  2010.  Public-Key Cryptography. Handbook of Information and Communication Security. :21-34.
Katz B, Jimmy Lin, Quan D.  2010.  Natural language annotations for the Semantic Web. On the Move to Meaningful Internet Systems 2002: CoopIS, DOA, and ODBASE. :1317-1331.
Katz J.  2006.  Review of "Primality Testing in Polynomial Time by Martin Dietzfelbinger", Springer-Verlag, 2004. SIGACT News. 37(1):14-15.
Katz J, Lindell Y.  2008.  Handling expected polynomial-time strategies in simulation-based security proofs. Journal of Cryptology. 21(3):303-349.
Katz J.  2002.  Efficient Cryptographic Protocols Preventing “Man-in-the-Middle” Attacks.
Katz J, Shin J S.  2005.  Modeling insider attacks on group key-exchange protocols. Proceedings of the 12th ACM conference on Computer and communications security. :180-189.
Katz J, Koo CY.  2007.  Round-efficient secure computation in point-to-point networks. Advances in Cryptology-EUROCRYPT 2007. :311-328.
Katz J, Yung M.  2000.  Complete characterization of security notions for probabilistic private-key encryption. Proceedings of the thirty-second annual ACM symposium on Theory of computing. :245-254.
Katz J, Koo C-Y.  2009.  On expected constant-round protocols for Byzantine agreement. Journal of Computer and System Sciences. 75(2):91-112.
Katz J, Schröder D, Yerukhimovich A.  2011.  Impossibility of blind signatures from one-way permutations. Theory of Cryptography. :615-629.
Katz J, Lindell Y.  2005.  Simulation and Secure Computation-Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. Lecture Notes in Computer Science. 3378:128-149.
Katz J, Ostrovsky R, Yung M.  2003.  Forward secrecy in password-only key exchange protocols. Proceedings of the 3rd international conference on Security in communication networks. :29-44.
Katz J, Malka L.  2011.  Constant-Round Private Function Evaluation with Linear Complexity. Advances in Cryptology–ASIACRYPT 2011. :556-571.
Katz J, Yung M.  2001.  Unforgeable encryption and chosen ciphertext secure modes of operation. Fast Software Encryption. :25-36.
Katz B, Felshin S, Yuret D, Ibrahim A, Jimmy Lin, Marton G, Jerome McFarland A, Temelkuran B.  2002.  Omnibase: Uniform access to heterogeneous data for question answering. Natural Language Processing and Information Systems. :230-234.
Katz J.  2006.  Review of "A Computational Introduction to Number Theory and Algebra by Victor Shoup", Cambridge University Press, 2005. SIGACT News. 37(1):12-13.
Katz J, Koo CY.  2005.  On constructing universal one-way hash functions from arbitrary one-way functions. Journal of Cryptology.
Katz J.  2002.  A forward-secure public-key encryption scheme.

Pages