(n, n) XOR-based Visual Multi-secrets Sharing Scheme with Meaningful Shares

Due to the rise of the Internet and the development of digital technology, lifestyles have become rich and diverse. People are also used to transmitting important information over the Internet. With the popularity of the Internet, the methods of cybercrime are constantly innovating, becoming common and complex, and information security is under increasing threat. Naor and Shamir put up the fundamental design for visual cryptography (VC) in 1994. When the secret image is restored without relying on any complicated equipment, it is only necessary to stack those shares, and the secret image can be observed through human vision. Since then, scholars have started to research visual cryptography (VC). One of the recent advancements in visual cryptography, XOR-based VC addresses the issue of OR-based VC's poor image quality of the restored image through recent hardware cost reductions. After all n shares are collected, the restoration operation is performed by the XOR operation, so that the restored image has higher visual quality. In this study, we propose an XOR-based VCS that encrypts multiple secret images at the same time and makes each share meaningful separately so that its protection is improved. Encrypting by XOR operation makes the restored image with high visual quality. According to theoretical analysis and experimental findings, the approach is safe and efficient. The proposed VCS has better capabilities than earlier approaches.