Constant-round fair rational secret sharing scheme
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.Th...
Saved in:
Main Authors: | Meng-hui LI, You-liang TIAN, Jin-ming FENG |
---|---|
Format: | Article |
Language: | English |
Published: |
POSTS&TELECOM PRESS Co., LTD
2017-01-01
|
Series: | 网络与信息安全学报 |
Subjects: | |
Online Access: | http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2017.00136 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Provably secure secret sharing scheme based on bilinear maps
by: LI Hui-xian1, et al.
Published: (2008-01-01) -
Rational secret sharing scheme based on Markov decision
by: You-liang TIAN, et al.
Published: (2015-09-01) -
Efficiency identity-based threshold group signature scheme
by: LIU Hong-wei 1, et al.
Published: (2009-01-01) -
Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate
by: Ryutaroh Matsumoto
Published: (2025-01-01) -
Fair secret sharing scheme using asymmetric bivariate polynomial
by: Wenwei YANG, et al.
Published: (2019-02-01)