Paper 2011/108 Original: eprint.iacr.org/2011/108 ↗
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 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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2011-03-05: last updated
- 2011-03-05: published
- Short URL
- https://ia.cr/2011/108
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/108,
author = {Jannik Dreier and Florian Kerschbaum},
title = {Practical Secure and Efficient Multiparty Linear Programming Based on Problem Transformation},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/108},
year = {2011},
url = {https://eprint.iacr.org/2011/108}
}