One-Time Rational Secret Sharing Scheme Based on Bayesian Game

被引：8

作者：

TIAN YouliangMA JianfengPENG ChanggenCHEN XiJI Wenjiang Key Laboratory of Computer Network and Information Security of Ministry of Education Xidian UniversityXian ShaanxiChinaCollege of ScienceGuizhou UniversityGuiyang GuizhouChina ^{[1
,1
,2
,1
,1
,1
,710071
,2
,550025
]}

机构：

来源：

Wuhan University Journal of Natural Sciences | 2011年 / 16卷 / 05期

关键词：

rational secret sharing; one-time rational secret sharing; Bayesian game; perfect Bayesian equilibrium;

D O I：

暂无

中图分类号：

TN918.1 [理论];

学科分类号：

070104 ;

摘要：

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.

引用

页码：430 / 434

页数：5