Jaideep S. Vaidya

Associate Professor of Computer Information Systems (2004)

Ph.D. in Computer Science, Purdue, 2004
M.S. in Computer Science, Purdue, 2001
B.E. in Computer Engineering, University of Mumbai, 1999

Homepage Send Email

Dr. Vaidya's work is at the confluence of data mining, databases and privacy/security. He is particularly interested in Security and Privacy issues raised by data mining -- the area of Privacy preserving data mining; Data Mining techniques applied to interoperation of heterogeneous information sources; and the use of data mining for enhancing security. In general, he also has broad interests in applied cryptography and general Secure Multi-Party Computation techniques including RFID security, privacy preserving optimization and secure supply chain management. The fundamental challenge here is to enable the secure computation of the interesting function without a significant loss in efficiency. Other research interests include novel applications of data mining and databases such as role engineering, spatio-temporal data mining, mining of environmental data and environmental data warehousing.

Dr. Vaidya has a Ph.D. and Masters degree in Computer Science from Purdue University, and a Bachelor's degree in Computer Engineering from the University of Mumbai.


Selected Publications

Secure Set Intersection Cardinality with Application to Association Rule Mining. Jaideep Vaidya and Chris Clifton, Journal of Computer Security, 13(4), IOS Press, November 2005, pp. 593 - 622. (Bib).

Optimal Boolean Matrix Decomposition: Application to Role Engineering, Haibing Lu, Jaideep Vaidya, and Vijay Atluri, in Proceedings of the 24th International Conference on Data Engineering, April 7-12, 2008, Cancun, Mexico. (Bib).

The Role Mining Problem: Finding a Minimal Descriptive Set of Roles , Jaideep Vaidya, Vijay Atluri, and Qi Guo, in Proceedings of the 12th ACM Symposium on Access Control Models and Technologies, June 20-June22, 2007, Sophia Antipolis, France. (Bib).

Knowledge Discovery from Transportation Graph Data, Wei Jiang, Jaideep Vaidya, Zahir Balaporia, Chris Clifton, and Brett Banich, in Proceedings of the 2005 IEEE International Conference on Data Engineering, April 2005, Tokyo, Japan. Best Industrial Paper award. (Bib).

Privacy-Preserving K-Means Clustering over Vertically Partitioned Data. Jaideep Vaidya and Chris Clifton, The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 24 - 27, 2003, Washington, D.C. Honorable mention (runner up), best research paper. (Bib).
(Revised paper invited for submission at Interface '04).