Practical privacy-preserving multiparty linear programming based on problem transformation

Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011

Volumn , Issue , 2011, Pages 916-924

  Dreier, Jannik ^a   Kerschbaum, Florian ^b  

^a CNRS   (France)

^b SAP RESEARCH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC OPERATIONS; LINEAR PROGRAMS; ORDERS OF MAGNITUDE; PRIVACY PRESERVING; SUPPLY CHAIN OPTIMIZATION;

CRYPTOGRAPHY; LINEAR PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; SUPPLY CHAINS;

LINEAR TRANSFORMATIONS;

EID: 84856170890     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PASSAT/SocialCom.2011.19     Document Type: Conference Paper

References (25)

1. M. J. Atallah, K. B. Frikken. Securely outsourcing linear algebra computations. Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, 2010.
2. M. J. Atallah, K. N. Pantazopoulos, J. R. Rice, E. H. Spafford. Secure outsourcing of scientific computations. Advances in Computers, 2002.
3. A. Bednarz, N. Bean, M. Roughan. Hiccups on the road to privacy-preserving linear programming. Proceedings of the 8th ACM Workshop on Privacy in the Electronic Society, 2009.
4. M. Ben-Or, S. Goldwasser, A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proceedings of the 20th ACM Symposium on Theory of Computing, 1988.
5. C. Braun, K. Chatzikokoladis, C. Palamidessi. Quantitative notions of leakage for one-try attacks. Electronic Notes in Theoretical Computer Science (ENTCS), 2009.
6. H. Braun. Optimization with grid computing. Presentation at the Workshop on Cyber Infrastructure in Chemical and Biological Systems. Available at http://oit.ucla.edu/nsfci/presentations/braun.ppt, 2006.
7. O. Catrina, S. de Hoogh. Secure multiparty linear programming using fixed-point arithmetic. Proceedings of the 15th European Symposium on Research in Computer Security, 2010.
8. J. Dreier, F. Kerschbaum. Practical Secure and Efficient Multiparty Linear Programming Based on Problem Transformation. Cryptology ePrint Archive: Report 2011/108, Available at http://eprint.iacr.org/2011/108, 2011.
9. W. Du, M. J. Atallah. Privacy-preserving cooperative scientific computations. Proceedings of the 14th IEEE workshop on Computer Security Foundations, 2001.
10. O. Goldreich, S. Micali, A. Wigderson. How to play any mental game. Proceedings of the 19th ACM Symposium on Theory of Computing, 1987.
11. T. Kaczorek. Positive 1D and 2D systems. Springer, 2002.
12. E. Kiltz, G. Leander, J. Malone-Lee. Secure computation of the mean and related statistics. Proceedings of the 2nd Theory of Cryptography Conference, 2005.
13. V. Klee, G. J. Minty. How good is the simplex algorithm? Inequalities, Vol. III, 1972.
14. J. Li, M. Atallah. Secure and private collaborative linear programming. Proceedings of the 2nd IEEE Conference on Collaborative Computing, 2006.
15. O. L. Mangasarian. Privacy-Preserving Horizontally- Partitioned Linear Programs. Data Mining Institute Technical Report 10-02, Available at ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/10-02.pdf 2010.
16. O. L. Mangasarian. Privacy-Preserving Linear Programming. Data Mining Institute Technical Report 10-01, Available at ftp://ftp.cs.wisc.edu/pub/dmi/ techreports/10-01.pdf, 2010.
17. R. Pibernik, E. Sucky. An approach to inter-domain master planning in supply chains. International Journal of Production Economics 108, 2007.
18. A. Shamir. How to share a secret. Communications of the ACM, 1979.
19. G. Sierksma. Linear and Integer Programming: Theory and Practice. Marcel Dekker, Inc., 1996.
20. G. Smith. On the Foundations of Quantitative Information Flow. Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures, 2009.
21. H. Stadler, C. Klinger. Supply chain management and advanced planning. Springer, 2002.
22. T. Toft. Solving linear programs using multiparty computation. Proceedings of the 13th International Conference on Financial Cryptography and Data Security, 2009.
23. J. Vaidya. Privacy-preserving linear programming. Proceedings of the 24th ACM Symposium on Applied Computing, 2009.
24. M. Wibmer, D. Biswas, F. Kerschbaum. Leakage Quantification of Cryptographic Protocols. The 5th International Symposium on Information Security, 2010.
25. A. Yao. Protocols for Secure Computations. Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, 1982.