Solving linear programs using multiparty computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5628 LNCS, Issue , 2009, Pages 90-107

  Toft, Tomas ^a,b  

^a CWI   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Linear programming; Multiparty computation; Secure collaboration

Indexed keywords

BLACK BOXES; INPUT DATAS; LINEAR PROGRAMS; MODULO ARITHMETIC; MULTIPARTY COMPUTATION; PRIVACY PRESERVING; SECURE COLLABORATION; SIMPLEX METHODS; TWO-PARTY PROTOCOLS;

COMPUTATIONAL EFFICIENCY; CRYPTOGRAPHY; DYNAMIC PROGRAMMING; INFORMATION THEORY; LINEAR PROGRAMMING; LINEARIZATION; NETWORK PROTOCOLS; NETWORK SECURITY; OPTIMIZATION;

PROBLEM SOLVING;

EID: 70350349546     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03549-4_6     Document Type: Conference Paper

References (26)

1. Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In: Rudnicki, P. (ed.) Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, pp. 201-209. ACM Press, New York (1989)
2. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: 20th Annual ACM Symposium on Theory of Computing, pp. 1-10. ACM Press, New York (1988)
3. Bogetoft, P., Nielsen, K.: Dea based auctions. European Journal of Operational Research 184(2), 685-700 (2008)
4. Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: 20th Annual ACM Symposium on Theory of Computing, pp. 11-19. ACM Press, New York (1988)
5. Cramer, R., Damgård, I., Nielsen, J.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 280-300. Springer, Heidelberg (2001)
6. Chvátal, V.: Linear Programming. W.H. Freeman, New York (1983)
7. Damgård, I., Fitzi, M., Kiltz, E., Nielsen, J., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 285-304. Springer, Heidelberg (2006)
8. Damgård, I., Jurik, M.: A generalization, a simplification and some applications of Paillier's probabilistic public-key system. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 110-136. Springer, Heidelberg (2001)
9. Damgård, I., Nielsen, J.: Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 247-264. Springer, Heidelberg (2003)
10. Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M., Wright, R.: Secure multiparty computation of approximations. ACM Transactions on Algorithms 2(3), 435-472 (2006)
11. Fouque, P., Stern, J., Wackers, G.: CryptoComputing with rationals. In: Financial Cryptography 2002. LNCS. Springer, Berlin (2002)
12. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC 1987: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 218-229. ACM Press, New York (1987)
13. Goemans, M.: Linear programming. Course notes (October 1994), http://www-math.mit.edu/~goemans/notes-lp.ps
14. Jájá, J.: An Introduction to Parallel Algorithms. Addison-Wesley, Reading (1992)
15. Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373-395 (1984)
16. Khachiyan, L.: A polynomial algorithm in linear programming. Soviet Mathematics Doklady 20 (1979)
17. Li, J., Atallah, M.: Secure and private collaborative linear programming. In: Collaborative Computing: Networking, Applications and Worksharing, 2006. CollaborateCom (2006)
18. Nishide, T., Ohta, K.: Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 343-360. Springer, Heidelberg (2007)
19. Nielsen, K., Toft, T.: Secure relative performance scheme. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 396-403. Springer, Heidelberg (2007)
20. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223-238. Springer, Heidelberg (1999)
21. Rosenberg, G.: Enumeration of all extreme equlibria of bimatrix games with integer pivoting and improved degeneracy check, CDAM Research Report LSE-CDAM-2005-18 (2005), http://www.cdam.lse.ac.uk/Reports/Abstracts/cdam-2005- 18.html
22. Reistad, T., Toft, T.: Secret sharing comparison by transformation and rotation. In: Proceedings of the International Conference on Information Theoretic Security (ICITS) 2007. LNCS. Springer, Heidelberg (2007) (to appear)
23. Silaghi, M., Faltings, B., Petcu, A.: Secure combinatorial optimization simulating dfs tree-based variable elimination. In: AI and Math 2006 Proceedings (2006), http://anytime.cs.umass.edu/aimath06/proceedings.html
24. Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612-613 (1979)
25. Silaghi, M.: A suite of secure multi-party computation algorithms for solving distributed constraint satisfaction and optimization problems. Technical Report CS-2004-04, Florida Institute of Technology (2004)
26. Yao, A.: How to generate and exchange secrets. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pp. 162-167 (1986)