Open AccessNew dynamic and verifiable multi‐secret sharing schemes based on LFSR public key cryptosystem
Author(s) -
Yang Jing,
Fu FangWei
Publication year - 2020
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2019.0437
Subject(s) - verifiable secret sharing , computer science , key (lock) , cryptosystem , public key cryptography , secret sharing , computer security , scheme (mathematics) , theoretical computer science , cryptography , encryption , mathematics , set (abstract data type) , programming language , mathematical analysis
A verifiable multi‐secret sharing (VMSS) scheme allows distributors to share multiple secrets simultaneously and can detect fraud by both distributors and participants. After analysing the security of the VMSS schemes proposed by Dehkordi and Mashhadi in 2015, the authors point out that they could not detect the fraudulent behaviour of the dealer. By using the non‐homogeneous linear recursion and linear feedback shift rigister (LFSR) public key cryptosystem, they introduce two new VMSS schemes. The proposed schemes can not only overcome the defects mentioned above, but also have shorter private and public key lengths at the same level of security. Besides, the proposed schemes are dynamic.