Secret sharing with secure secret reconstruction

被引:25
|
作者
Harn, Lein [1 ,2 ]
Xia, Zhe [3 ,4 ]
Hsu, Chingfang [5 ]
Liu, Yining [4 ]
机构
[1] Hubei Univ Technol, Sch Comp Sci & Technol, Wuhan 430068, Peoples R China
[2] Univ Missouri, Dept Comp Sci Elect Engn, Kansas City, MO 64110 USA
[3] Wuhan Univ Technol, Dept Comp Sci, Wuhan 430071, Peoples R China
[4] Guilin Univ Elect Technol, Guangxi Key Lab Trusted Software, Guilin 541004, Peoples R China
[5] Cent China Normal Univ, Comp Sch, Wuhan 430079, Peoples R China
基金
中国国家自然科学基金;
关键词
Secret sharing; Secure secret reconstruction; Bivariate polynomial; THRESHOLD-CHANGEABILITY; CHANGING THRESHOLDS; ABSENCE;
D O I
10.1016/j.ins.2020.01.038
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Threshold secret sharing is a fundamental building block in information security to provide secrecy and robustness services for various cryptographic protocols. According to the definition of (t, n) threshold secret sharing, the secret is divided into n shares, such that any t or more than t of these shares allow the secret to be reconstructed; but less than t shares reveal no information of the secret. In other words, this definition only considers protection of the secret from colluded insiders but not outsiders. In this paper, we propose an extended secret sharing scheme, called secret sharing with secure secret reconstruction, in which the secret can be protected in the reconstruction phase from both attacks of insiders and outsiders. In traditional secret sharing schemes, when more than t shares are presented in the secret reconstruction, outsiders only need to intercept t shares to recover the secret. But in our proposed basic scheme, outsiders need to intercept all the released shares to recover the secret. Obviously, requiring more shares in the reconstruction contributes to security enhancement for this process. The limitation of this basic scheme is that it cannot prevent outsiders from learning the secret if they intercept all the released shares. To address this issue, we further extend the basic scheme so that the reconstructed secret is only accessible to shareholders, but not to outsiders. To the best of our knowledge, our extended scheme is the first secret sharing scheme that satisfies this property with information theoretical security. (C) 2020 Published by Elsevier Inc.
引用
收藏
页码:1 / 8
页数:8
相关论文
共 50 条
  • [1] Threshold changeable secret sharing with secure secret reconstruction
    Meng, Keju
    Miao, Fuyou
    Huang, Wenchao
    Xiong, Yan
    INFORMATION PROCESSING LETTERS, 2020, 157
  • [2] Secure secret reconstruction and multi-secret sharing schemes with unconditional security
    Harn, Lein
    SECURITY AND COMMUNICATION NETWORKS, 2014, 7 (03) : 567 - 573
  • [3] Bivariate polynomial-based secret sharing schemes with secure secret reconstruction
    Ding, Jian
    Ke, Pinhui
    Lin, Changlu
    Wang, Huaxiong
    INFORMATION SCIENCES, 2022, 593 : 398 - 414
  • [4] On secret reconstruction in secret sharing schemes
    Wang, Huaxiong
    Wong, Duncan S.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (01) : 473 - 480
  • [5] A (n, t, n) Verifiable Multi-secret Sharing Scheme with Secure Secret Reconstruction
    Meng, Li
    Qu Shaoyun
    Xun Tiantian
    Jia, Yu
    INTERNATIONAL JOURNAL OF SECURITY AND ITS APPLICATIONS, 2015, 9 (01): : 191 - 204
  • [6] Secure Secret Sharing in the Cloud
    Chang, Ching-Chun
    Li, Chang-Tsun
    2017 IEEE INTERNATIONAL SYMPOSIUM ON MULTIMEDIA (ISM), 2017, : 358 - 361
  • [7] Fair secret reconstruction in (t, n) secret sharing
    Harn, Lein
    Lin, Changlu
    Li, Yong
    JOURNAL OF INFORMATION SECURITY AND APPLICATIONS, 2015, 23 : 1 - 7
  • [8] Secret Sharing: Secure Password Sharing Technique
    Vyas, Hardik A.
    2015 FIFTH INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS AND NETWORK TECHNOLOGIES (CSNT2015), 2015, : 731 - 735
  • [9] Secret sharing with public reconstruction
    Beimel, A
    Chor, B
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (05) : 1887 - 1896
  • [10] Secret sharing with public reconstruction
    Beimel, A
    Chor, B
    ADVANCES IN CRYPTOLOGY - CRYPTO '95, 1995, 963 : 353 - 366