Publications
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.
2003. Scalable protocols for authenticated group key exchange. Advances in Cryptology-CRYPTO 2003. :110-125.
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.
2009. Smooth projective hashing and password-based authenticated key exchange from lattices. Advances in Cryptology–ASIACRYPT 2009. :636-652.
2012. Two-server password-only authenticated key exchange. Journal of Computer and System Sciences. 78(2):651-669.
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.
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.
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.
2009. Improving the round complexity of VSS in point-to-point networks. Information and Computation. 207(8):889-899.
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. Simulation and Secure Computation-Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. Lecture Notes in Computer Science. 3378:128-149.
2006. Review of "Primality Testing in Polynomial Time by Martin Dietzfelbinger", Springer-Verlag, 2004. SIGACT News. 37(1):14-15.
2002. Annotating the semantic web using natural language. Proceedings of the 2nd workshop on NLP and XML - Volume 17. :1-8.
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.
2010. Secure text processing with applications to private DNA matching. Proceedings of the 17th ACM conference on Computer and communications security. :485-492.
2008. Handling expected polynomial-time strategies in simulation-based security proofs. Journal of Cryptology. 21(3):303-349.
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.