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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bednarz, A.: Methods for two-party privacy-preserving linear programming. PhD thesis, University of Adelaide (2012)
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)
Dreier, J., Kerschbaum, F.: Practical privacy-preserving multiparty linear programming based on problem transformation. In: SocialCom/PASSAT, pp. 916–924. IEEE (2011)
Du., W.: A Study Of Several Specific Secure Two-Party Computation Problems. PhD thesis, Purdue University (2001)
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)
Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270–299 (1984)
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)
Hong, Y., Vaidya, J., Lu, H.: Secure and efficient distributed linear programming. Journal of Computer Security 20(5), 583–634 (2012)
Li, J., Atallah, M.J.: Secure and private collaborative linear programming. In: International Conference on Collaborative Computing, pp. 1–8 (2006)
Li, W., Li, H., Deng, C.: Privacy-preserving horizontally partitioned linear programs with inequality constraints. Optimization Letters 7(1), 137–144 (2013)
Mangasarian, O.L.: Privacy-preserving linear programming. Optimization Letters 5(1), 165–172 (2011)
Mangasarian, O.L.: Privacy-preserving horizontally partitioned linear programs. Optimization Letters 6(3), 431–436 (2012)
Stein, W.A., et al.: Sage Mathematics Software (Version 5.10). The Sage Development Team (2013), http://www.sagemath.org
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)
Vaidya, J.: Privacy-preserving linear programming. In: Shin, S.Y., Ossowski, S. (eds.) SAC, pp. 2002–2007. ACM (2009)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laud, P., Pankova, A. (2013). New Attacks against Transformation-Based Privacy-Preserving Linear Programming. In: Accorsi, R., Ranise, S. (eds) Security and Trust Management. STM 2013. Lecture Notes in Computer Science, vol 8203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41098-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-41098-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41097-0
Online ISBN: 978-3-642-41098-7
eBook Packages: Computer ScienceComputer Science (R0)