Publications
2006. On expected constant-round protocols for Byzantine agreement. Advances in Cryptology-CRYPTO 2006. :445-462.
2006. Review of "A Computational Introduction to Number Theory and Algebra by Victor Shoup", Cambridge University Press, 2005. SIGACT News. 37(1):12-13.
2011. Constant-Round Private Function Evaluation with Linear Complexity. Advances in Cryptology–ASIACRYPT 2011. :556-571.
2001. Unforgeable encryption and chosen ciphertext secure modes of operation. Fast Software Encryption. :25-36.
2007. Round-efficient secure computation in point-to-point networks. Advances in Cryptology-EUROCRYPT 2007. :311-328.
2004. Binary tree encryption: Constructions and applications. Information Security and Cryptology-ICISC 2003. :1-11.
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.
2005. Two-server password-only authenticated key exchange. Applied Cryptography and Network Security. :175-206.
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.
2006. Analyzing the HB and HB+ protocols in the “large error” case. IACR ePrint report. 326:2006-2006.
2009. On black-box constructions of predicate encryption from trapdoor permutations. Advances in Cryptology–ASIACRYPT 2009. :197-213.
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.
2001. Efficient password-authenticated key exchange using human-memorable passwords. Advances in Cryptology—EUROCRYPT 2001. :475-494.
2011. Impossibility of blind signatures from one-way permutations. Theory of Cryptography. :615-629.
2010. Natural language annotations for the Semantic Web. On the Move to Meaningful Internet Systems 2002: CoopIS, DOA, and ODBASE. :1317-1331.
2007. Universally composable multi-party computation using tamper-proof hardware. Advances in Cryptology-EUROCRYPT 2007. :115-128.
2012. Review of efficient secure two-party protocols: techniques and constructions by Carmit Hazay and Yehuda Lindell. SIGACT News. 43(1):21-23.
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.
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.