期刊文献+

Privacy preserving supply chain quantity discount contract design 被引量:2

私有信息保护的供应链数量折扣契约设计(英文)
下载PDF
导出
摘要 The development and deployment of privary preserving supply chain quantity discount contract design can allow supply chain collaborations to take place without revealing any participant's data to others, reaping the benefits of collaborations wbile avoiding the drawbacks of privacy information disclosure. First, secure multi-party computation protocols are applied in the joint-ordering policy between a single supplier and a single retailer, the joint-ordering policy can be conducted without disclosing private cost information of any of the other supply chain partners. Secondly, secure multi-party computation protocols are applied in the privacy preserving supply chain quantity discount contract design between a single supplier and a single retailer. The information disclosure analyses of the algorithm show that: the optimal quantity discount of the jointordering policy can be conducted without disclosing private cost information of any of the other supply chain partners; the above protocol can be implemented without mediators; the privacy preserving quantity discount algorithm can be mutually verifiable and has solved the problem of asymmetric information. 私有信息保护的供应链数量折扣契约设计,实现了供应链伙伴之间的协作,同时避免了各自私有信息泄漏的风险.首先,将安全多方计算技术应用于一个供应商一个销售商供应链成本最小的联合经济订货批量计算;其次,将安全多方计算技术应用于一个供应商一个销售商供应链系统成本最小的数量折扣契约设计.算法的信息泄漏分析表明:供应链成本最小的联合经济订货批量计算,在没有泄漏计算各参与方私有信息的情况下能够实现;上述计算过程由于没有协议第三方,所以不存在合伙腐败风险;所给出的私有信息保护的供应链数量折扣契约设计算法,计算各参与方能够相互证明,解决了信息不对称的问题.
出处 《Journal of Southeast University(English Edition)》 EI CAS 2009年第1期132-137,共6页 东南大学学报(英文版)
基金 The National Natural Science Foundation of China(No.70771026)
关键词 supply chain quantity discount privacy preserving 供应链 数量折扣 私有信息保护
  • 相关文献

参考文献2

二级参考文献17

  • 1M Naor,B Pinkas.Efficient oblivious transfer protocols[A].Proc 12th Ann Symp Discrete Algorithms[C].New York:ACM Press,2001.448-457.
  • 2Wen-Guey Tzeng.Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters[J].IEEE TRANSACTIONS ON COMPUTERS,2004,53(2):232-240.
  • 3William Stallings.Cryptography and Network Security:Principles and Practice (2nd ed)[M].Beijing:Tsinghua University Press,2003.264-269.
  • 4A Yao.Protocols for secure computations[A].Proceeding of the 23th IEEE Symposium on Foundations of Computer Science[C].Los Alamitos,CA:IEEE Computer Society Press,1982.160-164.
  • 5C Cachin.Efficient private bidding and auction with an obvious third party[A].Proceeding of the 6th ACM conference on computer and communication security[C].New York:ACM Press,1999.120-127.
  • 6Oded Goldreich,Silvio Micali,Avi Wigderson.How to play ANY mental game[A].Proceedings of the nineteenth annual ACM conference on Theory of computing[C].New York:ACM Press,1987.218-229.
  • 7O Goldreich.Secure multi-party computation (working draft)[OL].http://www.wisdom.weizmann.ac.il/home/oded/public-html/foc.html,2002.
  • 8S Goldwasser.Multi-party computations:Past and present[A].Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing[C].New York:ACM Press,1997.21-24.
  • 9Wenliang Du,Atallah J.Secure multi-party computation problems and their applications:A review and open problems[A].New Security Paradigms Workshop 2001[C].Cloudcroft,New Mexico,USA,Sep.11-13,2001.11-20.
  • 10Mikhail J Atallah,Wenliang Du.Secure multi-party computational geometry[A].In Seventh International Workshop on Algorithms and Data Structures (WADS 2001),Lecture Note in Computer Science 2125[C].New York:Springer-verlag,2001.165-179.

共引文献60

同被引文献30

引证文献2

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部