Abstract
Consider the scenario where information about a large network is distributed across several different parties or commercial entities. Intuitively, we would expect that the aggregate network formed by combining the individual private networks would be a more faithful representation of the network phenomenon as a whole. However, privacy preservation of the individual networks becomes a mandate. Thus, it would be useful, given several portions of an underlying network p 1 ...p n , to securely compute the aggregate of all the networks p i in a manner such that no party learns information about any other party’s network. In this work, we propose a novel privacy preservation protocol for the non-trivial case of weighted networks. The protocol is secure against malicious adversaries.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chawla, N.V., Karakoulas, G.: Learning from labeled and unlabeled data: An empirical study across techniques and domains. JAIR 23, 331–366 (2005)
Cramer, R., Damgard, I., Nielsen, J.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 280–299. Springer, Heidelberg (2001)
Damgard, I., Jurik, M.: A generalisation, a simplification and some applications of paillier’s probabilistic public-key system. In: PKC, pp. 90–104 (2001)
Fouque, P., Poupard, G., Stern, J.: Sharing decryption in the context of voting or lotteries. In: Frankel, Y. (ed.) FC 2000. LNCS, vol. 1962, pp. 90–104. Springer, Heidelberg (2001)
Freedman, M., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1–19. Springer, Heidelberg (2004)
Frikken, K.: Privacy-preserving set union. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 237–252. Springer, Heidelberg (2007)
Heckman, J.: Sample selection bias as a specification error. Econometrica: Journal of the econometric society, 153–161 (1979)
Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE TKDE 16(9), 1026–1037 (2004)
Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241–257. Springer, Heidelberg (2005)
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography (1996)
Paillier, P.: Public key cryptosystem based on composite degree residue classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)
Raeder, T., Blanton, M., Chawla, N., Frikken, K.: Privacy-preserving network aggregation. Technical Report TR-2010-02, Notre Dame Computer Science and Engineering (2010)
Raeder, T., Chawla, N.: Modeling a store’s product space as a social network. In: Proceedings of ASONAM, Athens, Greece (2009)
Raith, M.: A general model of information sharing in oligopoly. Journal of Economic Theory 71(1), 260–288 (1996)
Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: Proceedings of KDD 2002, pp. 639–644. ACM, New York (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raeder, T., Blanton, M., Chawla, N.V., Frikken, K. (2010). Privacy-Preserving Network Aggregation. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2010. Lecture Notes in Computer Science(), vol 6118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13657-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-13657-3_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13656-6
Online ISBN: 978-3-642-13657-3
eBook Packages: Computer ScienceComputer Science (R0)