Privacy Preserving Semi-supervised Learning for Labeled Graphs

  • Hiromi Arai
  • Jun Sakuma
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6911)


We propose a novel privacy preserving learning algorithm that achieves semi-supervised learning in graphs. In real world networks, such as disease infection over individuals, links (contact) and labels (infection) are often highly sensitive information. Although traditional semi-supervised learning methods play an important role in network data analysis, they fail to protect such sensitive information. Our solutions enable to predict labels of partially labeled graphs without disclosure of labels and links, by incorporating cryptographic techniques into the label propagation algorithm. Even when labels included in the graph are kept private, the accuracy of our PPLP is equivalent to that of label propagation which is allowed to observe all labels in the graph. Empirical analysis showed that our solution is scalable compared with existing privacy preserving methods. The results with human contact networks showed that our protocol takes only about 10 seconds for computation and no sensitive information is disclosed through the protocol execution.


privacy preserving data mining semi-supervised learning 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bearman, P., Moody, J., Stovel, K.: Chains of affection: The structure of adolescent romantic and sexual networks. American J. of Sociology 110(1), 44–91 (2004)CrossRefGoogle Scholar
  2. 2.
    Dåmgard, I., Jurik, M.: A Generalisation, a Simplification and Some Applications of Paillier’s Probabilistic Public-Key System. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 119–136. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Damgård, I.B., Koprowski, M.: Practical threshold RSA signatures without a trusted dealer. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 152–165. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Duan, Y., Wang, J., Kam, M., Canny, J.: Privacy preserving link analysis on dynamic weighted graph. Comp. & Math. Organization Theory 11(2), 141–159 (2005)CrossRefzbMATHGoogle Scholar
  5. 5.
    Eagle, N., Pentland, A., Lazer, D.: Inferring social network structure using mobile phone data. In: PNAS (2007)Google Scholar
  6. 6.
    Goldreich, O.: Foundations of cryptography: Basic applications. Cambridge University Press, Cambridge (2004)CrossRefzbMATHGoogle Scholar
  7. 7.
    Goldschlag, D., Reed, M., Syverson, P.: Onion routing. Communications of the ACM 42(2), 39–41 (1999)CrossRefGoogle Scholar
  8. 8.
    Joachims, T.: Transductive inference for text classification using support vector machines. In: Proc. ICML (1999)Google Scholar
  9. 9.
    Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay: secure two-party computation system. In: Proc. of the 13th USENIX Security Symposium, pp. 287–302 (2004)Google Scholar
  10. 10.
    Sakuma, J., Kobayashi, S.: Link analysis for private weighted graphs. In: Proceedings of the 32nd International ACM SIGIR, pp. 235–242. ACM, New York (2009)Google Scholar
  11. 11.
    Sakuma, J., Kobayashi, S., Wright, R.: Privacy-preserving reinforcement learning. In: Proceedings of the 25th International Conference on Machine Learning, pp. 864–871. ACM, New York (2008)Google Scholar
  12. 12.
    Weston, J., Leslie, C., Ie, E., Zhou, D., Elisseeff, A., Noble, W.: Semi-supervised protein classification using cluster kernels. Bioinformatics 21(15), 3241–3247 (2005) CrossRefGoogle Scholar
  13. 13.
    Yao, A.: How to generate and exchange secrets. In: Proc. of the 27th IEEE Annual Symposium on Foundations of Computer Science, pp. 162–167 (1986)Google Scholar
  14. 14.
    Zhou, D., Bousquet, O., Lal, T., Weston, J., Schölkopf, B.: Learning with local and global consistency. In: Advances in Neural Information Processing Systems 16: Proceedings of the 2003 Conference, pp. 595–602 (2004)Google Scholar
  15. 15.
    Zhu, X., Ghahramani, Z., Lafferty, J.: Semi-supervised learning using gaussian fields and harmonic functions. In: ICML (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Hiromi Arai
    • 1
  • Jun Sakuma
    • 1
    • 2
  1. 1.Department of Computer ScienceUniversity of TsukubaTsukubaJapan
  2. 2.Japan Science and Technology AgencyChiyoda-kuJapan

Personalised recommendations