Hiccups on the road to privacy-preserving linear programming

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2009, Pages 117-120

  Bednarz, Alice ^a   Bean, Nigel ^a   Roughan, Matthew ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

Linear programming; Secure distributed computing; Secure multiparty computation; Transformation based methods

Indexed keywords

CRITICAL FLAW; DISTRIBUTED COMPUTING; JOINT OPTIMIZATION; PRIVACY LEGISLATION; PRIVACY PRESERVING; PROBLEM OF PRIVACY; SECRET DATA; SECURE MULTI-PARTY COMPUTATION; SENSITIVE DATAS;

COMPUTER PRIVACY; CRYPTOGRAPHY; DATA PRIVACY; DYNAMIC PROGRAMMING; LINEAR TRANSFORMATIONS; LINEARIZATION; NETWORK SECURITY; OPTIMIZATION;

LINEAR PROGRAMMING;

EID: 74049112591     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1655188.1655207     Document Type: Conference Paper

References (18)

1. P. Bogetoft, D. L. Christensen, I. Damgard, M. Geisler, T. Jakobsen, M. Krøigaard, J. D. Nielsen, J. B. Nielsen, K. Nielsen, J. Pager, M. Schwartzbach, and T. Toft. Multiparty computation goes live. Available at http://www.sikkerhed.alexandra.dk/uk/projects/ simap/MPCannouncement.pdf, 2008.
2. R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. European Transactions on Telecommunications, 8(5):481-490, 1997.
3. G. Dantzig. Linear programming and extensions. Princeton Univ Pr, 1963.
4. W. Du. A study of several specific secure two-party computation problems. PhD thesis, Purdue University, Indiana, 2001.
5. O. Goldreich, S. Micali, and A. Wigderson. How to play ANY mental game. Proceedings of the 19th annual ACM conference on Theory of Computing, pages 218-229, 1987.
6. T. Kaczorek. Positive 1D and 2D systems. Springer, 2002.
7. N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4(4):373-395, 1984.
8. J. Li and M. Atallah. Secure and private collaborative linear programming. In Proceedings of International Conference on Collaborative Computing, pages 1-8, 2006.
9. Y. Lindell and B. Pinkas. Privacy preserving data mining. Journal of Cryptology, 15(3):177-206, March 2002.
10. M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In Proceedings of the 1st ACM Conference on Electronic Commerce, pages 129-139. ACM New York, 1999.
11. T. Toft. Primitives and Applications for Multi-party Computation. PhD thesis, University of Aarhus, Denmark, 2007.
12. T. Toft. Solving linear programs using multiparty computation. In Financial Cryptography and Data Security '09, Barbados, 2009.
13. J. Vaidya. Privacy-preserving linear programming. In Proceedings of the 2009 ACM symposium on Applied Computing, pages 2002-2007. ACM New York, NY, USA, 2009.
14. J. Vaidya. A secure revised simplex algorithm for privacy-preserving linear programming. In International Conference on Advanced Information Networking and Applications, pages 347-354, 2009.
15. J. Vaidya, C. Clifton, and M. Zu. Privacy Preserving Data Mining. Springer Science+Business Media, Inc., 2006.
16. R. J. Vanderbei. Linear Programming: Foundations and Extensions. Kluwer Academic Publishers, 1996.
17. A. Yao. Protocols for secure computations. Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pages 160-164, 1982.
18. A. Yao. How to generate and exchange secrets. Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pages 162-167, 1986.