<p>A secret sharing scheme (SSS) is a scheme in which a dealer (owner of the secret) splits the secret into shares in such a way that each participant will get precisely one share, and a minimum threshold is required to compute the secret from the distributed shares. This manuscript discusses a new addition-blending-based verifiable visual secret image sharing (VSIS) scheme, where the secret and its shares are in the form of images, and its verifiability is ensured by the Hash function. The dealer initially chooses an Arnold matrix and applies the Arnold transformation on the message image <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(I_M\)</EquationSource> </InlineEquation>, followed by the Walsh-Hadamard (WH) transformation to obtain the secret image <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(I_S\)</EquationSource> </InlineEquation>. The combination of both transformations strengthens the encryption process, making it suitable for visual data. Moreover, since both transformations are invertible, they enable perfect reconstruction and lossless recovery. An SSS is then applied on <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(I_S\)</EquationSource> </InlineEquation> to generate and distribute the secret shares. The scheme’s security, accuracy, and robustness is supported through detailed theoretical analysis, as well as experimental and statistical evaluations. In addition, comparisons with existing methods demonstrate that our approach offers stronger security, built-in verifiability, and improved overall efficiency.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A hash-based verifiable visual secret image sharing scheme with WH and arnold transforms

  • Mohit Kumar Baghel,
  • Neha Arora

摘要

A secret sharing scheme (SSS) is a scheme in which a dealer (owner of the secret) splits the secret into shares in such a way that each participant will get precisely one share, and a minimum threshold is required to compute the secret from the distributed shares. This manuscript discusses a new addition-blending-based verifiable visual secret image sharing (VSIS) scheme, where the secret and its shares are in the form of images, and its verifiability is ensured by the Hash function. The dealer initially chooses an Arnold matrix and applies the Arnold transformation on the message image \(I_M\) , followed by the Walsh-Hadamard (WH) transformation to obtain the secret image \(I_S\) . The combination of both transformations strengthens the encryption process, making it suitable for visual data. Moreover, since both transformations are invertible, they enable perfect reconstruction and lossless recovery. An SSS is then applied on \(I_S\) to generate and distribute the secret shares. The scheme’s security, accuracy, and robustness is supported through detailed theoretical analysis, as well as experimental and statistical evaluations. In addition, comparisons with existing methods demonstrate that our approach offers stronger security, built-in verifiability, and improved overall efficiency.