Publications
]
2000. Complete characterization of security notions for probabilistic private-key encryption. Proceedings of the thirty-second annual ACM symposium on Theory of computing. :245-254.
2001. Unforgeable encryption and chosen ciphertext secure modes of operation. Fast Software Encryption. :25-36.
2004. Binary tree encryption: Constructions and applications. Information Security and Cryptology-ICISC 2003. :1-11.
2007. Round-efficient secure computation in point-to-point networks. Advances in Cryptology-EUROCRYPT 2007. :311-328.
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.
2005. Two-server password-only authenticated key exchange. Applied Cryptography and Network Security. :175-206.
2006. Analyzing the HB and HB+ protocols in the “large error” case. IACR ePrint report. 326:2006-2006.
2002. The START multimedia information system: Current technology and future directions. In Proceedings of the International Workshop on Multimedia Information Systems (MIS 2002).
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.
2009. On black-box constructions of predicate encryption from trapdoor permutations. Advances in Cryptology–ASIACRYPT 2009. :197-213.
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.
2002. Annotating the semantic web using natural language. Proceedings of the 2nd workshop on NLP and XML - Volume 17. :1-8.
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.
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. 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.