Subscribe
Issue No.08 - August (2008 vol.20)
pp: 1028-1033
ABSTRACT
We address issues related to sharing information in a distributed system consisting of autonomous entities, each of which holds a private database. We consider threats from malicious adversaries that can deviate from the designated protocol and change their input databases. We classify malicious adversaries into two widely existing subclasses, namely weakly and strongly malicious adversaries, and propose protocols that can effectively and efficiently protect privacy against malicious adversaries.
INDEX TERMS
Information sharing, privacy
CITATION
Nan Zhang, Wei Zhao, "Privacy Protection Against Malicious Adversaries in Distributed Information Sharing Systems", IEEE Transactions on Knowledge & Data Engineering, vol.20, no. 8, pp. 1028-1033, August 2008, doi:10.1109/TKDE.2007.1069
REFERENCES
 [1] R. Agrawal, A. Evfimievski, and R. Srikant, “Information Sharing Across Private Databases,” Proc. 22nd ACM SIGMOD Int'l Conf. Management of Data, pp. 86-97, 2003. [2] R.A. Baeza-Yates and B.A. Ribeiro-Neto, Modern Information Retrieval. ACM Press/Addison-Wesley, 1999. [3] M. Blum, “How to Exchange (Secret) Keys,” ACM Trans. Computer Systems, vol. 1, no. 2, pp. 175-193, 1983. [4] C. Clifton, M. Kantarcioglu, J. Vaidya, X. Lin, and M.Y. Zhu, “Tools for Privacy Preserving Distributed Data Mining,” SIGKDD Explorations, vol. 4, no. 2, pp. 28-34, 2002. [5] H. Debar and A. Wespi, “Aggregation and Correlation of Intrusion-Detection Alerts,” Proc. Fourth Int'l Symp. Recent Advances in Intrusion Detection, pp. 85-103, 2001. [6] T. ElGamal, “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” IEEE Trans. Information Theory, vol. 31, no. 4, pp. 469-472, 1985. [7] M.J. Freedman, K. Nissim, and B. Pinkas, “Efficient Private Matching and Set Intersection,” Advances in Cryptography: Eurocrypt, pp. 1-19, 2004. [8] O. Goldreich, The Foundations of Cryptography, vol. 2. Cambridge Univ. Press, 2004. [9] W. Jiang and C. Clifton, “Privacy-Preserving Distributed $k\hbox{-}{\rm Anonymity}$ ,” Proc. 19th Ann. IFIP WG 11.3 Working Conf. Data and Applications Security, pp. 166-177, 2005. [10] M. Kantarcioglu and C. Clifton, “Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data,” IEEE Trans. Knowledge and Data Eng., vol. 16, pp. 1026-1037, 2004. [11] M. Kantarcioglu and J. Vaidya, “Privacy Preserving Naive Bayes Classifier for Horizontally Partitioned Data,” Proc. Workshop Privacy Preserving Data Mining, 2003. [12] L. Kissner and D.X. Song, “Privacy-Preserving Set Operations,” Advances in Cryptology: Crypto, pp. 241-257, 2005. [13] J.J. Parekh, K. Wang, and S.J. Stolfo, “Privacy-Preserving Payload-Based Correlation for Accurate Malicious Traffic Detection,” Proc. SIGCOMM Workshop Large-Scale Attack Defense, pp. 99-106, 2006. [14] S.C. Pohlig and M.E. Hellman, “An Improved Algorithm for Computing Logarithms in GF(p) and Its Cryptographic Significance,” IEEE Trans. Information Theory, vol. 24, no. 1, pp. 106-111, 1978. [15] A. Shamir, R.L. Rivest, and L.M. Adleman, “Mental Poker,” Math. Gardner, pp. 37-43, 1981. [16] Z. Yang, S. Zhong, and R.N. Wright, “Anonymity-Preserving Data Collection,” Proc. 11th ACM SIGKDD Int'l Conf. Knowledge Discovery in Data Mining, pp. 334-343, 2005. [17] N. Zhang and W. Zhao, “Distributed Privacy Preserving Information Sharing,” Proc. 31st Int'l Conf. Very Large Data Bases, pp. 889-900, 2005. [18] N. Zhang and W. Zhao, “On Privacy Protection in Distributed Information Sharing,” Technical Report CSE-2007-7, Univ. of Texas, Arlington, 2007.