New dynamic and verifiable multi-secret sharing schemes based on LFSR public key cryptosystem
This work addresses security and efficiency issues in cryptographic secret sharing for applications requiring multi-secret distribution, but it is incremental as it builds on existing methods.
The authors tackled the problem of verifiable multi-secret sharing schemes by identifying a security flaw in prior work and proposed two new schemes based on nonhomogeneous linear recursion and LFSR public key cryptosystem, resulting in shorter key lengths and added dynamism.
A verifiable multi-secret sharing (VMSS) scheme enables the dealer to share multiple secrets, and the deception of both participants and the dealer can be detected. After analyzing the security of VMSS schemes proposed by Mashhadi and Dehkordi in 2015, we illustrate that they cannot detect some deception of the dealer. By using nonhomogeneous linear recursion and LFSR public key cryptosystem, we introduce two new VMSS schemes. Our schemes can not only overcome the drawback mentioned above, but also have shorter private/public key length at the same safety level. Besides, our schemes have dynamism.