Collaboratively solving the traveling salesman problem with limited disclosure

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

Volumn 8566 LNCS, Issue , 2014, Pages 179-194

  Hong, Yuan ^a   Vaidya, Jaideep ^b   Lu, Haibing ^c   Wang, Lingyu ^d  

^a STATE UNIVERSITY OF NEW YORK   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c SANTA CLARA UNIVERSITY   (United States)

^d Dept of Electrical and Computer Engineering   (Canada)

Author keywords

Optimization; Privacy; Secure Multiparty Computation

Indexed keywords

COMBINATORIAL OPTIMIZATION; CRYPTOGRAPHY; DATA PRIVACY; INFORMATION DISSEMINATION; OPTIMIZATION; TRAVELING SALESMAN PROBLEM;

COLLABORATIVE OPTIMIZATION; COMBINATORIAL OPTIMIZATION PROBLEMS; EFFICIENT PROTOCOLS; OPTIMIZATION STUDIES; PRIVATE INFORMATION; PROPRIETARY INFORMATION; RESOURCE CONSTRAINT; SECURE MULTI-PARTY COMPUTATION;

PROBLEM SOLVING;

EID: 84958534926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-43936-4_12     Document Type: Conference Paper

References (32)

1. Sakuma, J., Kobayashi, S.: A genetic algorithm for privacy preserving combinatorial optimization. In: GECCO, pp. 1372-1379 (2007)
2. Clifton, C., Iyer, A., Cho, R., Jiang, W., Kantarcioglu, M., Vaidya, J.: An approach to identifying beneficial collaboration securely in decentralized logistics systems. Management & Service Operations Management 10(1) (2008)
3. Hong, Y., Vaidya, J., Lu, H.: Secure and efficient distributed linear programming. Journal of Computer Security 20(5), 583-634 (2012)
4. Hong, Y., Vaidya, J., Lu, H., Shafiq, B.: Privacy-preserving tabu search for distributed graph coloring. In: SocialCom/PASSAT, pp. 951-958 (2011)
5. Hong, Y., Vaidya, J., Wang, S.: A survey of privacy-aware supply chain collaboration: From theory to applications. Journal of Information Systems (to appear, 2014)
6. http://www.math.uwaterloo.ca/tsp/
7. Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pp. 162-167. IEEE Computer Society, Los Alamitos (1986)
8. Goldreich, O.: Encryption Schemes. In: The Foundations of Cryptography, vol. 2. Cambridge University Press (2004)
9. Li, J., Atallah, M.J.: Secure and private collaborative linear programming. In: Proceedings of the 2nd International Conference on Collaborative Computing: Networking, Applications and Worksharing, November 17-20, pp. 1-8 (2006)
10. Vaidya, J.: A secure revised simplex algorithm for privacy-preserving linear programming. In: AINA 2009: Proceedings of the 23rd IEEE International Conference on Advanced Information Networking and Applications (2009)
11. Catrina, O., de Hoogh, S.: Secure multiparty linear programming using fixed-point arithmetic. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol. 6345, pp. 134-150. Springer, Heidelberg (2010)
12. Du, W.: A Study of Several Specific Secure Two-party Computation Problems. PhD thesis, Purdue University, West Lafayette, Indiana (2001)
13. Vaidya, J.: Privacy-preserving linear programming. In: SAC, pp. 2002-2007 (2009)
14. Bednarz, A., Bean, N., Roughan, M.: Hiccups on the road to privacy-preserving linear programming. In: Proceedings of the 8th ACM Workshop on Privacy in the Electronic Society, WPES 2009, pp. 117-120. ACM, New York (2009)
15. Bednarz, A.: Methods for Two-party Privacy-preserving Linear Programming. PhD thesis, The University of Adelaide, Adelaide, Australia (2012)
16. Hong, Y., Vaidya, J., Lu, H.: Efficient distributed linear programming with limited disclosure. In: Li, Y. (ed.) DBSec 2011. LNCS, vol. 6818, pp. 170-185. Springer, Heidelberg (2011)
17. Mangasarian, O.L.: Privacy-preserving horizontally partitioned linear programs. Optimization Letters 6(3), 431-436 (2012)
18. Mangasarian, O.L.: Privacy-preserving linear programming. Optimization Letters 5(1), 165-172 (2011)
19. Li, W., Li, H., Deng, C.: Privacy-preserving horizontally partitioned linear programs with inequality constraints. Optimization Letters 7(1), 137-144 (2013)
20. Hong, Y., Vaidya, J.: An inference-proof approach to privacy-preserving horizontally partitioned linear programs. Optimization Letters 8(1), 267-277 (2014)
21. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game-a completeness theorem for protocols with honest majority. In: Proceedings of the 19th ACM Symposium on the Theory of Computing, pp. 218-229. ACM, New York (1987)
22. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 1-10 (1998)
23. Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Prentice-Hall, Inc., Upper Saddle River (1982)
24. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671-680 (1983)
25. Croes, G.A.: A method for solving traveling salesman problems. Operations Research 6(6), 791-812 (1958)
26. 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)
27. Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. The Journal of Chemical Physics 21, 1087 (1953)
28. Ben-David, A., Nisan, N., Pinkas, B.: Fairplaymp: a system for secure multi-party computation. In: Proceedings of the 15th ACM Conference on Computer and Communications Security, CCS 2008, pp. 257-266. ACM, New York (2008)
29. Ioannidis, I., Grama, A.: An efficient protocol for yao's millionaires' problem. In: Hawaii International Conference on System Sciences (HICSS-36), Waikoloa Village, Hawaii, January 6-9, pp. 205-210 (2003)
30. Kim, B.-I., Shim, J.-I., Zhang, M.: Comparison of tsp algorithms. In: Project for Models in Facilities Planning and Materials Handling (1998)
31. Bogdanov, D., Laur, S., Willemson, J.: Sharemind: A framework for fast privacy-preserving computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 192-206. Springer, Heidelberg (2008)
32. Zhang, Y., Steele, A., Blanton, M.: Picco: a general-purpose compiler for private distributed computation. In: ACM Conference on Computer and Communications Security, pp. 813-826 (2013)