You are looking at a specific version 20130610:125544 of this paper. See the latest version.

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
cryptanalysislinear programming
Contact author(s)
peeter laud @ cyber ee
History
2013-06-10: received
Short URL
https://ia.cr/2013/355
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.