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: | , , |
|---|---|
| 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!
|
| _version_ | 1841530309202411520 |
|---|---|
| author | Meng-hui LI You-liang TIAN Jin-ming FENG |
| author_facet | Meng-hui LI You-liang TIAN Jin-ming FENG |
| author_sort | Meng-hui LI |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-9ef39f9f7c7e4d2290c3269206a24133 |
| institution | Kabale University |
| issn | 2096-109X |
| language | English |
| publishDate | 2017-01-01 |
| publisher | POSTS&TELECOM PRESS Co., LTD |
| record_format | Article |
| series | 网络与信息安全学报 |
| spelling | doaj-art-9ef39f9f7c7e4d2290c3269206a241332025-01-15T03:05:28ZengPOSTS&TELECOM PRESS Co., LTD网络与信息安全学报2096-109X2017-01-013616759549580Constant-round fair rational secret sharing schemeMeng-hui LIYou-liang TIANJin-ming FENGIn 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.http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2017.00136secret sharingcommunication complexitygame theorybilinear pairing |
| spellingShingle | Meng-hui LI You-liang TIAN Jin-ming FENG Constant-round fair rational secret sharing scheme 网络与信息安全学报 secret sharing communication complexity game theory bilinear pairing |
| title | Constant-round fair rational secret sharing scheme |
| title_full | Constant-round fair rational secret sharing scheme |
| title_fullStr | Constant-round fair rational secret sharing scheme |
| title_full_unstemmed | Constant-round fair rational secret sharing scheme |
| title_short | Constant-round fair rational secret sharing scheme |
| title_sort | constant round fair rational secret sharing scheme |
| topic | secret sharing communication complexity game theory bilinear pairing |
| url | http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2017.00136 |
| work_keys_str_mv | AT menghuili constantroundfairrationalsecretsharingscheme AT youliangtian constantroundfairrationalsecretsharingscheme AT jinmingfeng constantroundfairrationalsecretsharingscheme |