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...
Main Authors: | Meng-hui LI,Jin-ming FENG, You-liang TIAN |
---|---|
Format: | Article |
Language: | English |
Published: |
POSTS&TELECOM PRESS Co., LTD
2017-01-01
|
Series: | 网络与信息安全学报 |
Subjects: | |
Online Access: | http://www.infocomm-journal.com/cjnis/CN/10.11959/j.issn.2096-109x.2017.00136 |
Similar Items
-
A Pairing-Based Three-Party Authenticated Encryption Scheme without Shared Secrets
by: Han-Yu Lin
Published: (2019-05-01) -
Efficient Verifiable Dynamic Threshold Secret Sharing Scheme Based on Elliptic Curves
by: Amir Alaei, et al.
Published: (2015-12-01) -
Publicly Verifiable Multi-stage Secret Sharing on General Access Structures
by: SONG Yun, WANG Ningning, XIAO Menglin, SHAO Zhiyi
Published: (2023-05-01) -
Cryptographic Rational Secret Sharing Schemes over General Networks
by: Alfonso Labao, et al.
Published: (2022-10-01) -
An ECDLP-Based Verifiable Multi-Secret Sharing Scheme
by: Khadijeh Eslami, et al.
Published: (2020-09-01)