Practical Secure and Efficient Multiparty Linear Programming Based on Problem Transformation

Jannik Dreier 1 Florian Kerschbaum 2
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
Abstract : Cryptographic solutions to privacy-preserving multiparty 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 out-sourcing 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 :
Reports
Liste complète des métadonnées

Cited literature [24 references]  Display  Hide  Download

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

File

108.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01338046, version 1

Citation

Jannik Dreier, Florian Kerschbaum. Practical Secure and Efficient Multiparty Linear Programming Based on Problem Transformation. [Technical Report] IACR Cryptology ePrint Archive. 2011. ⟨hal-01338046⟩

Share

Metrics

Record views

237

Files downloads

117