Krishnaram Kenthapadi

Researcher

1065 La Avenida, Mountain View, CA 94043
krishnaram.kenthapadi [at] microsoft.com
office: +1-650-693-2114

Krishnaram Kenthapadi is a Researcher at Microsoft Search Labs in Mountain View, California. He graduated with a Ph.D. degree in Computer Science from Stanford University in 2006, under the supervision of Rajeev Motwani. His Ph.D. thesis is titled "Models and Algorithms for Data Privacy". Before joining Stanford, he received his Bachelors degree in Computer Science and Engineering from Indian Institute of Technology-Madras. His current research interests include web algorithms, privacy preserving data mining, hashing and load balancing, and social network analysis. He received the Best Student Paper award in the SODA 2006 conference.

List of publications

• S. Nabar, K. Kenthapadi, N. Mishra and R. Motwani. A Survey of Query Auditing Techniques for Data Privacy. Book chapter in Privacy-Preserving Data Mining: Models and Algorithms. To be published by Kluwer Academic Publishers, 2008.
• Krishnaram Kenthapadi. PhD Thesis: Models and Algorithms for Data Privacy. Stanford University, 2006.
• K. Kenthapadi and R. Panigrahy. Balanced Allocation on Graphs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006.
• C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor. Our Data, Ourselves: Privacy via Distributed Noise Generation. In Proceedings of EUROCRYPT, 2006.
• S.U. Nabar, B. Marthi, K. Kenthapadi, N. Mishra, and R. Motwani. Towards Robustness in Query Auditing. In Proceedings of the International Conference on Very Large Data Bases (VLDB), 2006.
• G. Aggarwal, T. Feder, K. Kenthapadi, S. Khuller, R. Panigrahy, D. Thomas, and A. Zhu. Achieving Anonymity via Clustering. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS), 2006.
• K. Kenthapadi, N. Mishra, and K. Nissim. Simulatable Auditing. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS), 2005.
• K. Kenthapadi and G.S. Manku. Decentralized Algorithms using both Local and Random Probes for P2P Load Balancing. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2005.
• G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu. Approximation Algorithms for k-Anonymity. Journal of Privacy Technology, 2005. Preliminary version: Anonymizing Tables. In Proceedings of the International Conference on Database Theory (ICDT), 2005.
• G. Aggarwal, M. Bawa, P. Ganesan, H. Garcia-Molina, K. Kenthapadi, et al. Two Can Keep a Secret: A Distributed Architecture for Secure Database Services. In Proceedings of the Conference on Innovative Data Systems Research (CIDR), 2005.
• G. Aggarwal, M. Bawa, P. Ganesan, H. Garcia-Molina, K. Kenthapadi, et al. Enabling Privacy for the Paranoids. In Proceedings of the International Conference on Very Large Data Bases (VLDB), 2004.