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.  2002.  Efficient Cryptographic Protocols Preventing “Man-in-the-Middle” Attacks.
Katz J, Koo CY.  2005.  On constructing universal one-way hash functions from arbitrary one-way functions. Journal of Cryptology.
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, 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, 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, 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.  2012.  Which Languages Have 4-Round Zero-Knowledge Proofs? Journal of cryptology. 25(1):41-56.
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.
Katz J, Yung M.  2001.  Unforgeable encryption and chosen ciphertext secure modes of operation. Fast Software Encryption. :25-36.
Katz J, Lindell A.  2008.  Aggregate message authentication codes. Topics in Cryptology–CT-RSA 2008. :155-169.
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 J.  2002.  A forward-secure public-key encryption scheme.
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.  2008.  Bridging game theory and cryptography: recent results and future directions. Proceedings of the 5th conference on Theory of cryptography. :251-272.
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.  2008.  Which languages have 4-round zero-knowledge proofs? Theory of Cryptography. :73-88.
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, Smith A.  2006.  Analyzing the HB and HB+ protocols in the “large error” case. IACR ePrint report. 326:2006-2006.
Katz J.  2004.  Secure routing in ad hoc networks. Workshop on Security of ad hoc and Sensor Networks: Proceedings of the 2 nd ACM workshop on Security of ad hoc and sensor networks.
Katz J, Yerukhimovich A.  2009.  On black-box constructions of predicate encryption from trapdoor permutations. Advances in Cryptology–ASIACRYPT 2009. :197-213.

Pages