Abstract
Link discovery is a process of identifying association(s) among different entities included in a complex network structure. These association(s) may represent any interaction among entities, for example between people or even bank accounts. The need for link discovery arises in many applications including law enforcement, counter-terrorism, social network analysis, intrusion detection, and fraud detection. Given the sensitive nature of information that can be revealed from link discovery, privacy is a major concern from the perspective of both individuals and organizations. For example, in the context of financial fraud detection, linking transactions may reveal sensitive information about other individuals not involved in any fraud. It is known that link discovery can be done in a privacy-preserving manner by securely finding the transitive closure of a graph. We propose two very efficient techniques to find the transitive closure securely. The two protocols have varying levels of security and performance. We analyze the performance and usability of the proposed approach in terms of both analytical and experimental results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Getoor, L., Diehl, C.P.: Link mining: a survey. SIGKDD Explorations 7(2), 3–12 (2005)
He, X., Shafiq, B., Vaidya, J., Adam, N.: Privacy-preserving link discovery. In: Wainwright, R.L., Haddad, H. (eds.) SAC, pp. 909–915. ACM, New York (2008)
Sweeney, L.: Privacy-enhanced linking. SIGKDD Explorations 7(2), 72–75 (2005)
Xu, J.J., Chen, H.: Fighting organized crimes: using shortest-path algorithms to identify associations in criminal networks. Decision Support Systems 38(3), 473–487 (2004)
Ganiz, M.C., Pottenger, W.M., Yang, X.: Link analysis of higher-order path in supervised learning datasets. In: Proceedings of the 4th SIAM Workshop on Link Analysis, Counterterrorism and Security (April 2006)
Mooney, R., Melville, P., Tang, L., Shavlik, J., Dutra, I., Page, D., Costa, V.: Relational data mining with inductive logic programming for link discovery. In: Proceedings of the National Science Foundation Workshop on Next Generation Data Mining, Baltimore, Maryland (2002)
Duan, Y., Wang, J., Kam, M., Canny, J.: A secure online algorithm for link analysis on weighted graph. In: Proceedings of SIAM Workshop on Link Analysis, Counterterrorism and Security (April 2005)
Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD Conference on Management of Data, pp. 439–450 (2000)
Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 36–54. Springer, Heidelberg (2000)
Vaidya, J., Clifton, C., Zhu, M.: Privacy-Preserving Data Mining. In: Advances in Information Security, 1st edn. Springer, Heidelberg (2005)
Goethals, B., Laur, S., Lipmaa, H., Mielikäinen, T.: On Secure Scalar Product Computation for Privacy-Preserving Data Mining. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 104–120. Springer, Heidelberg (2005)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. McGraw-Hill Book Company, New York (1990)
Bollobás, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, X., Vaidya, J., Shafiq, B., Adam, N., Terzi, E., Grandison, T. (2009). Efficient Privacy-Preserving Link Discovery. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, TB. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2009. Lecture Notes in Computer Science(), vol 5476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01307-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-01307-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01306-5
Online ISBN: 978-3-642-01307-2
eBook Packages: Computer ScienceComputer Science (R0)