# New dynamic and verifiable multi-secret sharing schemes based on LFSR public key cryptosystem

## TL;DR

This paper introduces two new verifiable multi-secret sharing schemes utilizing LFSR public key cryptosystem, addressing security flaws in previous schemes and offering shorter keys and dynamism.

## Contribution

The paper proposes novel VMSS schemes based on LFSR cryptosystem that detect dealer deception and have shorter keys, improving security and efficiency.

## Key findings

- Schemes detect dealer deception effectively.
- Shorter private/public keys at same security level.
- Schemes support dynamism.

## Abstract

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.