Effective (k, n)-threshold secret sharing scheme based on sharing matrix for QR code

The secret sharing technique is an effective method for securing confidential information. That said, the generated secret message shares often consist of meaningless data, making them susceptible to attacks. To enhance the security of secret message during the sharing process, this paper proposes a \((k,n)\)-threshold secret sharing scheme for QR code based on sharing matrix technology and BEMD technology. The generated shares are all valid and scannable QR codes, reducing the curiosity of malicious individuals. Additionally, the proposed scheme supports identity verification mechanism during the secret message recovery process, which can be used to authenticate the legitimacy of the information receiver. The experimental results demonstrate that the proposed scheme exhibits robust strength, and heightened security. Additionally, it facilitates the blind extraction of the secret message.