Practical Privacy-Preserving Multiparty Linear Programming Based on Problem Transformation

Jannik Dreier; Florian Kerschbaum

doi:10.1109/PASSAT/SocialCom.2011.19

Practical Privacy-Preserving Multiparty Linear Programming Based on Problem Transformation

Jannik Dreier ¹ Florian Kerschbaum ²

1 CASSIS - Combination of approaches to the security of infinite states systems

FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods

2 SAP AG [Germany]

Abstract : Cryptographic solutions to privacy-preserving multi-party linear programming are slow. This makes them unsuitable for many economically important applications, such as supply chain optimization, whose size exceeds their practically feasible input range. In this paper we present a privacy-preserving transformation that allows secure outsourcing of the linear program computation in an efficient manner. We evaluate security by quantifying the leakage about the input after the transformation and present implementation results. Using this transformation, we can mostly replace the costly cryptographic operations and securely solve problems several orders of magnitude larger.

Document type :

Conference papers

Domain :

Computer Science [cs] / Cryptography and Security [cs.CR]

Liste complète des métadonnées

Cited literature [23 references] Display Hide Download

https://hal.archives-ouvertes.fr/hal-01338043
Contributor : Jannik Dreier <>
Submitted on : Monday, June 27, 2016 - 5:12:27 PM
Last modification on : Tuesday, December 18, 2018 - 4:38:25 PM

passat2011.pdf

Files produced by the author(s)

Practical Privacy-Preserving Multiparty Linear Programming Based on Problem Transformation

File

Identifiers

Collections

Citation

Export

Metrics

196

182

Contact

Practical Privacy-Preserving Multiparty Linear Programming Based on Problem Transformation

File

Identifiers

Collections

Citation

Export

Share

Metrics

196

182

Contact