A Novel Verifiable Dynamic Multi-Policy Secret Sharing Scheme

被引:0
|
作者
Wang, Feng [1 ,2 ,3 ,4 ]
Gu, Lize [1 ,2 ,3 ,4 ]
Zheng, Shihui [1 ,2 ,3 ,4 ]
Yang, Yixian [1 ,2 ,3 ,4 ]
Hu, Zhengming [1 ,2 ,3 ,4 ]
机构
[1] Beijing Univ Posts & Telecommun, Informat Secur Ctr, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
[2] Beijing Univ Posts & Telecommun, MOE, Key Lab Network & Informat Attack & Def Technol, Beijing 100876, Peoples R China
[3] Natl Engn Lab Disaster Backup & Recovery, Beijing 100876, Peoples R China
[4] Beijing Univ Posts & Telecommun, Beijing 100876, Peoples R China
基金
中国国家自然科学基金;
关键词
verifiable; dynamic; multi-policy; key management; threshold;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Most verifiable multi-secret sharing schemes can not distinguish the security classification because of having the common drawback of sharing secrets with the same threshold value. In order to withstand the problem, a novel verifiable dynamic multi-policy secret sharing scheme is proposed, in which the dealer can freely give any sets of group secrets for sharing according to the different threshold values, and the shadows held by the participants are not only reusable but also verifiable. The proposed scheme provides efficient solutions against the malicious dealer and participants. Moreover, the proposed scheme can add new participants and new group secrets. Compared to the current secret sharing scheme, the proposed scheme is more flexible and more practical application.
引用
收藏
页码:1474 / 1479
页数:6
相关论文
共 50 条
  • [31] Efficient verifiable multi-secret sharing scheme based on hash function
    Shao, Jun
    INFORMATION SCIENCES, 2014, 278 : 104 - 109
  • [32] A Verifiable Multi-Secret Sharing Scheme Based on Short Integer Solution
    LI Fulin
    YAN Jiayun
    ZHU Shixin
    HU Hang
    ChineseJournalofElectronics, 2023, 32 (03) : 556 - 563
  • [33] A New Verifiable Multi-secret Sharing Scheme Realizing Adversary Structure
    Masoud Hadian Dehkordi
    Yousof Farzaneh
    Wireless Personal Communications, 2015, 82 : 1749 - 1758
  • [34] A New Verifiable Multi-secret Sharing Scheme Based on Bilinear Maps
    Ziba Eslami
    Saideh Kabiri Rad
    Wireless Personal Communications, 2012, 63 : 459 - 467
  • [35] A New Verifiable Multi-secret Sharing Scheme Based on Bilinear Maps
    Eslami, Ziba
    Rad, Saideh Kabiri
    WIRELESS PERSONAL COMMUNICATIONS, 2012, 63 (02) : 459 - 467
  • [36] Publicly verifiable multi-secret sharing scheme from bilinear pairings
    Wu, Tsu-Yang
    Tseng, Yuh-Min
    IET INFORMATION SECURITY, 2013, 7 (03) : 239 - 246
  • [37] A Verifiable Secret Sharing Scheme without Using Multi-Party Computations
    Makino, Takumi
    Kamidoi, Yoko
    Wakabayashi, Shin'ichi
    2020 IEEE 44TH ANNUAL COMPUTERS, SOFTWARE, AND APPLICATIONS CONFERENCE (COMPSAC 2020), 2020, : 845 - 850
  • [38] Secure Verifiable Secret Short Sharing Scheme for Multi-Cloud Storage
    Deryabin, Maxim
    Chervyakov, Nikolay
    Tchernykh, Andrei
    Babenko, Mikhail
    Kucherov, Nikolay
    Miranda-Lopez, Vanessa
    Avetisyan, Arutyun
    PROCEEDINGS 2018 INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING & SIMULATION (HPCS), 2018, : 700 - 706
  • [39] An Efficient Verifiable Threshold Multi-Secret Sharing Scheme With Different Stages
    Chen, Dong
    Lu, Wei
    Xing, Weiwei
    Wang, Na
    IEEE ACCESS, 2019, 7 : 107104 - 107110
  • [40] A verifiable multi-secret image sharing scheme based on DNA encryption
    Chattopadhyay A.K.
    Saha S.
    Nag A.
    Singh J.P.
    Multimedia Tools and Applications, 2025, 84 (4) : 1967 - 1983