Publications
2009. Signature schemes with bounded leakage resilience. Advances in Cryptology–ASIACRYPT 2009. :703-720.
2009. On expected constant-round protocols for Byzantine agreement. Journal of Computer and System Sciences. 75(2):91-112.
2000. On the efficiency of local decoding procedures for error-correcting codes. Proceedings of the thirty-second annual ACM symposium on Theory of computing. :80-86.
2008. Handling expected polynomial-time strategies in simulation-based security proofs. Journal of Cryptology. 21(3):303-349.
1989. Rational Common Ground in the Sociology of Knowledge. Philosophy of the social sciences. 19(3):257-271.
2008. Improving the round complexity of vss in point-to-point networks. Automata, Languages and Programming. :499-510.
2007. Efficient cryptographic protocols based on the hardness of learning parity with noise. Proceedings of the 11th IMA international conference on Cryptography and coding. :1-15.
2003. Forward secrecy in password-only key exchange protocols. Proceedings of the 3rd international conference on Security in communication networks. :29-44.
2002. The START multimedia information system: Current technology and future directions. In Proceedings of the International Workshop on Multimedia Information Systems (MIS 2002).
2010. Parallel and concurrent security of the HB and HB+ protocols. Journal of cryptology. 23(3):402-421.
2002. Annotating the semantic web using natural language. Proceedings of the 2nd workshop on NLP and XML - Volume 17. :1-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.
2006. Review of "Primality Testing in Polynomial Time by Martin Dietzfelbinger", Springer-Verlag, 2004. SIGACT News. 37(1):14-15.
2010. Secure text processing with applications to private DNA matching. Proceedings of the 17th ACM conference on Computer and communications security. :485-492.
2007. On achieving the "best of both worlds" in secure multiparty computation. Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. :11-20.
2005. On constructing universal one-way hash functions from arbitrary one-way functions. Journal of Cryptology.
2000. A chosen ciphertext attack against several e-mail encryption protocols. Ninth USENIX Security Symposium.
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.
2003. Efficiency improvements for signature schemes with tight security reductions. Proceedings of the 10th ACM conference on Computer and communications security. :155-164.
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.