Cryptology ePrint Archive: Report 2013/355

New Attacks against Transformation-Based Privacy-Preserving Linear Programming

Peeter Laud and Alisa Pankova

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.

Category / Keywords: applications / cryptanalysis, linear programming

Date: received 7 Jun 2013

Contact author: peeter laud at cyber ee

Available format(s): PDF | BibTeX Citation

Version: 20130610:125544 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]