期刊文献+

基于安全多方计算的可信防共谋协议模型 被引量:6

Trusted coalition-proof protocol model based on secure multi-part computing
下载PDF
导出
摘要 n个互不信任的参与方共同计算一个函数,其中部分参与方形成联盟,通过共谋而破坏其他参与方的安全性,利用安全多方计算技术和通信通道,针对可嵌套共谋,提出可信防共谋协议模型。将模型运用到博弈论中,借助相关均衡的概念取代了可信第三方。 N parties were involved in the computation of a function,which did not trust each other.Some of them found a coalition and destroy the security of others through collusion.Based on secure multi-party computation and communica-tions channel,to the collusion that could be nested,a trusted coalition-proof protocol model was proposed.The concept of correlated equilibrium was used by the model in game theory for talking place the trusted third party.
出处 《通信学报》 EI CSCD 北大核心 2011年第8期23-30,共8页 Journal on Communications
基金 国家高技术研究发展计划("863"计划)基金资助项目(2007AA01Z425 2009AA012201) 国家重点基础研究发展计划("973"计划)基金资助项目(2007CB316502) 国家自然科学基金资助项目(90718015) NSFC-微软亚洲研究院联合资助项目(60970155)~~
关键词 安全多方 可信计算 防共谋 相关均衡 secure multi-part trust computing coalition-proof correlated equilibrium
  • 相关文献

参考文献22

  • 1YAO A C. How to generate and exchange secrets[A]. Proc 27th FOCS IEEE Computer Society[C]. 1986.162-167.
  • 2GOLDREICH O, MICALI S, WIGDERSON A. How to play any mental game[A]. Proc 19th Symposium on Theory of Computing (STOC)[C]. ACM, 1987. 218-229.
  • 3CLEVE R. Limits on the security of coin flips when half the processors are faulty[A]. 18th ACM Symposium on the Theory of Computing[C]. 1986. 364-369.
  • 4LEPINSKI M, MICALI S, SHELAT A. Collusion-flee protocols[A]. Proc 37th Annual ACM Symposium on Theory of Computing (STOC)[C]. New York, NY, USA, ACM, 2005.543-552.
  • 5ALWEN J, SHELAT A, VISCONTI I. Collusion-free protocols in the mediated model[A], Cryptology-Crypto[C]. Springer, 2008. 497-514.
  • 6ALWEN J, KATZ J, LINDELL Y, et al. Collusion-free multiparty computation in the mediated model[A]. 29th International Cryptology Conference[C]. Santa Barbara, CA, 2009.
  • 7LEPINSKI M, MICALI S, PEIKERT C, et al. Completely fair SFE and coalition-safe cheap talk[A]. Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing[C]. 2004. 1-10.
  • 8GOLDREICH O. Foundations of Cryptography[M]. (Volume 2 Basic Applications:), Cambridge University Press, Pub, 2004.
  • 9CANETTI R, FEIGE U, GOLDREICH O, et al. Adaptively secure computation[A]. 28th Symposium on Theory of Computing (STOC), ACM[C]. 1996.
  • 10MICALI G S, RACKOFF C. The knowledge complexity of interactive proof system[J]. SIAM Journal on Computing, 1989,( 18): 186-208.

同被引文献39

引证文献6

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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