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

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

Chinese Journal of Network and Information Security ›› 2017, Vol. 3 ›› Issue (1): 61-67.doi: 10.11959/j.issn.2096-109x.2017.00136

• Academic paper • Previous Articles Next Articles

Constant-round fair rational secret sharing scheme

Meng-hui LI^1,²,You-liang TIAN^2,^3,⁴(),Jin-ming FENG^1,²

¹ College of Mathematics and Statistics, Guizhou University, Guiyang 550025, China
² Institute of Cryptography＆Data Security, Guizhou University, Guiyang 550025, China
³ Key Laboratory of Public Data of Guizhou Province, Guiyang 550025, China
⁴ 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)

Abstract

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

CLC Number:

TP393

Meng-hui LI,You-liang TIAN,Jin-ming FENG. Constant-round fair rational secret sharing scheme[J]. Chinese Journal of Network and Information Security, 2017, 3(1): 61-67.

Figures/Tables 1

References 11

[1]	EVEN S , YACOBI Y . Relations among public key signature schemes[R]. Technion Computer Science Department Technical Report CS0175. 1980.
[2]	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.
[3]	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.
[4]	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.
[5]	CAI Y Q , PENG X Y . Rational secret sharing protocol with fair-ness[J]. Chinese Journal of Electronics, 2012, 21 (1): 149-152.
[6]	DAMG?RD I , ISHAI Y . Constant-round multiparty computation using a black-box pseudorandom generator[C]// Advances in Cryp-tology–CRYPTO. 2005: 378-394.
[7]	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.
[8]	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.
[9]	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.
[10]	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.
[11]	刘海，李兴华，马建峰 . 基于重构顺序调整机制的理性秘密共享方案[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.

Metrics

Recommended 0

No Suggested Reading articles found!

方案	通信复杂度	信道类型	重构阶段前提假设
文献[ 5 ]	与b,β的选取有关	同时通信信道	不需要分发者在线
文献[ 7 ]	5	点对点通信信道	不需要分发者在线
文献[ 9 ]	与β的选取有关	同时通信信道	需要分发者在线
文献[ 11 ]	与K的选取有关	非同时通信信道	不需要分发者在线
本文方案	4	同时、非同时通信信道	不需要分发者在线

Constant-round fair rational secret sharing scheme

RichHTML

PDF下载

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 1

References 11

Related Articles 10

Metrics

Recommended 0

[1]	Jiashuo SONG, Zhenzhen LI, Haiyang DING, Zichen LI. Efficient and fully simulated oblivious transfer protocol on elliptic curve [J]. Chinese Journal of Network and Information Security, 2023, 9(1): 158-166.
[2]	Bao ZHANG, Youliang TIAN, Sheng GAO. Global randomized consensus algorithm resist collusion attack based on game theory [J]. Chinese Journal of Network and Information Security, 2022, 8(4): 98-109.
[3]	Jie YI, Tengfei CAO, Shuai GAO, Jianqiang HUANG. Honeypot defense and transmission strategy based on offensive and defensive games in vehicular networks [J]. Chinese Journal of Network and Information Security, 2022, 8(4): 157-167.
[4]	Renwan BI,Qianxin CHEN,Jinbo XIONG,Ximeng LIU. Design method of secure computing protocol for deep neural network [J]. Chinese Journal of Network and Information Security, 2020, 6(4): 130-139.
[5]	Jian LIU,Yi ZHANG,Yuling LIU,Hao HU. Analysis and design of visual secret sharing scheme for gray image [J]. Chinese Journal of Network and Information Security, 2020, 6(4): 140-147.
[6]	Wenwei YANG,Yuqing XING. Fair secret sharing scheme using asymmetric bivariate polynomial [J]. Chinese Journal of Network and Information Security, 2019, 5(1): 22-29.
[7]	Yifu TAN,Zichen LI. Image visualization encryption algorithm based on Shamir threshold secret key sharing [J]. Chinese Journal of Network and Information Security, 2018, 4(7): 69-76.
[8]	Xinglan ZHANG,Wei ZHENG. Research on security multi-party computing based on game theory [J]. Chinese Journal of Network and Information Security, 2018, 4(1): 52-56.
[9]	Jian-ming ZHU,Bo GAO. Social financial information security risk analysis and prevention [J]. Chinese Journal of Network and Information Security, 2016, 2(3): 46-51.
[10]	Jian-ming ZHU,Qin WANG. Analysis of cyberspace security based on game theory [J]. Chinese Journal of Network and Information Security, 2015, 1(1): 43-49.