Publications

Export 7148 results:
[ Author(Asc)] 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, Koo CY.  2006.  On expected constant-round protocols for Byzantine agreement. Advances in Cryptology-CRYPTO 2006. :445-462.
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, Maurer U, Tackmann B, Zikas V.  2011.  Universally composable synchronous computation.
Katz J, Malka L.  2011.  Constant-Round Private Function Evaluation with Linear Complexity. Advances in Cryptology–ASIACRYPT 2011. :556-571.
Katz J.  2012.  Which Languages Have 4-Round Zero-Knowledge Proofs? Journal of cryptology. 25(1):41-56.
Katz J, Vaikuntanathan V.  2011.  Round-optimal password-based authenticated key exchange. Theory of Cryptography. :293-310.
Katz J, Ostrovsky R, Rabin M.  2005.  Identity-based zero-knowledge. Security in Communication Networks. :180-192.
Katz J, Yung M.  2001.  Unforgeable encryption and chosen ciphertext secure modes of operation. Fast Software Encryption. :25-36.
Katz J, Koo CY.  2007.  Round-efficient secure computation in point-to-point networks. Advances in Cryptology-EUROCRYPT 2007. :311-328.
Katz J.  2004.  Binary tree encryption: Constructions and applications. Information Security and Cryptology-ICISC 2003. :1-11.
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, MacKenzie P, Taban G, Gligor V.  2005.  Two-server password-only authenticated key exchange. Applied Cryptography and Network Security. :175-206.
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, Smith A.  2006.  Analyzing the HB and HB+ protocols in the “large error” case. IACR ePrint report. 326:2006-2006.
Katz J.  2002.  Efficient Cryptographic Protocols Preventing “Man-in-the-Middle” Attacks.
Katz J, Yerukhimovich A.  2009.  On black-box constructions of predicate encryption from trapdoor permutations. Advances in Cryptology–ASIACRYPT 2009. :197-213.
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, Ostrovsky R, Yung M.  2001.  Efficient password-authenticated key exchange using human-memorable passwords. Advances in Cryptology—EUROCRYPT 2001. :475-494.
Katz J, Schröder D, Yerukhimovich A.  2011.  Impossibility of blind signatures from one-way permutations. Theory of Cryptography. :615-629.
Katz J, Yung M.  2007.  Scalable protocols for authenticated group key exchange. Journal of Cryptology. 20(1):85-113.
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.  2007.  Universally composable multi-party computation using tamper-proof hardware. Advances in Cryptology-EUROCRYPT 2007. :115-128.
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, 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.

Pages