HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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 :
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

Contributor : Jannik Dreier Connect in order to contact the contributor
Submitted on : Monday, June 27, 2016 - 5:15:00 PM
Last modification on : Friday, January 21, 2022 - 3:08:58 AM


Files produced by the author(s)


  • HAL Id : hal-01338046, version 1


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



Record views


Files downloads