基于二元非对称多项式的公平秘密共享方案

杨文伟; 邢玉清

doi:10.11959/j.issn.2096-109x.2019003

您当前的位置：

首页 >

文章列表页 >

基于二元非对称多项式的公平秘密共享方案

专栏：密码攻防技术研究及应用探索 | 更新时间：2024-06-03

- 基于二元非对称多项式的公平秘密共享方案
- Fair secret sharing scheme using asymmetric bivariate polynomial
- 网络与信息安全学报 2019年5卷第1期页码：22-29
- 作者机构：
- 作者简介：
  
  [ "杨文伟（1985- ），男，江苏盐城人，信息工程大学博士生，主要研究方向为网络安全、密码学、博弈论。" ]
  [ "邢玉清（1981- ），男，河南周口人，信息工程大学博士生，主要研究方向为网络安全、密码学、智能算法。" ]
- 基金信息：
  
  国家重点研发计划基金资助项目;The National Key R＆D Plan Program of China(2016YFB0801601);国家重点研发计划基金资助项目;The National Key R＆D Plan Program of China(2016YFB0801505)
- DOI：10.11959/j.issn.2096-109x.2019003
  中图分类号： TP393
- 网络首发：2019-02，
  
  纸质出版：2019-02-15
- 稿件说明：
移动端阅览
杨文伟, 邢玉清. 基于二元非对称多项式的公平秘密共享方案[J]. 网络与信息安全学报, 2019,5(1):22-29.

Wenwei YANG, Yuqing XING. Fair secret sharing scheme using asymmetric bivariate polynomial[J]. Chinese Journal of Network and Information Security, 2019, 5(1): 22-29.
杨文伟, 邢玉清. 基于二元非对称多项式的公平秘密共享方案[J]. 网络与信息安全学报, 2019,5(1):22-29. DOI： 10.11959/j.issn.2096-109x.2019003.

Wenwei YANG, Yuqing XING. Fair secret sharing scheme using asymmetric bivariate polynomial[J]. Chinese Journal of Network and Information Security, 2019, 5(1): 22-29. DOI： 10.11959/j.issn.2096-109x.2019003.

摘要

在Shamir的(t

n)秘密共享方案中，任何m(m≥t)个参与者可以重建秘密，而任何少于t个的参与者无法得到秘密的任何信息。然而，如果在秘密重建阶段有超过t个参与者进行重构时，Shamir的秘密重建阶段不能阻止外部攻击者知道秘密，而内部攻击者在秘密重构过程中可以提交虚假份额欺骗诚实参与者。提出一个基于非对称二元多项式的具有未知重构轮数的秘密共享方案，并针对4种攻击模型（同步非合谋攻击、异步非合谋攻击、同步合谋攻击及异步合谋攻击）证明方案具有防范外部攻击者和内部攻击者的安全性与公平性。

Abstract

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.

关键词

Keywords

references

SHAMIR A . How to share a secret [J ] . Communications of the ACM , 1979 , 22 ( 11 ): 612 - 613 .

BLAKLEY G R , . Safeguarding cryptographic keys [C ] // The National Computer Conference 1979 . 1979 : 313 - 317 .

TOMPA M , WOLL H . How to share a secret with cheaters [J ] . Journal of Cryptology , 1988 , 1 ( 3 ): 133 - 138 .

TIAN Y L , MA J F , PENG C G , et al . Fair (t,n) threshold secret sharing scheme [J ] . IET Information Security , 2013 , 7 ( 2 ): 106 - 112 .

HARN L . Comments on fair (t,n) threshold secret sharing scheme [J ] . IET Information Security , 2014 , 8 ( 6 ): 303 - 304 .

HARN L , LIN C L , LI Y . Fair secret reconstruction in (t,n) secret sharing [J ] . Journal of Information Security and Applications , 2015 , 23 : 1 - 7 .

RABIN T,BEN-OR M , . Verifiable secret sharing and multiparty protocols with honest majority [C ] // ACM STOC 1989 . 1989 : 73 - 85 .

KUROSAWA K , OBANA S , OGATA W . T-cheater identifiable (k,n) threshold secret sharing schemes [C ] // International Cryptology Conference on Advances in Cryptology . 1995 .

OBANA S , . Almost optimum t-cheater identifiable secret sharing schemes [C ] // International Conference on Theory ＆ Applications of Cryptographic Techniques:Advances in Cryptology . 2011 .

ROY P S , ADHIKARI A , XU R , et al . An efficient robust secret sharing scheme with optimal cheater resiliency [M ] // Security,Privacy,and Applied Cryptography Engineering . 2014 .

LIU Y X , YANG C N , WANG Y C , et al . Cheating identifiable secret sharing scheme using symmetric bivariate polynomial [J ] . Information Sciences , 2018 :453.

浏览量

668

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据