The basic objective of collaborative supply chain planning (CSCP) is to fulfill the demand of the customers by integrating a network of organizations through mediums such as internet. But, the supply chain (SC) partners are often reluctant to share their strategic information. The exchange of relevant strategic information yet maintaining privacy is a challenging issue for CSCP. It is therefore required to develop privacy preserving coordination mechanisms (PPCM) that can align the business objectives of SC partners. This paper presents a distributed algorithm for PPCM for CSCP based on secure multi-party computation. This requires negotiations for compensation between the buying and the selling firms. We have considered a single buyer and single supplier (SBSS) case along with the process flow logic using a process flow construct for secure computation. We have extended the method to a multiparty negotiation process for a multiple buyer and single supplier (MBSS) case. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Chakraborty, S., & Pal, A. K. (2008). Privacy preserving collaborative business process management. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4928 LNCS, pp. 306–315). https://doi.org/10.1007/978-3-540-78238-4_30
Mendeley helps you to discover research relevant for your work.