网络与信息安全学报 ›› 2017, Vol. 3 ›› Issue (1): 61-67.doi: 10.11959/j.issn.2096-109x.2017.00136

• 学术论文 • 上一篇    下一篇

常数轮公平理性秘密共享方案

李梦慧1,2,田有亮2,3,4(),冯金明1,2   

  1. 1 贵州大学数学与统计学院,贵州 贵阳 550025
    2 贵州大学密码学与数据安全研究所,贵州 贵阳 550025
    3 贵州省公共大数据重点实验室,贵州 贵阳 550025
    4 贵州大学计算机科学与技术学院,贵州 贵阳 550025
  • 修回日期:2016-12-17 出版日期:2017-01-15 发布日期:2020-03-20
  • 作者简介:李梦慧(1991-),女,河南焦作人,贵州大学硕士生,主要研究方向为理性秘密共享协议效率优化。|田有亮(1982-),男,贵州盘县人,博士,贵州大学教授,主要研究方向为密码与安全协议及算法博弈论。|冯金明(1993-),男,甘肃崆峒人,贵州大学硕士生,主要研究方向为可搜索加密。
  • 基金资助:
    国家自然科学基金资助项目(61363068);贵州省教育厅科技拔尖人才支持基金资助项目(黔教合KY字[2016]060)

Constant-round fair rational secret sharing scheme

Meng-hui LI1,2,You-liang TIAN2,3,4(),Jin-ming FENG1,2   

  1. 1 College of Mathematics and Statistics, Guizhou University, Guiyang 550025, China
    2 Institute of Cryptography&Data Security, Guizhou University, Guiyang 550025, China
    3 Key Laboratory of Public Data of Guizhou Province, Guiyang 550025, China
    4 College of Computer Science and Technology, Guizhou University, Guiyang 550025, China
  • Revised:2016-12-17 Online:2017-01-15 Published:2020-03-20
  • Supported by:
    The National Natural Science Foundation of China(61363068);The of the Science and TechnologyTop-notch Talent Support Project of the(黔教合KY字[2016]060)

摘要:

在理性秘密共享方案中,公平性是所有参与者期望的目标。基于均匀分组原理研究了常数轮理性秘密共享方案,结合双线性对有关知识和双变量单向函数构造知识承诺方案,该方案是可验证的,以此来检验分发者和参与者的欺骗问题。分发者分给各组参与者的子秘密份额数量最多相差1,有效约束参与者的偏离行为。参与者按照协议执行4轮即可实现公平重构秘密,一定程度上降低了公平理性秘密共享方案的通信复杂度,具有一定应用价值。

关键词: 秘密共享, 通信复杂度, 博弈论, 双线性对

Abstract:

In the rational secret sharing scheme, fairness is the goal that all participants expect. Based on the princi-ple of uniform grouping, the scheme was verified by combining bilinear pair knowledge and bivariate one-way function to verify the deception problem of the distributor and the participant.The number of sub-secret shares dis-tributed by the distributor to each group of participants is at most one, effectively restricting the deviation behavior of the participant. In the end, participants can implement fair reconstruction secret in four rounds according to the protocol, which reduces the communication complexity of fair and rational secret sharing scheme to a certain extent, and has certain application value.

Key words: secret sharing, communication complexity, game theory, bilinear pairing

中图分类号: 

No Suggested Reading articles found!