版权说明 操作指南
首页 > 成果 > 详情

(t, n) Multi-Secret Sharing Scheme Based on Bivariate Polynomial

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Harn, Lein;Hsu, Ching-Fang*
通讯作者:
Hsu, Ching-Fang
作者机构:
[Harn, Lein; Hsu, Ching-Fang] Univ Missouri, Dept Comp Sci Elect Engn, Kansas City, MO 64110 USA.
[Hsu, Ching-Fang] Cent China Normal Univ, Comp Sch, Wuhan 430079, Hubei, Peoples R China.
通讯机构:
[Hsu, Ching-Fang] U
[Hsu, Ching-Fang] C
Univ Missouri, Dept Comp Sci Elect Engn, Kansas City, MO 64110 USA.
Cent China Normal Univ, Comp Sch, Wuhan 430079, Hubei, Peoples R China.
语种:
英文
关键词:
Secret sharing scheme;Multiple secrets;Unconditional security;Bivariate polynomial
期刊:
Wireless Personal Communications
ISSN:
0929-6212
年:
2017
卷:
95
期:
2
页码:
1495-1504
机构署名:
本校为通讯机构
院系归属:
计算机学院
摘要:
In a (t, n) secret sharing scheme (SS), a dealer divides the secret into n shares in such way that any t or more than t shares can reconstruct the secret but fewer than t shares cannot reconstruct the secret. The multi-SS is an extension of the (t, n) SS in which shares can be reused to reconstruct multiple secrets. Thus, the efficiency of the multi-SS is better than the efficiency of the (t, n) SS. In this paper, we propose the first multi-SS using a bivariate polynomial. Our design is unique in comparing with all existing multi-SSs. Shares generated using a bivariate polynomial can not only ...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com