This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 20th International Workshop on Database and Expert Systems Application
Improving Practical Performance on Secure and Private Collaborative Linear Programming
Linz, Austria
August 31-September 04
ISBN: 978-0-7695-3763-4
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.
Index Terms:
linear programming, secure multi-party computation, supply-chain optimization
Citation:
Rafael Deitos, Florian Kerschbaum, "Improving Practical Performance on Secure and Private Collaborative Linear Programming," dexa, pp.122-126, 2009 20th International Workshop on Database and Expert Systems Application, 2009
Usage of this product signifies your acceptance of the Terms of Use.