Publications
2003. Efficiency improvements for signature schemes with tight security reductions. Proceedings of the 10th ACM conference on Computer and communications security. :155-164.
2005. Simulation and Secure Computation-Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. Lecture Notes in Computer Science. 3378:128-149.
2009. Signature schemes with bounded leakage resilience. Advances in Cryptology–ASIACRYPT 2009. :703-720.
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.
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.
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.
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.
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.
2010. Natural language annotations for the Semantic Web. On the Move to Meaningful Internet Systems 2002: CoopIS, DOA, and ODBASE. :1317-1331.
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.