Publications

Export 7148 results:
[ Author(Desc)] Title Type Year
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, Lindell Y.  2008.  Handling expected polynomial-time strategies in simulation-based security proofs. Journal of Cryptology. 21(3):303-349.
Katz J, Yung M.  2002.  Threshold cryptosystems based on factoring. Advances in Cryptology—ASIACRYPT 2002. :139-147.
Katz J, Vaikuntanathan V.  2011.  Round-optimal password-based authenticated key exchange. Theory of Cryptography. :293-310.
Katz J.  1989.  Rational Common Ground in the Sociology of Knowledge. Philosophy of the social sciences. 19(3):257-271.
Katz J, Koo CY, Kumaresan R.  2008.  Improving the round complexity of vss in point-to-point networks. Automata, Languages and Programming. :499-510.
Katz J, Ostrovsky R, Rabin M.  2005.  Identity-based zero-knowledge. Security in Communication Networks. :180-192.
Katz J, Shin JS, Smith A.  2010.  Parallel and concurrent security of the HB and HB+ protocols. Journal of cryptology. 23(3):402-421.
Katz J, Ostrovsky R.  2004.  Round-optimal secure two-party computation. Advances in Cryptology–CRYPTO 2004. :3-34.
Katz B, Jimmy Lin, Felshin S.  2001.  Gathering knowledge for a question answering system from heterogeneous information sources. Proceedings of the workshop on Human Language Technology and Knowledge Management - Volume 2001. :9:1–9:8-9:1–9:8.
Katz J, Ostrovsky R, Yung M.  2009.  Efficient and secure authenticated key exchange using weak passwords. Journal of the ACM (JACM). 57(1):3:1–3:39-3:1–3:39.
Katz J.  2002.  Efficient Cryptographic Protocols Preventing “Man-in-the-Middle” Attacks.
Katz J.  2005.  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.. SIGACT News. 36(2):14-19.
Katz J, Koo CY.  2005.  On constructing universal one-way hash functions from arbitrary one-way functions. Journal of Cryptology.
Katz J, Schröder D, Yerukhimovich A.  2011.  Impossibility of blind signatures from one-way permutations. Theory of Cryptography. :615-629.
Katz J, Schneier B.  2000.  A chosen ciphertext attack against several e-mail encryption protocols. Ninth USENIX Security Symposium.
Katz J, Sahai A, Waters B.  2008.  Predicate encryption supporting disjunctions, polynomial equations, and inner products. Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology. :146-162.
Katz J, Koo CY.  2006.  On expected constant-round protocols for Byzantine agreement. Advances in Cryptology-CRYPTO 2006. :445-462.
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.  2012.  Which Languages Have 4-Round Zero-Knowledge Proofs? Journal of cryptology. 25(1):41-56.
Katz J, Malka L.  2011.  Constant-Round Private Function Evaluation with Linear Complexity. Advances in Cryptology–ASIACRYPT 2011. :556-571.
Katz J.  2012.  Review of efficient secure two-party protocols: techniques and constructions by Carmit Hazay and Yehuda Lindell. SIGACT News. 43(1):21-23.
Katz J, Ostrovsky R, Smith A.  2003.  Round efficiency of multi-party computation with a dishonest majority. Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques. :578-595.
Katz J, Lindell A.  2008.  Aggregate message authentication codes. Topics in Cryptology–CT-RSA 2008. :155-169.
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, Yung M.  2001.  Unforgeable encryption and chosen ciphertext secure modes of operation. Fast Software Encryption. :25-36.

Pages