New Attacks against Transformation-Based Privacy-Preserving Linear Programming

  • Peeter Laud
  • Alisa Pankova
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8203)

Abstract

In this paper we demonstrate a number of attacks against proposed protocols for privacy-preserving linear programming, based on publishing and solving a transformed version of the problem instance. Our attacks exploit the geometric structure of the problem, which has mostly been overlooked in the previous analyses and is largely preserved by the proposed transformations. The attacks are efficient in practice and cast serious doubt to the viability of transformation-based approaches in general.

Keywords

Cryptanalysis Secure multiparty computation Linear programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bednarz, A.: Methods for two-party privacy-preserving linear programming. PhD thesis, University of Adelaide (2012)Google Scholar
  2. 2.
    Bednarz, A., Bean, N., Roughan, M.: Hiccups on the road to privacy-preserving linear programming. In: Proceedings of the 8th ACM workshop on Privacy in the Electronic Society, WPES 2009, pp. 117–120. ACM, New York (2009)Google Scholar
  3. 3.
    Dreier, J., Kerschbaum, F.: Practical privacy-preserving multiparty linear programming based on problem transformation. In: SocialCom/PASSAT, pp. 916–924. IEEE (2011)Google Scholar
  4. 4.
    Du., W.: A Study Of Several Specific Secure Two-Party Computation Problems. PhD thesis, Purdue University (2001)Google Scholar
  5. 5.
    Du, W., Zhan, Z.: A practical approach to solve secure multi-party computation problems. In: New Security Paradigms Workshop, pp. 127–135. ACM Press (2002)Google Scholar
  6. 6.
    Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270–299 (1984)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Hong, Y., Vaidya, J.: An inference-proof approach to privacy-preserving horizontally partitioned linear programs. In: Optimization Letters (to appear, 2013) (published online October 05, 2012)Google Scholar
  8. 8.
    Hong, Y., Vaidya, J., Lu, H.: Secure and efficient distributed linear programming. Journal of Computer Security 20(5), 583–634 (2012)Google Scholar
  9. 9.
    Li, J., Atallah, M.J.: Secure and private collaborative linear programming. In: International Conference on Collaborative Computing, pp. 1–8 (2006)Google Scholar
  10. 10.
    Li, W., Li, H., Deng, C.: Privacy-preserving horizontally partitioned linear programs with inequality constraints. Optimization Letters 7(1), 137–144 (2013)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Mangasarian, O.L.: Privacy-preserving linear programming. Optimization Letters 5(1), 165–172 (2011)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Mangasarian, O.L.: Privacy-preserving horizontally partitioned linear programs. Optimization Letters 6(3), 431–436 (2012)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Stein, W.A., et al.: Sage Mathematics Software (Version 5.10). The Sage Development Team (2013), http://www.sagemath.org
  14. 14.
    Toft, T.: Solving linear programs using multiparty computation. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 90–107. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  15. 15.
    Vaidya, J.: Privacy-preserving linear programming. In: Shin, S.Y., Ossowski, S. (eds.) SAC, pp. 2002–2007. ACM (2009)Google Scholar
  16. 16.
    Wang, C., Ren, K., Wang, J.: Secure and practical outsourcing of linear programming in cloud computing. In: 2011 Proceedings IEEE INFOCOM, pp. 820–828 (2011)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Peeter Laud
    • 1
  • Alisa Pankova
    • 1
    • 2
    • 3
  1. 1.Cybernetica ASEstonia
  2. 2.Software Technology and Applications Competence Centre (STACC)Estonia
  3. 3.Institute of Computer ScienceUniversity of TartuEstonia

Personalised recommendations