{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T14:10:02Z","timestamp":1746281402862,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439357"},{"type":"electronic","value":"9783662439364"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43936-4_12","type":"book-chapter","created":{"date-parts":[[2014,6,27]],"date-time":"2014-06-27T12:05:04Z","timestamp":1403870704000},"page":"179-194","source":"Crossref","is-referenced-by-count":3,"title":["Collaboratively Solving the Traveling Salesman Problem with Limited Disclosure"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaideep","family":"Vaidya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibing","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Sakuma, J., Kobayashi, S.: A genetic algorithm for privacy preserving combinatorial optimization. In: GECCO, pp. 1372\u20131379 (2007)","DOI":"10.1145\/1276958.1277214"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"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\u00a010(1) (2008)","DOI":"10.1287\/msom.1070.0167"},{"issue":"5","key":"12_CR3","doi-asserted-by":"crossref","first-page":"583","DOI":"10.3233\/JCS-2012-0452","volume":"20","author":"Y. Hong","year":"2012","unstructured":"Hong, Y., Vaidya, J., Lu, H.: Secure and efficient distributed linear programming. Journal of Computer Security\u00a020(5), 583\u2013634 (2012)","journal-title":"Journal of Computer Security"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Hong, Y., Vaidya, J., Lu, H., Shafiq, B.: Privacy-preserving tabu search for distributed graph coloring. In: SocialCom\/PASSAT, pp. 951\u2013958 (2011)","DOI":"10.1109\/PASSAT\/SocialCom.2011.116"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.2308\/isys-50692"},{"key":"12_CR6","unstructured":"http:\/\/www.math.uwaterloo.ca\/tsp\/"},{"key":"12_CR7","first-page":"162","volume-title":"Proceedings of the 27th IEEE Symposium on Foundations of Computer Science","author":"A.C. Yao","year":"1986","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE Computer Society, Los Alamitos (1986)"},{"key":"12_CR8","unstructured":"Goldreich, O.: Encryption Schemes. In: The Foundations of Cryptography, vol.\u00a02. Cambridge University Press (2004)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"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\u20138 (2006)","DOI":"10.1109\/COLCOM.2006.361848"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/AINA.2009.133"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-15497-3_9","volume-title":"Computer Security \u2013 ESORICS 2010","author":"O. Catrina","year":"2010","unstructured":"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.\u00a06345, pp. 134\u2013150. Springer, Heidelberg (2010)"},{"key":"12_CR12","unstructured":"Du, W.: A Study of Several Specific Secure Two-party Computation Problems. PhD thesis, Purdue University, West Lafayette, Indiana (2001)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Vaidya, J.: Privacy-preserving linear programming. In: SAC, pp. 2002\u20132007 (2009)","DOI":"10.1145\/1529282.1529729"},{"key":"12_CR14","first-page":"117","volume-title":"Proceedings of the 8th ACM Workshop on Privacy in the Electronic Society, WPES 2009","author":"A. Bednarz","year":"2009","unstructured":"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\u2013120. ACM, New York (2009)"},{"key":"12_CR15","unstructured":"Bednarz, A.: Methods for Two-party Privacy-preserving Linear Programming. PhD thesis, The University of Adelaide, Adelaide, Australia (2012)"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-22348-8_14","volume-title":"Data and Applications Security and Privacy XXV","author":"Y. Hong","year":"2011","unstructured":"Hong, Y., Vaidya, J., Lu, H.: Efficient distributed linear programming with limited disclosure. In: Li, Y. (ed.) DBSec 2011. LNCS, vol.\u00a06818, pp. 170\u2013185. Springer, Heidelberg (2011)"},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s11590-010-0268-9","volume":"6","author":"O.L. Mangasarian","year":"2012","unstructured":"Mangasarian, O.L.: Privacy-preserving horizontally partitioned linear programs. Optimization Letters\u00a06(3), 431\u2013436 (2012)","journal-title":"Optimization Letters"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s11590-010-0199-5","volume":"5","author":"O.L. Mangasarian","year":"2011","unstructured":"Mangasarian, O.L.: Privacy-preserving linear programming. Optimization Letters\u00a05(1), 165\u2013172 (2011)","journal-title":"Optimization Letters"},{"issue":"1","key":"12_CR19","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s11590-011-0403-2","volume":"7","author":"W. Li","year":"2013","unstructured":"Li, W., Li, H., Deng, C.: Privacy-preserving horizontally partitioned linear programs with inequality constraints. Optimization Letters\u00a07(1), 137\u2013144 (2013)","journal-title":"Optimization Letters"},{"issue":"1","key":"12_CR20","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s11590-012-0572-7","volume":"8","author":"Y. Hong","year":"2014","unstructured":"Hong, Y., Vaidya, J.: An inference-proof approach to privacy-preserving horizontally partitioned linear programs. Optimization Letters\u00a08(1), 267\u2013277 (2014)","journal-title":"Optimization Letters"},{"key":"12_CR21","first-page":"218","volume-title":"Proceedings of the 19th ACM Symposium on the Theory of Computing","author":"O. Goldreich","year":"1987","unstructured":"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\u2013229. ACM, New York (1987)"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"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\u201310 (1998)","DOI":"10.1145\/62212.62213"},{"key":"12_CR23","volume-title":"Combinatorial optimization: algorithms and complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Prentice-Hall, Inc., Upper Saddle River (1982)"},{"issue":"4598","key":"12_CR24","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"6","key":"12_CR25","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G.A. Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling salesman problems. Operations Research\u00a06(6), 791\u2013812 (1958)","journal-title":"Operations Research"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"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\u00a021, 1087 (1953)","journal-title":"The Journal of Chemical Physics"},{"key":"12_CR28","first-page":"257","volume-title":"Proceedings of the 15th ACM Conference on Computer and Communications Security, CCS 2008","author":"A. Ben-David","year":"2008","unstructured":"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\u2013266. ACM, New York (2008)"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Ioannidis, I., Grama, A.: An efficient protocol for yao\u2019s millionaires\u2019 problem. In: Hawaii International Conference on System Sciences (HICSS-36), Waikoloa Village, Hawaii, January 6-9, pp. 205\u2013210 (2003)","DOI":"10.1109\/HICSS.2003.1174464"},{"key":"12_CR30","unstructured":"Kim, B.-I., Shim, J.-I., Zhang, M.: Comparison of tsp algorithms. In: Project for Models in Facilities Planning and Materials Handling (1998)"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-88313-5_13","volume-title":"Computer Security - ESORICS 2008","author":"D. Bogdanov","year":"2008","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: A framework for fast privacy-preserving computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol.\u00a05283, pp. 192\u2013206. Springer, Heidelberg (2008)"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"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\u2013826 (2013)","DOI":"10.1145\/2508859.2516752"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XXVIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43936-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T13:48:53Z","timestamp":1746280133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43936-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439357","9783662439364"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43936-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}