Progressive Secret Sharing with Adaptive Priority and Perfect Reconstruction.

Area of Science:

• Computer Science
• Information Security
• Cryptography

Background:

• Traditional visual secret sharing (VSS) schemes often face limitations with an odd number of shared images during recovery.
• Existing methods may struggle with flexibility in handling varying numbers of collected shares.

Purpose of the Study:

• To propose a novel progressive visual secret sharing (PVSS) technique.
• To enhance the flexibility and reliability of secret image reconstruction regardless of the number of shared images.

Main Methods:

• The proposed method utilizes bitwise and exclusive-OR (XOR) operations for generating shared images.
• It incorporates an adaptive priority weight mechanism to manage the sharing process.

Main Results:

• The technique successfully reconstructs secret images from both binary, grayscale, and color images.
• Experimental results demonstrate perfect reconstruction, irrespective of whether the number of stacked shared images is odd or even.
• Theoretical analysis confirms the lossless recovery capability of the proposed method.

Conclusions:

• The new PVSS technique effectively overcomes limitations of previous schemes, offering robust performance.
• It provides a strong alternative for implementing advanced PVSS systems.
• The method ensures lossless secret image recovery, enhancing data security.