Practical Secure and Efficient Multiparty Linear Programming Based on Problem Transformation - Archive ouverte HAL Access content directly
Reports (Technical Report) Year : 2011

Practical Secure and Efficient Multiparty Linear Programming Based on Problem Transformation

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.
Fichier principal
Vignette du fichier
108.pdf (324.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01338046 , version 1 (27-06-2016)

Identifiers

  • HAL Id : hal-01338046 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More