摘要
论文主要研究已有的理性秘密共享方案中存在的参与者欺骗问题,在以往的理性秘密方案中,理性参与者为了最大化自己的利益选择发送自己的子秘密,如果参与者存在欺骗则共享秘密不能被重构,这对诚实的参与者来说是不公平的,且对于欺骗的参与者来说这也是不公平的,不给犯错误的参与者改正错误的机会;针对此问题,论文引进了惩罚因子的概念,以惩罚因子来代表参与者的信誉值,同时结合扩展式博弈论中的子博弈,提出了一个具有惩罚因子的理性秘密共享方案,不仅可以保证对诚实参与者的公平性,同时也给予具有欺骗的参与者改正错误的机会。
This paper mainly focused on the cheating problem in the existed rational secret sharing schemes.In the past the interacting times is uncertainty in the scheme which has random interaction times,rational players send their secret share since they want to maximize their own interests.However,if there are players who deceive secret share then others can not reconstructed secret,this is not fair to the other honest players and is also is not fair to the players who deceive,there is no chance to correct mistakes to the players who deceive.To solve this problem,this paper introduce the concept of penalty factor,penalty factor represent players' reputation values,combined with the subgame of extensive games,and put forward a rational secret sharing scheme with penalty factor,not only can guarantee fairness of honest players,also give deceive players the opportunity to correct mistakes.
出处
《计算机与数字工程》
2013年第5期785-788,共4页
Computer & Digital Engineering
关键词
秘密共享
理性参与者
博弈论
惩罚因子
secret sharing
rational player
game theory
penalty factor