期刊文献+

基于密秘共享的安全多方计算协议

Secure Multi-Party Computation Protocol Based on Secret Sharing of Scheduling Problems
下载PDF
导出
摘要 安全多方计算是研究分布式系统安全性的重要内容,主要研究一组互不信任的参与方之间保护隐私的协同计算问题,其基本要求是要确保输入的独立性,计算的正确性,同时不泄露各输入值给参与计算的其他成员,对解决网络环境下的信息安全具有重要价值.在本文中,我们利用秘密共享方案来构造一个高效安全多方计算协议的排序问题. Secure multi-party computation is an important content of the research of distributed system security,the main research a set of mutual distrust between the participants of the protection of privacy collaborative computing problem,its basic requirement is to ensure that the independence of the input and the correctness of the calculation,at the same time don't leak the input values to participate in the calculation,the other members of the to solve information security under the network environment has an important value.In the present study,we make use of a secret sharing scheme to construct an efficient and secure multi-party computation protocol for sequencing problems.
出处 《青海师范大学学报(自然科学版)》 2015年第4期21-24,共4页 Journal of Qinghai Normal University(Natural Science Edition)
基金 自然科学基金项目(编号:2014XJE015)
关键词 密秘共享 安全多方计算协议 排序问题 secret sharing secure multi-party computation sequencing problem
  • 相关文献

参考文献8

  • 1Yao A C. Protocols for secure computations[M]. Proc. 23raIEEE Symp. On the Foundation of Computer Science,IEEE,1982. 160-- 164.
  • 2Goldreich O,Micali S,W igderson A. How to play any mental game[M]. Proc. 19th ACM Symp. On the Theory of Computing. 1987. 218 229.
  • 3Chaum D,Crepeau C, Damgard 1. Multiparty unconditionally secure protocols(extended abstract)[M]. Proc. 20th ACM Syrup. On the Theory of Computing,1988.11--19.
  • 4Goldwasser S,Levin L. Fair computation of general functions in presence of immoral majority[M]. In Advances in Cryptology CRYPT()' 90 volume 537 of LNCS. Springer--Verlag. 1990.
  • 5Goldreich O. Goldwasser S,Linial N. Fault Tolerant Computation in the Full Information Model[M]. 32na FOCS, 1991. 447 -457.
  • 6Micali S, Rogaway P. Secure Computation. CRYPTO[M]. 1991.
  • 7Beaver D. Foundations of Secure Interactive Computing[M]. CRYPLTO. 1991.
  • 8Ben--Or M,Goldwasser S, W igderson A. Completeness theorems for non--cryptographic fault Proceedings of the twentieth annual ACM symposium on Theory of computing STOC88,1988.1.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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