M. J. Atallah and K. B. Frikken, Securely outsourcing linear algebra computations, Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, ASIACCS '10, 2010.
DOI : 10.1145/1755688.1755695

A. Bednarz, N. Bean, and M. Roughan, Hiccups on the road to privacy-preserving linear programming, Proceedings of the 8th ACM workshop on Privacy in the electronic society, WPES '09, 2009.
DOI : 10.1145/1655188.1655207

M. Ben-or, S. Goldwasser, and A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, 1988.
DOI : 10.1145/62212.62213

C. Braun, K. Chatzikokoladis, and C. Palamidessi, Quantitative Notions of Leakage for One-try Attacks, Electronic Notes in Theoretical Computer Science, vol.249, 2009.
DOI : 10.1016/j.entcs.2009.07.085
URL : https://hal.archives-ouvertes.fr/inria-00424852

H. Braun, Optimization with grid computing. Presentation at the Workshop on Cyber Infrastructure in Chemical and Biological Systems, 2006.

O. Catrina and S. De-hoogh, Secure Multiparty Linear Programming Using Fixed-Point Arithmetic, Proceedings of the 15th European Symposium on Research in Computer Security, 2010.
DOI : 10.1007/978-3-642-15497-3_9

J. Dreier and F. Kerschbaum, Practical Secure and Efficient Multiparty Linear Programming Based on Problem Transformation. Cryptology ePrint Archive, Report, vol.108108, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01338046

W. Du and M. J. Atallah, Privacy-preserving cooperative scientific computations, Proceedings of the 14th IEEE workshop on Computer Security Foundations, 2001.

O. Goldreich, S. Micali, and A. Wigderson, How to play ANY mental game, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, 1987.
DOI : 10.1145/28395.28420

T. Kaczorek, Positive 1D and 2D systems, 2002.
DOI : 10.1007/978-1-4471-0221-2

E. Kiltz, G. Leander, and J. Malone-lee, Secure Computation of the Mean and Related Statistics, Proceedings of the 2nd Theory of Cryptography Conference, 2005.
DOI : 10.1007/978-3-540-30576-7_16

V. Klee and G. J. Minty, How good is the simplex algorithm? Inequalities, 1972.

J. Li and M. Atallah, Secure and Private Collaborative Linear Programming, 2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing, 2006.
DOI : 10.1109/COLCOM.2006.361848

O. L. Mangasarian, Privacy-Preserving Horizontally- Partitioned Linear Programs. Data Mining Institute Technical Report 10-02, 2010.

O. L. Mangasarian, Privacy-Preserving Linear Programming . Data Mining Institute Technical Report 10-01, 2010.

R. Pibernik and E. Sucky, An approach to inter-domain master planning in supply chains, International Journal of Production Economics, vol.108, issue.1-2, 2007.
DOI : 10.1016/j.ijpe.2006.12.010

A. Shamir, How to share a secret, Communications of the ACM, vol.22, issue.11, 1979.
DOI : 10.1145/359168.359176

G. Sierksma, Linear and Integer Programming: Theory and Practice, 1996.
DOI : 10.1201/b16939

G. Smith, On the Foundations of Quantitative Information Flow, Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures, 2009.
DOI : 10.1137/060651380

H. Stadler and C. Klinger, Supply chain management and advanced planning, 2002.

T. Toft, Solving Linear Programs Using Multiparty Computation, Proceedings of the 13th International Conference on Financial Cryptography and Data Security, 2009.
DOI : 10.1007/978-3-642-03549-4_6

J. Vaidya, Privacy-preserving linear programming, Proceedings of the 2009 ACM symposium on Applied Computing, SAC '09, 2009.
DOI : 10.1145/1529282.1529729

M. Wibmer, D. Biswas, and F. Kerschbaum, Leakage Quantification of Cryptographic Protocols, The 5th International Symposium on Information Security Protocols for Secure Computations. Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, 1982.