Efficient (k, n)-threshold secret sharing method with cheater prevention for QR code application

Efficient (k, n)-threshold secret sharing method with cheater prevention for QR code application

To protect secret message, secret sharing technique divides it into n shares and distributes them to n involved participants. However, it is hardly to prevent a dishonest participant to cheat other by providing a fake share. To overcome this weakness, this paper presents an efficient (k, n)-threshold secret sharing approach with the functionality of cheater identification using meaningful QR codes. The secret message would be split into k pieces, and used as the coefficients of polynomial function to generate n shares. These shares would be concealed into cover QR codes based on its fault tolerance to generate meaningful QR code shares. The meaningful QR code shares are helpful to reduce the curiosity of unrelated persons when transmitted in public channel. The legitimacy of QR code share would be verified before secret reconstruction to prevent cheater in secret revealing procedure. Some experiments were done to evaluate the performance of the proposed scheme. The experimental results show that the proposed scheme is efficient, highly secure and highly robust, and it also achieves a higher embedding capacity compared to previous methods.