期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

One-Time Rational Secret Sharing Scheme Based on Bayesian Game 被引量：8

One-Time Rational Secret Sharing Scheme Based on Bayesian Game
原文传递
导出
摘要 The rational secret sharing cannot be realized in the case of being played only once, and some punishments in the one-time rational secret sharing schemes turn out to be empty threats. In this paper, after modeling 2-out-of-2 rational secret sharing based on Bayesian game and considering different classes of protocol parties, we propose a 2-out-of-2 secret sharing scheme to solve cooperative problem of a rational secret sharing scheme being played only once. Moreover, we prove that the strategy is a perfect Bayesian equilibrium, adopted only by the parties in their decision-making according to their belief system （denoted by the probability distribution） and Bayes rule, without requiring simultaneous channels. The rational secret sharing cannot be realized in the case of being played only once, and some punishments in the one-time rational secret sharing schemes turn out to be empty threats. In this paper, after modeling 2-out-of-2 rational secret sharing based on Bayesian game and considering different classes of protocol parties, we propose a 2-out-of-2 secret sharing scheme to solve cooperative problem of a rational secret sharing scheme being played only once. Moreover, we prove that the strategy is a perfect Bayesian equilibrium, adopted only by the parties in their decision-making according to their belief system （denoted by the probability distribution） and Bayes rule, without requiring simultaneous channels.
作者 TIAN Youliang MA Jianfeng PENG Changgen CHEN Xi JI Wenjiang
机构地区 Key Laboratory of Computer Network and InformationSecurity of Ministry of Education/Xidian University College of Science
出处 《Wuhan University Journal of Natural Sciences》 CAS 2011年第5期430-434,共5页 武汉大学学报（自然科学英文版）
基金 Supported by the Major National Science and Technology program (2011ZX03005-002) the National Natural Science Foundation of China (60872041, 61072066, 60963023, 60970143) the Fundamental Research Funds for the Central Universities (JY10000903001, JY10000901034)
关键词 rational secret sharing one-time rational secret sharing Bayesian game perfect Bayesian equilibrium rational secret sharing one-time rational secret sharing Bayesian game perfect Bayesian equilibrium
分类号 TP309 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献18

  • 1Blakley G R. Safeguarding cryptographic keys[C]//Proc of the National Computer Conference, American Federation of Information Processing Societies Proceedings. Arlington: IEEE Computer Society, 1979: 313- 317.
  • 2Shamir A. How to share a secret [J]. Communications of the ACM, 1979, 22(11): 612-613.
  • 3Halpern J, Teague V. Rational secret sharing and multipartycomputation: Extended abstract [C]// Proc of 36th Annual ACM Symposium on Theory of Computing (STOC). Chicago: ACM Press, 2004: 623-632.
  • 4Katz J. Bridging game theory and cryptography: Recent results and future directions[C]//Proc of Theory of Cryptogra- phy Conference 2008. New York: Springer-Verlag, 2008, 4948: 251-272.
  • 5Lysyanskaya A, Triandopoulos N. Rationality and adversarial behavior in multiparty computation[C]//Proc of CRYPTO 2006. Heidelberg: Springer-Verlag, 2006, 4117: 180-197.
  • 6Kol G, Naor M. Games for exchanging information[C]// Proc of STOC 2008. New York: ACM Press, 2008: 423-432.
  • 7Kol G, Naor M. Cryptography and game theory: Designing protocols for exchanging information[C//Proc of TCC 2008. Heidelberg: Springer-Verlag, 2008, 4948: 320-339.
  • 8Fuchsbauer G, Katz 1, Naccache D. Efficient Rational Secret Sharing in Standard Communication Networks[C]//Proc of TCC 2010. Zurich: Springer, 2010: 419-436.
  • 9Maleka S, Shareef A, Pandu R C. Rational secret sharing with repeated games[C]// Proc of ISPEC 2008. Sydney: Springer-Verlag, 2008: 334-346.
  • 10Ong S J, Parkes D V, Rosen, et al. Fairness with an honest Minority and a rational majority[C]//Proc of TCC 2009. San Francisco: Springer-Verlag, 2009: 36-53.

同被引文献54

  • 1郭渊博,马建峰.分布式环境下一种实用的先应式秘密共享方法[J].系统工程与电子技术,2004,26(6):799-805. 被引量：7
  • 2庞辽军,姜正涛,王育民.基于一般访问结构的多重秘密共享方案[J].计算机研究与发展,2006,43(1):33-38. 被引量：22
  • 3Shamir A. How to share a secret [J]. Communications of the ACM, 1979, 22(11): 612-613.
  • 4Blakley G R. Safeguarding cryptographie keys [C] //Proc of the American Federation of Information Processing Societies National Computer Conf. New York: American Federation of Information Processing Societies (AFIPS), 1979:313-317.
  • 5Halpern J, Teague V. Rational secret sharing and multiparty computation: Extended abstract [C] //Proc of the 36th Annual ACM Symp on Theory of Computing. New York: ACM, 2004:623-632.
  • 6Gordon S D, Katz J. Rational secret sharing revisited [G] // LNCS 4116: Proc of the 5th Int Conf on Security and Cryptography for Networks. Berlin: Springer, 2006: 229- 241.
  • 7Abraham I, Dolev D, Gonenen R, et al. Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation [C] //Proc of the 25th Annual ACM Symp on Principles of Distributed Computing. New York: ACM, 2006:53-62.
  • 8Katz J. Bridging game theory and cryptography: Recent results and future directions [C] //Proe of the 5th Conf on Theory of Cryptography. Berlin: Springer, 2008:251-272.
  • 9Maleka S, Shareef A, Rangan C P. Rational secret sharing with repeated games [G] //LNCS 4991 : Proc of the 4th Int Conf on Information Security Practice and Experience. Berlin: Springer, 2008:334-346.
  • 10Asharov G, Lindell Y. Utility dependence in correct and fair rational secret sharing [G] //LNCS 6577: Proc of the 29th Annual Int Cryptology Conf on Advances in Cryptology. Berlin: Springer, 2009:559-576.

引证文献8

二级引证文献28

Wuhan University Journal of Natural Sciences
2011年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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