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

李梦慧; 田有亮; 冯金明

doi:10.11959/j.issn.2096-109x.2017.00136

您当前的位置：

首页 >

文章列表页 >

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

学术论文 | 更新时间：2024-06-03

- 常数轮公平理性秘密共享方案
- Constant-round fair rational secret sharing scheme
- 网络与信息安全学报 2017年3卷第1期页码：61-67
- 作者机构：
  
  1. 贵州大学数学与统计学院，贵州贵阳 550025
  2. 贵州大学密码学与数据安全研究所，贵州贵阳 550025
  3. 贵州省公共大数据重点实验室，贵州贵阳 550025
  4. 贵州大学计算机科学与技术学院，贵州贵阳 550025
- 作者简介：
  
  [ "李梦慧（1991-），女，河南焦作人，贵州大学硕士生，主要研究方向为理性秘密共享协议效率优化。" ]
  [ "田有亮（1982-），男，贵州盘县人，博士，贵州大学教授，主要研究方向为密码与安全协议及算法博弈论。" ]
  [ "冯金明（1993-），男，甘肃崆峒人，贵州大学硕士生，主要研究方向为可搜索加密。" ]
- 基金信息：
  
  国家自然科学基金资助项目;The National Natural Science Foundation of China(61363068);贵州省教育厅科技拔尖人才支持基金资助项目;Science and Technology Top-notch Talent Support Project in Guizhou Province Department of Education(黔教合KY字[2016]060)
- DOI：10.11959/j.issn.2096-109x.2017.00136
  中图分类号： TP393
- 网络首发：2017-01，
  
  纸质出版：2017-01-15
- 稿件说明：
移动端阅览
李梦慧, 田有亮, 冯金明. 常数轮公平理性秘密共享方案[J]. 网络与信息安全学报, 2017,3(1):61-67.

Meng-hui LI, You-liang TIAN, Jin-ming FENG. Constant-round fair rational secret sharing scheme[J]. Journal of network and information security, 2017, 3(1): 61-67.
李梦慧, 田有亮, 冯金明. 常数轮公平理性秘密共享方案[J]. 网络与信息安全学报, 2017,3(1):61-67. DOI： 10.11959/j.issn.2096-109x.2017.00136.

Meng-hui LI, You-liang TIAN, Jin-ming FENG. Constant-round fair rational secret sharing scheme[J]. Journal of network and information security, 2017, 3(1): 61-67. DOI： 10.11959/j.issn.2096-109x.2017.00136.

摘要

在理性秘密共享方案中，公平性是所有参与者期望的目标。基于均匀分组原理研究了常数轮理性秘密共享方案，结合双线性对有关知识和双变量单向函数构造知识承诺方案，该方案是可验证的，以此来检验分发者和参与者的欺骗问题。分发者分给各组参与者的子秘密份额数量最多相差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.

关键词

Keywords

references

EVEN S , YACOBI Y . Relations among public key signature schemes [R ] . Technion Computer Science Department Technical Report CS0175 . 1980 .

ONG S J , PARKES D C , ROSEN A , et al . Fairness with an honest minority and a rational majority [C ] // The Conference on Theory of Cryptography . 2009 : 36 - 53 .

LEE Y C , A simple (v, t, n)-fairness secret sharing scheme with one shadow for each participant [C ] // The International Conference on Web Information Systems and Mining . 2011 : 384 - 389 .

TIAN Y L , MA J F , PENG C G , et al . Secret sharing scheme with fairness [C ] // 2011 International Joint Conference on IEEE Trust-Com-11/IEEE ICESS-11/FCST-11 . 2011 : 494 - 500 .

CAI Y Q , PENG X Y . Rational secret sharing protocol with fair-ness [J ] . Chinese Journal of Electronics , 2012 , 21 ( 1 ): 149 - 152 .

DAMGÅRD I , ISHAI Y . Constant-round multiparty computation using a black-box pseudorandom generator [C ] // Advances in Cryp-tology–CRYPTO . 2005 : 378 - 394 .

ASHAROV G , JAIN A , LÓPEZ-ALT A , et al . Multiparty computa-tion with low communication, computation and interaction via threshold FHE [C ] // Advances in Cryptology–EUROCRYPT . 2012 : 483 - 501 .

GARG S , GENTRY C , HALEVI S , et al . Two-round secure MPC from Indistinguish ability obfuscation [M ] // Theory of Cryptography . Berlin Heidelberg: Springer , 2014 : 74 - 94 .

DE S J , RUJ S , PAL A K . Should silence be heard? fair rational secret sharing with silent and non-silent players [M ] // Cryptology and Network Security . Beilin: Springer , 2014 : 240 - 255 .

GORDON S , LIU F H , SHI E . Constant-round MPC with fairness and guarantee of output deliver [C ] // Advances in Ctyptology- CTYPTO . 2015 : 63 - 82 .

刘海，李兴华，马建峰 . 基于重构顺序调整机制的理性秘密共享方案 [J ] . 计算机研究与发展， 2015 , 52 ( 10 ): 2332 - 2340 .

LIU H , LI X H , MA J F . Rational secret sharing scheme based on reconstructed sequential adjustment mechanism [J ] . Journal of Computer Research and Development , 2015 , 52 ( 10 ): 2332 - 2340 .

浏览量

117

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于基域表示的SM9高次扩域运算优化

激励驱动的联邦学习研究综述：隐私与安全

椭圆曲线上高效可完全模拟的不经意传输协议

车联网中基于攻防博弈的蜜罐防御及传输策略

基于博弈论抗共谋攻击的全局随机化共识算法