Publications
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.
2003. Scalable protocols for authenticated group key exchange. Advances in Cryptology-CRYPTO 2003. :110-125.
2009. Smooth projective hashing and password-based authenticated key exchange from lattices. Advances in Cryptology–ASIACRYPT 2009. :636-652.
2006. Review of "Primality Testing in Polynomial Time by Martin Dietzfelbinger", Springer-Verlag, 2004. SIGACT News. 37(1):14-15.
2012. Two-server password-only authenticated key exchange. Journal of Computer and System Sciences. 78(2):651-669.
2010. Secure text processing with applications to private DNA matching. Proceedings of the 17th ACM conference on Computer and communications security. :485-492.
2001. Cryptographic counters and applications to electronic voting. Advances in Cryptology—Eurocrypt 2001. :78-92.
2006. Characterization of security notions for probabilistic private-key encryption. Journal of Cryptology. 19(1):67-95.
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.
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.
2009. Improving the round complexity of VSS in point-to-point networks. Information and Computation. 207(8):889-899.
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.
2010. Natural language annotations for the Semantic Web. On the Move to Meaningful Internet Systems 2002: CoopIS, DOA, and ODBASE. :1317-1331.
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.