Research
I am currently working with Rafael Pass and Dexter Kozen. I am interested in complexity theory and cryptography.
Some useful surveys/lecture notes in the topics that interest me.
PCP
CSE 533:The PCP Theorem and Hardness of Approximation taught by Venkat Guruswami and Ryan O Donnell
PCP and Hardness of Approximation Luca Trevisan's course from Berkeley
The PCP Theorem by gap amplification Irit Dinur's proof from STOC 2006 that won the best paper award
Regarding hardness of approximation, I found the journal version of Hastads paper (here ) very insightful.
Publications
Cryptography/Complexity
- Omkant Pandey and Rafael Pass and Amit Sahai and Wei-Lung Dustin Tseng and Muthuramakrishnan Venkitasubramaniam. Precise Concurrent Zero Knowledge. To appear in Eurocrypt 2008. (Eprint version)
- Rafael Pass, Muthuramakrishnan Venkitasubramaniam. On Constant-Round Concurrent Zero-Knowledge. To appear in TCC 2008
- Huijia (Rachel) Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam. Concurrent Non-Malleable Commitments from One-way Functions. To appear in TCC 2008
- Rafael Pass, Muthuramakrishnan Venkitasubramaniam. An Efficient Parallel Repetition Theorem for Arthur-Merlin Games. STOC 2007.
Privacy
- Ashwin Machanavajjhala, Daniel Kifer, Johannes Gehrke, Muthuramakrishnan Venkitasubramaniam. l-Diversity: Privacy Beyond k-Anonymity.To appear in ACM Transactions on Knowledge Discovery from Data (TKDD).
- Ashwin Machanavajjhala, Johannes Gehrke, Daniel Kifer, Muthuramakrishnan Venkitasubramaniam. l-Diversity: Privacy Beyond k-Anonymity. Proceedings of the 22nd IEEE International Conference on Data Engineering (ICDE 2006), Atlanta Georgia, April 2006.
- Muthuramakrishnan Venkitasubramaniam, Ashwin Machanavajjhala, David Martin , Johannes Gehrke. Trusted CVS. Proceedings of the International Workshop on Security and Trust in Decentralized/Distributed Data Structures (STD3S). ICDE Workshops 2006.
Distributed Computing
- D. V. S. Ravikant , Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan. On Byzantine Agreement over (2, 3)-Uniform Hypergraphs . Proceedings of the 18th Annual Conference on Distributed Computing (DISC 2004), Amsterdam, the Netherlands, October 2004.
- D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan. Brief announcement: On the round complexity of distributed consensus over synchronous networks .Proceedings of the 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2004), Newfoundland, Canada, July 2004.