Privacy-preserving network aggregation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6118 LNAI, Issue PART 1, 2010, Pages 198-207

  Raeder, Troy ^a,b   Blanton, Marina ^b   Chawla, Nitesh V ^a,b   Frikken, Keith ^c  

^a UNIVERSITY OF NOTRE DAME   (United States)

^b University of Notre Dame   (United States)

^c MIAMI UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCIAL ENTITY; INDIVIDUAL NETWORK; LARGE NETWORKS; MALICIOUS ADVERSARIES; NETWORK AGGREGATION; NON-TRIVIAL; PRIVACY PRESERVATION; PRIVACY PRESERVING; PRIVATE NETWORKS; UNDERLYING NETWORKS; WEIGHTED NETWORKS;

DATA MINING;

EID: 79956304773     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13657-3_23     Document Type: Conference Paper

References (15)

1. Chawla, N.V., Karakoulas, G.: Learning from labeled and unlabeled data: An empirical study across techniques and domains. JAIR 23, 331-366 (2005) (Pubitemid 41525872)
2. 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)
3. Damgard, I., Jurik, M.: A generalisation, a simplification and some applications of paillier's probabilistic public-key system. In: PKC, pp. 90-104 (2001)
4. 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) (Pubitemid 33359599)
5. 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)
6. Frikken, K.: Privacy-preserving set union. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 237-252. Springer, Heidelberg (2007)
7. Heckman, J.: Sample selection bias as a specification error. Econometrica: Journal of the econometric society, 153-161 (1979)
8. Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE TKDE 16(9), 1026-1037 (2004)
9. Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241-257. Springer, Heidelberg (2005) (Pubitemid 43902117)
10. Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography (1996)
11. 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)
12. Raeder, T., Blanton, M., Chawla, N., Frikken, K.: Privacy-preserving network aggregation. Technical Report TR-2010-02, Notre Dame Computer Science and Engineering (2010)
13. Raeder, T., Chawla, N.: Modeling a store's product space as a social network. In: Proceedings of ASONAM, Athens, Greece (2009)
14. Raith, M.: A general model of information sharing in oligopoly. Journal of Economic Theory 71(1), 260-288 (1996) (Pubitemid 126166581)
15. 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)