Publications
2006. Review of "A Computational Introduction to Number Theory and Algebra by Victor Shoup", Cambridge University Press, 2005. SIGACT News. 37(1):12-13.
2009. On expected constant-round protocols for Byzantine agreement. Journal of Computer and System Sciences. 75(2):91-112.
2008. Handling expected polynomial-time strategies in simulation-based security proofs. Journal of Cryptology. 21(3):303-349.
2008. Improving the round complexity of vss in point-to-point networks. Automata, Languages and Programming. :499-510.
1989. Rational Common Ground in the Sociology of Knowledge. Philosophy of the social sciences. 19(3):257-271.
2010. Parallel and concurrent security of the HB and HB+ protocols. Journal of cryptology. 23(3):402-421.
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.
2002. The START multimedia information system: Current technology and future directions. In Proceedings of the International Workshop on Multimedia Information Systems (MIS 2002).
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.
2002. Annotating the semantic web using natural language. Proceedings of the 2nd workshop on NLP and XML - Volume 17. :1-8.
2005. On constructing universal one-way hash functions from arbitrary one-way functions. Journal of Cryptology.
2011. Impossibility of blind signatures from one-way permutations. Theory of Cryptography. :615-629.
2000. A chosen ciphertext attack against several e-mail encryption protocols. Ninth USENIX Security Symposium.
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.
2006. On expected constant-round protocols for Byzantine agreement. Advances in Cryptology-CRYPTO 2006. :445-462.
2011. Constant-Round Private Function Evaluation with Linear Complexity. Advances in Cryptology–ASIACRYPT 2011. :556-571.
2012. Review of efficient secure two-party protocols: techniques and constructions by Carmit Hazay and Yehuda Lindell. SIGACT News. 43(1):21-23.
2000. REXTOR: a system for generating relations from natural language. Proceedings of the ACL-2000 workshop on Recent advances in natural language processing and information retrieval: held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics - Volume 11. :67-77.