Enhanced (n, n)-threshold QR code secret sharing scheme based on error correction mechanism

In recent years, QR code is popular online and offline, and it is an ideal media for secret sharing. This paper utilizes the error correction capacity of QR code to propose an (n, n)-threshold secret sharing scheme for QR code. A secret QR code can be split and encoded into n cover QR codes. The generated marked QR codes still carry cover messages so that they will greatly reduce the suspicion of unauthorized people while transmitted in the public channel. The secret QR code can be easily reconstructed by using XOR operation when all the n authorized participants collaborate. Experimental results show that the proposed scheme is feasible and has high robustness. In addition, compared to the state-of-the-art work, the proposed scheme achieves a higher security.