Publications
]
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.
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. Efficient password-authenticated key exchange using human-memorable passwords. Advances in Cryptology—EUROCRYPT 2001. :475-494.
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.
2007. Universally composable multi-party computation using tamper-proof hardware. Advances in Cryptology-EUROCRYPT 2007. :115-128.
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).
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.
2002. Annotating the semantic web using natural language. Proceedings of the 2nd workshop on NLP and XML - Volume 17. :1-8.
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.
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.
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.
2005. Simulation and Secure Computation-Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. Lecture Notes in Computer Science. 3378:128-149.