| 注册
首页|期刊导航|计算机工程|基于重复博弈参与者有权重的秘密共享方案

基于重复博弈参与者有权重的秘密共享方案

蔡永泉 孙科

计算机工程2012,Vol.38Issue(18):120-122,3.
计算机工程2012,Vol.38Issue(18):120-122,3.DOI:10.3969/j.issn.1000-3428.2012.18.032

基于重复博弈参与者有权重的秘密共享方案

Secret Sharing Scheme with Weighted Participants Based on Repeated Games

蔡永泉 1孙科1

作者信息

  • 1. 北京工业大学计算机学院,北京100124
  • 折叠

摘要

Abstract

In most secret sharing schemes with weighted participants, different amount of players' secret subshares can cause unfairness problem in the secret reconstruction phase. This paper proposes a rational secret sharing scheme based on repeated games. On the basis of original subshares, it constructs new subshares for each player, making sure that each two amount of subshares differ by a value at most 1. Through repeated games, every player can get all of other players' subshares and then reconstruct the secret. Analysis result shows that the scheme can make every rational player follow the secret reconstruction protocol all the time and be able to reconstruct the secret. And it has high security and expandability.

关键词

秘密共享/博弈论/子秘密份额/中国剩余定理/重复博弈/公平性

Key words

secret sharing/ game theory/ secret subshare/ Chinese remainder theorem/ repeated games/ fairness

分类

信息技术与安全科学

引用本文复制引用

蔡永泉,孙科..基于重复博弈参与者有权重的秘密共享方案[J].计算机工程,2012,38(18):120-122,3.

基金项目

国家自然科学基金资助项目(61170221) (61170221)

北京市自然科学基金资助项目(1102003) (1102003)

计算机工程

OACSCDCSTPCD

1000-3428

访问量0
|
下载量0
段落导航相关论文