2009 20th International Workshop on Database and Expert Systems Applications (2009)
Aug. 31, 2009 to Sept. 4, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DEXA.2009.32
Although information sharing in supply chain management dramatically reduces costs, parties are reluctant to do so, mainly due to fear of information leakage. Solutions based on secure multi-party computation guarantee privacy and correctness, at an extra communication and computation cost. Efficiency is a major concern for practical solutions. The best known solution with public indexes selection is due to Li and Atallah. It has the drawback of requiring a secure permutation on every round of the protocol, which turns to be very expensive. We therefore, propose a probability-based technique to reduce the number of secure permutations required by such solution, improving overall practical performance.
linear programming, secure multi-party computation, supply-chain optimization
Rafael Deitos, Florian Kerschbaum, "Improving Practical Performance on Secure and Private Collaborative Linear Programming", 2009 20th International Workshop on Database and Expert Systems Applications, vol. 00, no. , pp. 122-126, 2009, doi:10.1109/DEXA.2009.32