首页 | 本学科首页   官方微博 | 高级检索  
     

基于重复博弈参与者有权重的秘密共享方案
引用本文:蔡永泉,孙科.基于重复博弈参与者有权重的秘密共享方案[J].计算机工程,2012,38(18):120-122.
作者姓名:蔡永泉  孙科
作者单位:北京工业大学计算机学院,北京,100124
基金项目:国家自然科学基金资助项目,北京市自然科学基金资助项目
摘    要:在大多数参与者有权重的秘密共享方案中,各参与者子秘密份额数量的不同会导致秘密重构阶段产生不公平问题。为此,提出一个基于重复博弈的理性秘密共享方案。在参与者原有份额的基础上,为其构造数量差不超过1的有效子秘密份额,利用重复博弈使每个参与者可以获得其他参与者的全部份额,进而重构出秘密。分析结果表明,该方案可以使理性参与者始终遵守协议,完成秘密重构,且具有较高的安全性和良好的可扩展性。

关 键 词:秘密共享  博弈论  子秘密份额  中国剩余定理  重复博弈  公平性
收稿时间:2011-12-16
修稿时间:2012-02-10

Secret Sharing Scheme with Weighted Participants Based on Repeated Games
CAI Yong-quan , SUN Ke.Secret Sharing Scheme with Weighted Participants Based on Repeated Games[J].Computer Engineering,2012,38(18):120-122.
Authors:CAI Yong-quan  SUN Ke
Affiliation:(College of Computer Science,Beijing University of Technology,Beijing 100124,China)
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.
Keywords:secret sharing  game theory  secret subshare  Chinese remainder theorem  repeated games  fairness
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号