Fair secret sharing scheme using asymmetric bivariate polynomial

In Shamir's (t,n) secret sharing scheme,any m (m≥t) participants can reconstruct the secret,and any less than t participants can't get any information about the secret.However,if there are more than t participants in the secret reconstruction phase,Shamir's secret reconstruction phase...

Full description

Saved in:
Bibliographic Details
Main Authors: Wenwei YANG, Yuqing XING
Format: Article
Language:English
Published: POSTS&TELECOM PRESS Co., LTD 2019-02-01
Series:网络与信息安全学报
Subjects:
Online Access:http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2019003
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1841530072828215296
author Wenwei YANG
Yuqing XING
author_facet Wenwei YANG
Yuqing XING
author_sort Wenwei YANG
collection DOAJ
description In Shamir's (t,n) secret sharing scheme,any m (m≥t) participants can reconstruct the secret,and any less than t participants can't get any information about the secret.However,if there are more than t participants in the secret reconstruction phase,Shamir's secret reconstruction phase can not prevent external attackers from knowing the secret,while internal attackers can release a fake share to deceive honest participants during the secret reconstruction process.A rational threshold secret sharing scheme using asymmetric bivariate polynomial with unknown rounds is proposed.Then it shows its fairness and security against non-cooperative attack with synchronization,non-cooperative attack with a synchronization,cooperative attack with synchronization and cooperative attack with a synchronization.
format Article
id doaj-art-9a372b1308984399865ed008216330c9
institution Kabale University
issn 2096-109X
language English
publishDate 2019-02-01
publisher POSTS&TELECOM PRESS Co., LTD
record_format Article
series 网络与信息安全学报
spelling doaj-art-9a372b1308984399865ed008216330c92025-01-15T03:13:18ZengPOSTS&TELECOM PRESS Co., LTD网络与信息安全学报2096-109X2019-02-015222959555159Fair secret sharing scheme using asymmetric bivariate polynomialWenwei YANGYuqing XINGIn Shamir's (t,n) secret sharing scheme,any m (m≥t) participants can reconstruct the secret,and any less than t participants can't get any information about the secret.However,if there are more than t participants in the secret reconstruction phase,Shamir's secret reconstruction phase can not prevent external attackers from knowing the secret,while internal attackers can release a fake share to deceive honest participants during the secret reconstruction process.A rational threshold secret sharing scheme using asymmetric bivariate polynomial with unknown rounds is proposed.Then it shows its fairness and security against non-cooperative attack with synchronization,non-cooperative attack with a synchronization,cooperative attack with synchronization and cooperative attack with a synchronization.http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2019003threshold secret sharingasymmetric bivariate polynomialfairnessattack model
spellingShingle Wenwei YANG
Yuqing XING
Fair secret sharing scheme using asymmetric bivariate polynomial
网络与信息安全学报
threshold secret sharing
asymmetric bivariate polynomial
fairness
attack model
title Fair secret sharing scheme using asymmetric bivariate polynomial
title_full Fair secret sharing scheme using asymmetric bivariate polynomial
title_fullStr Fair secret sharing scheme using asymmetric bivariate polynomial
title_full_unstemmed Fair secret sharing scheme using asymmetric bivariate polynomial
title_short Fair secret sharing scheme using asymmetric bivariate polynomial
title_sort fair secret sharing scheme using asymmetric bivariate polynomial
topic threshold secret sharing
asymmetric bivariate polynomial
fairness
attack model
url http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2019003
work_keys_str_mv AT wenweiyang fairsecretsharingschemeusingasymmetricbivariatepolynomial
AT yuqingxing fairsecretsharingschemeusingasymmetricbivariatepolynomial