期刊文献+

安全多方计算在解决销售量问题中的研究

Research on solving sales problem of secure multi-party computation
下载PDF
导出
摘要 提出了一个销售量问题:不同的厂家有不同的商品,他们想知道相同商品在市场上的销售总量,但各自都不透露自己的私有数据。同时提出了一个解决销售量问题的协议,并且在半诚实模型下对协议的安全性和计算复杂度及通信复杂度进行了分析。 This paper introduces a sales problem:different manufacturers have different goods,and want to know the sales vol- ume of same goods in the market,but not reveal their own private datum.Meanwhile,the paper gives a protocol to solve the sales problem,and analyzes the security,computational complexity and communication complexity of the protocol in semi-honest model.
出处 《微型机与应用》 2012年第20期65-67,共3页 Microcomputer & Its Applications
关键词 多精度 安全多方求和 保密性 公平性 multi-precision secure multi-party sum confidentiality fairness
  • 相关文献

参考文献4

二级参考文献22

  • 1J Benaloh, D Tuinstra. Receipt-free secret-ballot elections [C].In: Proc of the 26th ACM Symposium on Theory of Computing. New York: ACM Press, 1994. 544-553
  • 2J Groth. Efficient maximal privacy in boardroom voting and anonymous broadcast [G]. In: Proc of the 8th Int'l Conf on Financial Cryptography ( FC2004 ), LNCS 3110. Berlin:Springer-Verlag, 2004. 90-104
  • 3R Cramer, M Franklin, B Schoenmakers, et al. Multauthority secret-ballot elections with linear work [G]. In: Advances in Cryptology-Eurocrypt' 96, LNCS 1070. Berlin: Springer-Verlag, 1996. 72-83
  • 4R Cramer, R Gennaro, B Schoenmakers. A secure and optimally efficient multi-authority election scheme [G]. In:Advances in Cryptology-Eurocrypt' 97, LNCS 1223. Berlin:Springer-Verlag, 1997. 103-118
  • 5I Damgard, M Jurik. A generalisation, a simplication and some applications of Paillier' s probabilistic public-key system [G].In: The 4th Int'l Workshop on Practice and Theory in Public Key Cryptosystems (PKC 2001 ), LNCS 1992. Berlin:Springer-Verlag, 2001. 119-136
  • 6O Goldreich. Secure multi-party computation (working draft)[OL]. http://www. wisdom. weizmann. ac. il/home/oded/publichtml/foc. html, 1998
  • 7K H Rosen. Elementary Number Theory and Its Applications[M]. New York: Addition Wesley, 1984
  • 8H Cohen. A Course in Computational Algebraic Number Theory[M]. Berlin: Springer, 1993
  • 9D E Knuth. The Art of Computer Programming: Semi-Numerical Algorithms [M]. Volume 2. New York: Addition Wesley, 1981
  • 10J C Benaloh. Secret sharing homomorphisms: Keeping shares of a secret secret [G]. In: Advances in Cryptology-Crypto' 86,LNCS 263. Berlin: Springer-Verlag, 1986. 251-260

共引文献42

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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