检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《贵州大学学报(自然科学版)》2012年第4期82-85,89,共5页Journal of Guizhou University:Natural Sciences
基 金:国家自然科学基金项目(60963023);贵州省自然科学基金项目([2009]2113);贵州大学博士基金项目(2007-040)
摘 要:理性秘密共享是博弈论与传统秘密共享相结合产生的新的研究方向。在理性秘密共享中,参与者从利益最大化的角度选择行为,在秘密重构阶段易出现"空威胁"和最后一轮不合作的问题。本文基于博弈论分析完全理性参与者在信誉机制下的行为偏好,采用激励相容原理,设计信誉惩罚机制,构建一个理性秘密共享方案。该方案通过信誉惩罚机制有效的约束完全理性参与者的行为,避免出现"空威胁"。并由信誉最高的参与者充当"可信中心"进行秘密重构,有效的解决在秘密重构阶段最后一轮各个参与者相互不合作的问题,防止参与者相互合谋的行为。Rational secret sharing is a new hot topic, which is generated at the intersection of game theory and traditional secret sharing. The players choose actions by maximizing their payoff in the rational secret sharing. It is easy to cause the "empty threat" and non-cooperation in the last round of the secret reconstruction phase. This paper proposed a rational secret sharing scheme based on analyzing the preference of rational players in the repu- tation system using game theory, and designing the reputation punishment mechanism with the incentive compati- bility. It effectively restricts the behavior of the completely rational players by reputation punishment mechanism, and avoids the " empty threat". Meanwhile, the secret was reconstructed by the highest reputation player that serves as "trusted center". The proposed scheme effectively solves the problem of non-cooperation and collusion of each player in the secret reconstruction phase.
分 类 号:TP393.08[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145