Publications
2005. Modeling insider attacks on group key-exchange protocols. Proceedings of the 12th ACM conference on Computer and communications security. :180-189.
2008. Bridging game theory and cryptography: recent results and future directions. Proceedings of the 5th conference on Theory of cryptography. :251-272.
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.
2002. Omnibase: Uniform access to heterogeneous data for question answering. Natural Language Processing and Information Systems. :230-234.
2004. Secure routing in ad hoc networks. Workshop on Security of ad hoc and Sensor Networks: Proceedings of the 2 nd ACM workshop on Security of ad hoc and sensor networks.
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.
2007. Review of "Probability and Computing: Randomized Algorithms and Probabilitic Analysis by Michael Mitzenmacher and Eli Upfal", Cambridge University Press, 2005. SIGACT News. 38(3):20-22.
2008. Improving the round complexity of vss in point-to-point networks. Automata, Languages and Programming. :499-510.
2003. Efficient and non-malleable proofs of plaintext knowledge and applications. Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques. :211-228.
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.
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.
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).
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.
2006. Review of "Primality Testing in Polynomial Time by Martin Dietzfelbinger", Springer-Verlag, 2004. SIGACT News. 37(1):14-15.