Practical Privacy-Preserving Multiparty Linear Programming Based on Problem Transformation - Archive ouverte HAL
Conference Papers Year : 2011

Practical Privacy-Preserving Multiparty Linear Programming Based on Problem Transformation

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

Dates and versions

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

Identifiers

Cite

Jannik Dreier, Florian Kerschbaum. Practical Privacy-Preserving Multiparty Linear Programming Based on Problem Transformation. Third IEEE International Conference on Information Privacy, Security, Risk and Trust (PASSAT'11), IEEE, Oct 2011, Boston, United States. ⟨10.1109/PASSAT/SocialCom.2011.19⟩. ⟨hal-01338043⟩
103 View
297 Download

Altmetric

Share

More