New Attacks against Transformation-Based Privacy-Preserving Linear Programming

Peeter Laud; Alisa Pankova

Paper 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.

Metadata

Available format(s): PDF
Category: Applications
Publication info: Published elsewhere. Unknown where it was published
Keywords: cryptanalysis linear programming
Contact author(s): peeter laud @ cyber ee
History: 2013-06-10: received
Short URL: https://ia.cr/2013/355
License: CC BY

BibTeX

@misc{cryptoeprint:2013/355,
      author = {Peeter Laud and Alisa Pankova},
      title = {New Attacks against Transformation-Based Privacy-Preserving Linear Programming},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/355},
      year = {2013},
      url = {https://eprint.iacr.org/2013/355}
}