Detail Privacy Preserving Collaborative Business Process Management Bibliografi Author: Chakraborty, Sumit ; Pal, Asim Kumar Topik: Coordination mechanism; Distributed algorithm; Multi-party negotiation; Secure multiparty computation; Collaborative supply chain planning Bahasa: (EN )     Penerbit: Springer-Verlag Berlin Heidelberg     Tempat Terbit: Heidelberg    Tahun Terbit: 2008     Jenis: Papers/Makalah Fulltext: Privacy Preserving Collaborative Business Process Management.pdf (686.68KB; 4 download) 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 multiparty 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. Opini Anda Klik untuk menuliskan opini Anda tentang koleksi ini! Lihat Sejarah Pengadaan  Konversi Metadata   Kembali

Copyright © 2006, 2007 Unika Atma Jaya, all rights reserved