{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T04:45:04Z","timestamp":1770439504057,"version":"3.49.0"},"reference-count":104,"publisher":"American Accounting Association","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6,1]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n               <jats:p>In the contemporary information era, the ubiquitous collection of data from different parties frequently accommodates significant mutual benefits to the involved participants. However, data is a double-bladed sword. Inappropriate access or use of data by the recipients may pose serious privacy issues that explicitly harm the data owners. In the past decade, swiftly increasing privacy concerns arise in many business processes such as supply chain management. How to protect the private information of different participants in the supply chain has become a key multidisciplinary research problem in information systems, production and operations management, computer science, and mathematics. Specifically, in the real world, manufacturers, distributors, and retailers commonly collaborate with each other to cater to the demands of supplying and marketing. In their traditional cooperation, all the parties completely share their proprietary information so as to jointly optimize their operations (e.g., maximize their profit or minimize their cost). Now, they realize that completely sharing such information would bring considerable negative impact to themselves. For overcoming this, some recent research results begin to make the following ideal occasion possible\u2014all the participants collaboratively solve a realistic problem without revealing any private proprietary information to each other.<\/jats:p>\n               <jats:p>In this paper, we primarily review the literature on the applications of privacy-preserving techniques to supply chain collaboration among multiple parties. We first identify various private proprietary information required in the supply chain collaboration, and discuss several potential privacy-preserving techniques. Then, we review the relevant research results from theory to applications. Since intensive collaboration in modern supply chains opens even more opportunities in both academia and industry, we finally outline the future research trend and the potential challenges in this promising area.<\/jats:p>","DOI":"10.2308\/isys-50692","type":"journal-article","created":{"date-parts":[[2013,12,27]],"date-time":"2013-12-27T23:51:13Z","timestamp":1388188273000},"page":"243-268","source":"Crossref","is-referenced-by-count":25,"title":["A Survey of Privacy-Aware Supply Chain Collaboration: From Theory to Applications"],"prefix":"10.2308","volume":"28","author":[{"given":"Yuan","family":"Hong","sequence":"first","affiliation":[{"name":"University at Albany, SUNY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaideep","family":"Vaidya","sequence":"additional","affiliation":[{"name":"Rutgers, The State University of New Jersey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengbin","family":"Wang","sequence":"additional","affiliation":[{"name":"North Carolina A&T State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1112","published-online":{"date-parts":[[2013,12,1]]},"reference":[{"key":"2024082915385203400_i1558-7959-28-1-243-Agrawal1","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1145\/335191.335438","article-title":"Privacy-preserving data mining","author":"Agrawal","year":"2000","journal-title":"Proceedings of the ACM SIGMOD Conference on Management of Data"},{"key":"2024082915385203400_i1558-7959-28-1-243-Atallah1","article-title":"Secure supply-chain protocols","author":"Atallah","year":"2003","journal-title":"Proceedings of the 2003 IEEE International Conference on E-Commerce"},{"key":"2024082915385203400_i1558-7959-28-1-243-Atallah2","article-title":"Secure supply-chain collaboration","author":"Atallah","year":"2004"},{"key":"2024082915385203400_i1558-7959-28-1-243-Atallah3","first-page":"296","article-title":"Efficient correlated action selection","author":"Atallah","year":"2006","journal-title":"Proceedings of Financial Cryptography"},{"key":"2024082915385203400_i1558-7959-28-1-243-Awerbuch1","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1109\/SFCS.1994.365690","article-title":"Local optimization of global objectives: Competitive distributed deadlock resolution and resource allocation","author":"Awerbuch","year":"1994","journal-title":"Proceedings of IEEE Symposium on Foundations of Computer Science"},{"key":"2024082915385203400_i1558-7959-28-1-243-Baltzan1","unstructured":"Baltzan, P. \n          \n          2011. Business Driven Information Systems. Boston, MA: McGraw-Hill\/Irwin."},{"issue":"1","key":"2024082915385203400_i1558-7959-28-1-243-Bandyopadhyay1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s10799-010-0066-1","article-title":"Information security in networked supply chains: Impact of network vulnerability and supply chain integration on incentives to invest","volume":"11","author":"Bandyopadhyay","year":"2010","journal-title":"Information Technology and Management"},{"issue":"2","key":"2024082915385203400_i1558-7959-28-1-243-Barany1","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1287\/moor.17.2.327","article-title":"Fair distribution protocols or how the players replace fortune","volume":"17","author":"Barany","year":"1992","journal-title":"Mathematics of Operations Research"},{"issue":"6","key":"2024082915385203400_i1558-7959-28-1-243-Bartal1","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1137\/S0097539700379383","article-title":"Fast, distributed approximation algorithms for positive linear programming with applications to flow control","volume":"33","author":"Bartal","year":"2004","journal-title":"SIAM Journal on Computing"},{"key":"2024082915385203400_i1558-7959-28-1-243-Bednarz1","first-page":"117","article-title":"Hiccups on the road to privacy-preserving linear programming","author":"Bednarz","year":"2009","journal-title":"Proceedings of the 8th ACM Workshop on Privacy in the Electronic Society"},{"key":"2024082915385203400_i1558-7959-28-1-243-Bednarz2","unstructured":"Bednarz, A. \n          \n          2012. Methods for Two-Party Privacy-Preserving Linear Programming. Ph.D. thesis, University of Adelaide."},{"key":"2024082915385203400_i1558-7959-28-1-243-BenOr1","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/167088.167109","article-title":"Asynchronous secure computation","author":"Ben-Or","year":"1993","journal-title":"Proceedings of Twenty-Fifth Annual ACM Symposium on Theory of Computing"},{"key":"2024082915385203400_i1558-7959-28-1-243-BenOr2","first-page":"1","article-title":"Completeness theorems for non-cryptographic fault-tolerant distributed computation","author":"Ben-Or","year":"1998","journal-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing"},{"issue":"1","key":"2024082915385203400_i1558-7959-28-1-243-BenPorath1","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1006\/jeth.1998.2397","article-title":"Correlation without mediation: Expanding the set of equilibrium outcomes by \u201ccheap\u201d pre-play procedures","volume":"80","author":"Ben-Porath","year":"1998","journal-title":"Journal of Economic Theory"},{"key":"2024082915385203400_i1558-7959-28-1-243-Benaloh1","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1145\/195058.195407","article-title":"Receipt-free secret-ballot elections (extended abstract)","author":"Benaloh","year":"1994","journal-title":"STOC \u201894: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing"},{"issue":"3","key":"2024082915385203400_i1558-7959-28-1-243-Brailsford1","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/S0377-2217(98)00364-6","article-title":"Constraint satisfaction problems: Algorithms and applications","volume":"119","author":"Brailsford","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"2024082915385203400_i1558-7959-28-1-243-Buss1","article-title":"Case study: Land O'Lakes and collaborative logistics","author":"Buss","year":"2003"},{"issue":"6","key":"2024082915385203400_i1558-7959-28-1-243-Cachon1","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1287\/mnsc.1060.0510","article-title":"Procuring fast delivery: Sole sourcing with information asymmetry","volume":"52","author":"Cachon","year":"2006","journal-title":"Management Science"},{"key":"2024082915385203400_i1558-7959-28-1-243-Canetti1","first-page":"504","article-title":"Incoercible multiparty computation","author":"Canetti","year":"1996","journal-title":"FOCS \u201896: Proceedings of the 37th Annual Symposium on Foundations of Computer Science"},{"key":"2024082915385203400_i1558-7959-28-1-243-Canetti2","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1145\/509907.509980","article-title":"Universally composable two-party and multi-party secure computation","author":"Canetti","year":"2002","journal-title":"STOC \u201802: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing"},{"issue":"2","key":"2024082915385203400_i1558-7959-28-1-243-Canetti3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s00145-005-0419-9","article-title":"On the limitations of universally composable two-party computation without set-up assumptions","volume":"19","author":"Canetti","year":"2006","journal-title":"Journal of Cryptology"},{"key":"2024082915385203400_i1558-7959-28-1-243-Catrina1","first-page":"134","article-title":"Secure multiparty linear programming using fixed-point arithmetic","author":"Catrina","year":"2010","journal-title":"Proceedings of the 15th European Symposium on Research in Computer Security"},{"key":"2024082915385203400_i1558-7959-28-1-243-Chaum1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/62212.62214","article-title":"Multiparty unconditionally secure protocols","author":"Chaum","year":"1988","journal-title":"STOC \u201888: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing"},{"key":"2024082915385203400_i1558-7959-28-1-243-Chen1","first-page":"105","article-title":"Secure multi-party collaboration systems in supply chain management","author":"Chen","year":"2011","journal-title":"Proceedings of the 1st International Conference on Logistics, Informatics and Service Science"},{"issue":"1","key":"2024082915385203400_i1558-7959-28-1-243-Clifton1","doi-asserted-by":"crossref","first-page":"108\u2013","DOI":"10.1287\/msom.1070.0167","article-title":"An approach to identifying beneficial collaboration securely in decentralized logistics systems","volume":"10","author":"Clifton","year":"2008","journal-title":"Manufacturing & Service Operations Management"},{"key":"2024082915385203400_i1558-7959-28-1-243-Dantzig1","doi-asserted-by":"crossref","unstructured":"Dantzig, G. \n          \n          1963. Linear Programming and Extensions. Princeton, NJ: Princeton University Press.","DOI":"10.7249\/R366"},{"issue":"1","key":"2024082915385203400_i1558-7959-28-1-243-Daughety1","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.geb.2006.03.001","article-title":"Competition and confidentiality: Signaling quality in a duopoly when there is universal private information","volume":"58","author":"Daughety","year":"2007","journal-title":"Games and Economic Behavior"},{"key":"2024082915385203400_i1558-7959-28-1-243-Deshpande1","unstructured":"Deshpande, V., and L. B. Schwarz. \n          2005. Optimal Capacity Choice and Allocation in Decentralized Supply Chains. Working paper, Purdue University."},{"issue":"2","key":"2024082915385203400_i1558-7959-28-1-243-Deshpande2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1111\/j.1937-5956.2010.01188.x","article-title":"Outsourcing manufacturing: Secure price-masking mechanisms for purchasing component parts","volume":"20","author":"Deshpande","year":"2011","journal-title":"Production and Operations Management"},{"key":"2024082915385203400_i1558-7959-28-1-243-Dodis1","first-page":"112","article-title":"A cryptographic solution to a game theoretic problem","author":"Dodis","year":"2000","journal-title":"CRYPTO \u201800: Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology"},{"key":"2024082915385203400_i1558-7959-28-1-243-Dreier1","first-page":"916","article-title":"Practical privacy-preserving multi- party linear programming based on problem transformation","author":"Dreier","year":"2011","journal-title":"Proceedings of the Third IEEE International Conference on Privacy, Security, Risk and Trust"},{"key":"2024082915385203400_i1558-7959-28-1-243-Du1","unstructured":"Du, W. \n          \n          2001. A Study of Several Specific Secure Two-Party Computation Problems. Ph.D. thesis. West Lafayette, IN: Purdue University."},{"key":"2024082915385203400_i1558-7959-28-1-243-Dwork1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-79228-4_1","article-title":"Differential privacy: A survey of results","volume":"4978","author":"Dwork","year":"2008","journal-title":"Theory and Applications of Models of Computation"},{"key":"2024082915385203400_i1558-7959-28-1-243-Evfimievski1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/775047.775080","article-title":"Privacy preserving mining of association rules","author":"Evfimievski","year":"2002","journal-title":"Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"2024082915385203400_i1558-7959-28-1-243-Fischer1","first-page":"99","article-title":"An application of game theoretic techniques to cryptography","volume":"13","author":"Fischer","year":"1993","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"issue":"2","key":"2024082915385203400_i1558-7959-28-1-243-GalOr1","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1287\/isre.1050.0053","article-title":"The economic incentives for sharing security information","volume":"16","author":"Gal-Or","year":"2005","journal-title":"Information Systems Research"},{"issue":"1","key":"2024082915385203400_i1558-7959-28-1-243-Gerardi1","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/S0022-0531(03)00124-8","article-title":"Unmediated communication in games with complete and incomplete information","volume":"114","author":"Gerardi","year":"2004","journal-title":"Journal of Economic Theory"},{"key":"2024082915385203400_i1558-7959-28-1-243-Goldreich1","first-page":"218","article-title":"How to play any mental game or a completeness theorem for protocols with honest majority","author":"Goldreich","year":"1987","journal-title":"Proceedings of the 19th ACM Symposium on Theory of Computing"},{"key":"2024082915385203400_i1558-7959-28-1-243-Goldreich2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656.002","article-title":"Chapter 5: Encryption schemes","author":"Goldreich","year":"2004","journal-title":"The Foundations of Cryptography, Volume 2"},{"key":"2024082915385203400_i1558-7959-28-1-243-Goldwasser1","first-page":"77","article-title":"Fair computation of general functions in presence of immoral majority","author":"Goldwasser","year":"1991","journal-title":"CRYPTO \u201890: Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology"},{"key":"2024082915385203400_i1558-7959-28-1-243-He1","first-page":"647","article-title":"Preserving privacy in social networks: A structure-aware approach","author":"He","year":"2009","journal-title":"Proceedings of the 8th International Conference on Web Intelligence"},{"key":"2024082915385203400_i1558-7959-28-1-243-Hong1","first-page":"1465","article-title":"Effective anonymization of query logs","author":"Hong","year":"2009","journal-title":"Proceedings of the 18th ACM Conference on Information and Knowledge Management"},{"key":"2024082915385203400_i1558-7959-28-1-243-Hong2","first-page":"170","article-title":"Efficient distributed linear programming with limited disclosure","author":"Hong","year":"2011","journal-title":"Proceedings of the 25th Annual IFIP WG 1.3 Conference on Data and Applications Security and Privacy"},{"key":"2024082915385203400_i1558-7959-28-1-243-Hong3","first-page":"951","article-title":"Privacy-preserving tabu search for distributed graph coloring","author":"Hong","year":"2011","journal-title":"Proceedings of the Third IEEE International Conference on Privacy, Security, Risk and Trust"},{"issue":"5","key":"2024082915385203400_i1558-7959-28-1-243-Hong4","doi-asserted-by":"crossref","first-page":"583","DOI":"10.3233\/JCS-2012-0452","article-title":"Secure and efficient distributed linear programming","volume":"20","author":"Hong","year":"2012","journal-title":"Journal of Computer Security"},{"key":"2024082915385203400_i1558-7959-28-1-243-Hong5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/2247596.2247604","article-title":"Differentially private search log sanitization with optimal output utility","author":"Hong","year":"2012","journal-title":"Proceedings of the 15th International Conference on Extending Database Technology"},{"key":"2024082915385203400_i1558-7959-28-1-243-Hong6","unstructured":"Hong, Y. \n          \n          2013. Privacy-Preserving Collaborative Optimization. Ph.D. thesis, Rutgers, The State University of New Jersey."},{"issue":"1","key":"2024082915385203400_i1558-7959-28-1-243-Hong7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s11590-012-0572-7","article-title":"An inference-proof approach to privacy-preserving horizontally partitioned linear programs","volume":"8","author":"Hong","year":"2013","journal-title":"Optimization Letters"},{"key":"2024082915385203400_i1558-7959-28-1-243-Hong8","article-title":"Secure transformation for multiparty linear programming","author":"Hong","year":"2013","journal-title":"Rutgers Technical Report"},{"key":"2024082915385203400_i1558-7959-28-1-243-Kantarcioglu1","first-page":"599","article-title":"When do data mining results violate privacy?","author":"Kantarcioglu","year":"2004","journal-title":"Proceedings of the 2004 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"issue":"1","key":"2024082915385203400_i1558-7959-28-1-243-Kayis1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/msom.1120.0395","article-title":"Delegation vs. control of component procurement under asymmetric cost information and simple contracts","volume":"15","author":"Kayis","year":"2013","journal-title":"Manufacturing and Service Operations Management"},{"issue":"1","key":"2024082915385203400_i1558-7959-28-1-243-Kim1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/mnsc.1120.1573","article-title":"Collaborative cost reduction and component procurement under information asymmetry","volume":"59","author":"Kim","year":"2013","journal-title":"Management Science"},{"issue":"4598","key":"2024082915385203400_i1558-7959-28-1-243-Kirkpatrick1","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"2024082915385203400_i1558-7959-28-1-243-Kushilevitz1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/1132516.1132532","article-title":"Information-theoretically secure protocols and security under composition","author":"Kushilevitz","year":"2006","journal-title":"STOC \u201806: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing"},{"key":"2024082915385203400_i1558-7959-28-1-243-Lepinski1","first-page":"1","article-title":"Completely fair SFE and coalition-safe cheap talk","author":"Lepinski","year":"2004","journal-title":"PODC \u201804: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing"},{"issue":"3","key":"2024082915385203400_i1558-7959-28-1-243-Li1","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1287\/msom.1080.0232","article-title":"Second sourcing vs. sole sourcing with capacity investment and asymmetric information","volume":"11","author":"Li","year":"2009","journal-title":"Manufacturing & Service Operations Management"},{"key":"2024082915385203400_i1558-7959-28-1-243-Li2","first-page":"1","article-title":"Secure and private collaborative linear programming","author":"Li","year":"2006","journal-title":"Proceedings of the 2nd International Conference on Collaborative Computing: Networking, Applications and Worksharing"},{"issue":"8","key":"2024082915385203400_i1558-7959-28-1-243-Li3","doi-asserted-by":"crossref","first-page":"1467","DOI":"10.1287\/mnsc.1070.0851","article-title":"Confidentiality and information sharing in supply chain coordination","volume":"54","author":"Li","year":"2008","journal-title":"Management Science"},{"issue":"1","key":"2024082915385203400_i1558-7959-28-1-243-Li4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s11590-011-0403-2","article-title":"Privacy-preserving horizontally partitioned linear programs with inequality constraints","volume":"7","author":"Li","year":"2013","journal-title":"Optimization Letters"},{"issue":"5","key":"2024082915385203400_i1558-7959-28-1-243-Lim1","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1287\/mnsc.47.5.709.10479","article-title":"Producer-supplier contracts with incomplete information","volume":"47","author":"Lim","year":"2001","journal-title":"Management Science"},{"issue":"1","key":"2024082915385203400_i1558-7959-28-1-243-Lin1","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/s10115-004-0148-7","article-title":"Privacy preserving clustering with distributed EM mixture modeling","volume":"8","author":"Lin","year":"2005","journal-title":"Knowledge and Information Systems"},{"key":"2024082915385203400_i1558-7959-28-1-243-Lindell1","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/509907.509982","article-title":"On the composition of authenticated byzantine agreement","author":"Lindell","year":"2002","journal-title":"STOC \u201802: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing"},{"key":"2024082915385203400_i1558-7959-28-1-243-Lindell2","doi-asserted-by":"crossref","unstructured":"Lindell, Y. \n          \n          2003\n          a. Composition of Secure Multi-Party Protocols\u2014A Comprehensive Study, Volume 2815 of Lecture Notes in Computer Science. New York, NY: Springer-Verlag.","DOI":"10.1007\/b13246"},{"key":"2024082915385203400_i1558-7959-28-1-243-Lindell3","first-page":"394","article-title":"General composition and universal composability in secure multiparty computation","author":"Lindell","year":"2003","journal-title":"Proceedings of the 44th Symposium on Foundations of Computer Science"},{"key":"2024082915385203400_i1558-7959-28-1-243-Mailler1","first-page":"438","article-title":"Solving distributed constraint optimization problems using cooperative mediation","author":"Mailler","year":"2004","journal-title":"Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems"},{"issue":"1","key":"2024082915385203400_i1558-7959-28-1-243-Mangasarian1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s11590-010-0199-5","article-title":"Privacy-preserving linear programming","volume":"5","author":"Mangasarian","year":"2011","journal-title":"Optimization Letters"},{"issue":"3","key":"2024082915385203400_i1558-7959-28-1-243-Mangasarian2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s11590-010-0268-9","article-title":"Privacy-preserving horizontally partitioned linear programs","volume":"6","author":"Mangasarian","year":"2012","journal-title":"Optimization Letters"},{"key":"2024082915385203400_i1558-7959-28-1-243-Matsuura1","article-title":"Information security and economics in computer networks: An interdisciplinary survey and a proposal of integrated optimization of investment","author":"Matsuura","year":"2003","journal-title":"Proceedings of the 9th International Conference of Computing in Economics and Finance"},{"issue":"5","key":"2024082915385203400_i1558-7959-28-1-243-Meixell1","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1111\/j.1475-3995.2011.00817.x","article-title":"Integrating carrier selection with supplier selection decisions to improve supply chain security","volume":"19","author":"Meixell","year":"2012","journal-title":"International Transactions in Operations Research"},{"key":"2024082915385203400_i1558-7959-28-1-243-Mielikainen1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-30214-8_17","article-title":"Privacy problems with anonymized transaction databases","volume":"3245","author":"Mielikainen","year":"2004","journal-title":"In Discovery Science: 7th International Conference Proceedings, Lecture Notes in Computer Science, Volume"},{"issue":"7","key":"2024082915385203400_i1558-7959-28-1-243-Miller1","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1287\/mnsc.1090.1014","article-title":"Privacy protection and technology diffusion: The case of electronic medical records","volume":"55","author":"Miller","year":"2009","journal-title":"Management Science"},{"key":"2024082915385203400_i1558-7959-28-1-243-Modi1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/860575.860602","article-title":"An asynchronous complete method for distributed constraint optimization","author":"Modi","year":"2003","journal-title":"AAMAS \u201803: Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems"},{"key":"2024082915385203400_i1558-7959-28-1-243-Ostrovsky1","first-page":"51","article-title":"How to withstand mobile virus attacks (extended abstract)","author":"Ostrovsky","year":"1991","journal-title":"PODC \u201891: Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing"},{"issue":"2","key":"2024082915385203400_i1558-7959-28-1-243-Ozener1","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/trsc.1070.0219","article-title":"Allocating costs in a collaborative transportation procurement network","volume":"42","author":"\u00d6zener","year":"2008","journal-title":"Transportation Science"},{"key":"2024082915385203400_i1558-7959-28-1-243-Papadimitriou1","unstructured":"Papadimitriou, C. H., and K. Steiglitz. \n          1982. Combinatorial Optimization: Algorithms and Complexity. Upper Saddle River, NJ: Prentice-Hall."},{"key":"2024082915385203400_i1558-7959-28-1-243-Papadimitriou2","first-page":"61","article-title":"On the value of information in distributed decision-making (extended abstract)","author":"Papadimitriou","year":"1991","journal-title":"PODC \u201891: Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing"},{"key":"2024082915385203400_i1558-7959-28-1-243-Papadimitriou3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/167088.167127","article-title":"Linear programming without the matrix","author":"Papadimitriou","year":"1993","journal-title":"STOC \u201893: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing"},{"key":"2024082915385203400_i1558-7959-28-1-243-Petcu1","article-title":"Approximations in distributed optimization","author":"Petcu","year":"2005","journal-title":"Proceedings of CP05\u2014Workshop on Distributed and Speculative Constraint Processing (DSCP)"},{"key":"2024082915385203400_i1558-7959-28-1-243-Petcu2","article-title":"An efficient constraint optimization method for large multiagent systems","author":"Petcu","year":"2005","journal-title":"Proceedings of AAMAS05\u2014LSMAS Workshop"},{"key":"2024082915385203400_i1558-7959-28-1-243-Petcu3","article-title":"Incentive compatible multiagent constraint optimization","author":"Petcu","year":"2005","journal-title":"Proceedings of WINE'05: Workshop on Internet and Network Economics"},{"key":"2024082915385203400_i1558-7959-28-1-243-Petcu4","article-title":"Optimal solution stability in continuous time optimization","author":"Petcu","year":"2005","journal-title":"Proceedings of IJCAI05\u2014Distributed Constraint Reasoning Workshop (DCR05)"},{"key":"2024082915385203400_i1558-7959-28-1-243-Petcu5","first-page":"266","article-title":"A scalable method for multiagent constraint optimization","author":"Petcu","year":"2005","journal-title":"Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05)"},{"key":"2024082915385203400_i1558-7959-28-1-243-Petcu6","first-page":"449","article-title":"Superstabilizing, fault-containing multiagent combinatorial optimization","author":"Petcu","year":"2005","journal-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI-05)"},{"key":"2024082915385203400_i1558-7959-28-1-243-Petcu7","article-title":"Distributed generator maintenance scheduling","author":"Petcu","year":"2006","journal-title":"Proceedings of the First International ICSC Symposium on Artificial Intelligence in Energy Systems and Power"},{"issue":"1","key":"2024082915385203400_i1558-7959-28-1-243-Ren1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1287\/opre.1090.0750","article-title":"Information sharing in a long-term supply chain relationship: The role of customer review strategy","volume":"58","author":"Ren","year":"2010","journal-title":"Operations Research"},{"key":"2024082915385203400_i1558-7959-28-1-243-Sakuma1","first-page":"1372","article-title":"A genetic algorithm for privacy preserving combinatorial optimization","author":"Sakuma","year":"2007","journal-title":"Proceedings of 2007 Genetic and Evolutionary Computation Conference"},{"key":"2024082915385203400_i1558-7959-28-1-243-Silaghi1","first-page":"531","article-title":"Distributed constraint satisfaction and optimization with privacy enforcement","author":"Silaghi","year":"2004","journal-title":"Proceedings of IEEE\/WIC\/ACM International Conference on Intelligent Agent Technology"},{"key":"2024082915385203400_i1558-7959-28-1-243-Silaghi2","first-page":"1396","article-title":"The effect of policies for selecting the solution of a DisCSP on privacy loss","author":"Silaghi","year":"2004","journal-title":"Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems"},{"key":"2024082915385203400_i1558-7959-28-1-243-Silaghi3","article-title":"Secure combinatorial optimization simulating DFS tree-based variable elimination","author":"Silaghi","year":"2006","journal-title":"Proceedings of the 9th Symposium on Artificial Intelligence and Mathematics"},{"issue":"11","key":"2024082915385203400_i1558-7959-28-1-243-Smith1","doi-asserted-by":"crossref","first-page":"2595","DOI":"10.1080\/00207540601020544","article-title":"A critical balance: Collaboration and security in the IT-enabled supply chain","volume":"45","author":"Smith","year":"2007","journal-title":"International Journal of Production Research"},{"key":"2024082915385203400_i1558-7959-28-1-243-Suzuki1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-540-45126-6_17","article-title":"Secure generalized Vickrey auction using homomorphic encryption","volume":"2742","author":"Suzuki","year":"2003","journal-title":"Financial Cryptography"},{"issue":"5","key":"2024082915385203400_i1558-7959-28-1-243-Sweeney1","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","article-title":"K-anonymity: A model for protecting privacy","volume":"10","author":"Sweeney","year":"2002","journal-title":"International Journal on Uncertainty, Fuzziness and Knowledge-Based Systems"},{"key":"2024082915385203400_i1558-7959-28-1-243-Teague1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/978-3-540-27809-2_20","article-title":"Selecting correlated random actions","author":"Teague","year":"2004","journal-title":"Proceedings of Financial Cryptography"},{"key":"2024082915385203400_i1558-7959-28-1-243-Turban1","article-title":"Chapter 2: Information technologies: Concepts and management","author":"Turban","year":"2005","journal-title":"Introduction to Information Technology. 3rd Edition"},{"key":"2024082915385203400_i1558-7959-28-1-243-Vaidya1","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/956750.956776","article-title":"Privacy-preserving k-means clustering over vertically partitioned data","author":"Vaidya","year":"2003","journal-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"2024082915385203400_i1558-7959-28-1-243-Vaidya2","first-page":"2002","article-title":"Privacy-preserving linear programming","author":"Vaidya","year":"2009","journal-title":"Proceedings of the 24th Annual ACM Symposium on Applied Computing"},{"key":"2024082915385203400_i1558-7959-28-1-243-Vaidya3","first-page":"347","article-title":"A secure revised simplex algorithm for privacy-preserving linear programming","author":"Vaidya","year":"2009","journal-title":"AINA \u201809: Proceedings of the 23rd IEEE International Conference on Advanced Information Networking and Applications"},{"key":"2024082915385203400_i1558-7959-28-1-243-Yao1","first-page":"162","article-title":"How to generate and exchange secrets","author":"Yao","year":"1986","journal-title":"Proceedings of the 27th IEEE Symposium on Foundations of Computer Science"},{"key":"2024082915385203400_i1558-7959-28-1-243-Yokoo1","first-page":"614","article-title":"Distributed constraint satisfaction for formalizing distributed problem solving","author":"Yokoo","year":"1992","journal-title":"In Proceedings of International Conference on Distributed Computing Systems"},{"key":"2024082915385203400_i1558-7959-28-1-243-Yokoo2","article-title":"Distributed breakout algorithm for solving distributed constraint satisfaction problems","author":"Yokoo","year":"1995","journal-title":"Proceedings of the First International Conference on Multi-Agent Systems"},{"key":"2024082915385203400_i1558-7959-28-1-243-Yokoo3","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/3-540-46135-3_26","article-title":"Secure distributed constraint satisfaction: Reaching agreement without revealing private information","author":"Yokoo","year":"2002","journal-title":"Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP-2002)"},{"issue":"6","key":"2024082915385203400_i1558-7959-28-1-243-Zeng1","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.compind.2012.05.001","article-title":"Secure collaboration in global design and supply chain environment: Problem analysis and literature review","volume":"63","author":"Zeng","year":"2012","journal-title":"Computers in Industry"},{"key":"2024082915385203400_i1558-7959-28-1-243-Zhang1","first-page":"1158","article-title":"Distributed breakout algorithm for distributed constraint optimization problems\u2014DBArelax","author":"Zhang","year":"2003","journal-title":"Proceedings of the International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS-03)"},{"key":"2024082915385203400_i1558-7959-28-1-243-Zhang2","doi-asserted-by":"crossref","DOI":"10.2139\/ssrn.1537826","article-title":"Procurement control against supply chain upstream risk and inefficiency","author":"Zhang","year":"2010"}],"container-title":["Journal of Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/publications.aaahq.org\/jis\/article-pdf\/28\/1\/243\/11856\/isys-50692.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/publications.aaahq.org\/jis\/article-pdf\/28\/1\/243\/11856\/isys-50692.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T17:29:58Z","timestamp":1724952598000},"score":1,"resource":{"primary":{"URL":"https:\/\/publications.aaahq.org\/jis\/article\/28\/1\/243\/1577\/A-Survey-of-Privacy-Aware-Supply-Chain"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,1]]},"references-count":104,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2013,12,1]]},"published-print":{"date-parts":[[2014,6,1]]}},"URL":"https:\/\/doi.org\/10.2308\/isys-50692","relation":{},"ISSN":["1558-7959","0888-7985"],"issn-type":[{"value":"1558-7959","type":"electronic"},{"value":"0888-7985","type":"print"}],"subject":[],"published":{"date-parts":[[2013,12,1]]}}}