Constant-round fair rational secret sharing scheme

Meng-hui LI; You-liang TIAN; Jin-ming FENG

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

您当前的位置：

首页 >

文章列表页 >

Constant-round fair rational secret sharing scheme

Academic paper | 更新时间：2024-06-03

- Constant-round fair rational secret sharing scheme
- Journal of network and information security Vol. 3, Issue 1, Pages: 61-67(2017)
- 作者机构：
  
  1. 贵州大学数学与统计学院，贵州贵阳 550025
  2. 贵州大学密码学与数据安全研究所，贵州贵阳 550025
  3. 贵州省公共大数据重点实验室，贵州贵阳 550025
  4. 贵州大学计算机科学与技术学院，贵州贵阳 550025
- 作者简介：
- 基金信息：
- DOI：10.11959/j.issn.2096-109x.2017.00136
  CLC： TP393
- Online First：2017-01，
  
  Published：15 January 2017
- 稿件说明：
移动端阅览
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：

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 .

Views

117

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Optimization of high-degree extension field operations in SM9 based on base field representation

Survey on incentive-driven federated learning: privacy and security

Efficient and fully simulated oblivious transfer protocol on elliptic curve

Honeypot defense and transmission strategy based on offensive and defensive games in vehicular networks

Global randomized consensus algorithm resist collusion attack based on game theory

Related Author

Wang Zhichao

Zhao Fangfang

Liu Shengli

Xie Zhenjie

ZHU Tianqing

MA Xiao

LIU Hengzhu

XIONG Ping

Related Institution

Key Laboratory of Cyberspace Security, Ministry of Education, Information Engineering University

Troop of People’s Liberation Army

School of Information Engineering, Zhongnan University of Economics and Law

Faculty of Date Science, City University of Macau, Macau

Department of Computer Technology and Applications, Qinghai University

⁰