跨组织协同优化决策的隐私保护算法研究-管理科学与工程专业论文.docxVIP

广东工业大学硕士学位论文Abstract 广东工业大学硕士学位论文 Abstract In a globalizing world，with the continuous advancement of information technology and intensification of market competition，the competition between modern corporations has evolved into that among Supply Chains．Supply chain management refers to three aspects： information flow,material flow and capital flow,among which，the information flow is the core coordinator and controller in the performance of supply chain．Rapid and smooth information flow among supply chain，i．e，efficient information sharing，Can mitigate Bull Effect，and improve the harmony and overall benefits of the supply chain．Although Sharing enterprises’sensitive information among supply chain enterprises Can bring benefits to cooperative enterprises，due to supply chain enterprises are competitors essentially,which restricts sensitive information sharing．Information sharing may(or have to)cause leakage of confidential information of enterprises and bring the negative influence to them．Therefore， enterprises seldom share information with other members in actual production activities．So it is difficult to reach the global optimal objectives of the entire supply chain．There is important significance in studying how to reach global objectives in collaborative optimization decision making without disclosing the participates’privacy information．And how to achieve the global optimization in case of no privacy information leakage is also a hard problem in supply chain management． Secure Multi-party Computation is an important tool to solve this kind of problems． Secure multi—party computation mainly solves the collaborative computing problems between parties who do not trust each other．Secure Multi-party Computation can guarantee parties’independence of their input and correctness of their computing results with privacy information leakage．In this paper，on the basis of secure multi-party computation theory as well as the basic protocol of secure multi-party computation，foll