A DISTRIBUTED SECRET SHARING SYSTEM WITH REED SOLOMON CODE FOR QR CODE

Abstract

Secret sharing is also called secret splitting refers to methods for distributing a secret amongst a group of participants, each of whom is allocated a share of the secret. The secret can be reconstructed only when a sufficient number, of possibly different types, of shares are combined together; individual shares are of no use on their own. QR barcodes are used extensively due to their beneficial properties, including small tag, large data capacity, reliability, and high-speed scanning. This approach differs from related QR code schemes in which it uses the QR characteristics to achieve secret sharing and can resist the print-and-scan operation. .

In this study, I utilized the characteristic of Reed Solomon code to detect and correct the errors in the QR module and distribute the secret by using the (N,N) - Threshold Secret Sharing Scheme. The secret can be split and conveyed with QR tags in the distribution application, and the system can retrieve the lossless secret when authorized participants cooperate. General browsers can read the original data from the marked QR tag via a barcode reader, and this helps reduce the security risk of the secret.