Abstract
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.
This work was partly supported by AICTE Project ISISAMB.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Atallah, M.J., Atallah, E.H.G., Deshpande, V., Schwarz, L.B.: Secure supply chain protocols. In: IEEE International Conference on E-Commerce, Newport Beach, California (2003)
Seifert, D.: Collaborative planning, forecasting and replenishment. Galliers Business (2002)
Dudek, G.: Collaborative planning in supply chain negotiation based approach. Springer, Heidelberg (2004)
Stadtler, H., Kilger, C.: Supply chain management and advanced planning concepts, models, software and case studies, 2nd edn. Springer, Heidelberg (2004)
Bhatnagar, R., Chandra, P., Goyal, S.K.: Models for multi-plant coordination. European Journal of Operational Research 67, 141–160 (1993)
Schneeweiss, C., Zimmer, K.: Hierarchial corordination mechanisms within the supply chain. European Journal of Operational Research 153, 687–703 (2004)
Dudek, G., Stadtler, H.: Negotiation-based collaborative planning between supply chain partners. European Journal of Operational Research 163, 668–687 (2005)
Li, X., Wang, Q.: Coordination mechanisms of supply chain systems. European Journal of Operational Research 179, 1–16 (2007)
Erengüc, S.S., Simpson, N.C., Vakharia, A.J.: Integrated production/distributed planning in supply chain: An invited review. European Journal of Operational Research 115, 219–236 (1999)
Yao, A.C.: Protocols for secure computations. In: 23rd IEEE Annual Symposium on Foundations of Computer Science, pp. 160–164 (1982)
Zhao, X., Liu, C.: Tracking over collaborative business processes. In: 4th International conference on Business Process Management, Vienna, Austria, pp. 33–48 (2006)
Zhao, X., Liu, C., Yang, Y.: An organizational perspective of Inter-Organizational Workflows. In: International Conference on Business Process Management, pp. 17–31 (2005)
Cachin, C.: Efficient private bidding and auctions with an oblivious third party. In: 6th ACM conference on computer and communications security, Singapore, pp. 120–127 (1999)
Ioannidis, I., Grama, A.: An efficient protocol for Yao’s millionaires’ problem. In: 36th Hawaii International Conference on System Sciences (2003)
Schoenmakers, B., Tuyls, P.: Practical two-party computation based on the conditional gate. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 119–136. Springer, Heidelberg (2004)
Blake, I.F., Kolesnikov, V.: Strong conditional oblivious transfer and computing on intervals. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 515–529. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakraborty, S., Pal, A.K. (2008). Privacy Preserving Collaborative Business Process Management. In: ter Hofstede, A., Benatallah, B., Paik, HY. (eds) Business Process Management Workshops. BPM 2007. Lecture Notes in Computer Science, vol 4928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78238-4_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-78238-4_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78237-7
Online ISBN: 978-3-540-78238-4
eBook Packages: Computer ScienceComputer Science (R0)