<p>Multi-image secret sharing (MSS) scheme for two decoding options by employing universal share is discussed in this manuscript. One decoding option is piling of shares to get a secret image preview and the other option needs computation of shares to get a finer view of the secret image. In the past, universal share-based MSS schemes were presented using the common share. This paper presents a universal share-based MSS scheme which also offers two-in-one decoding. Boolean-based light-weight computation is utilized for lossless recovery of secret images. The proposed scheme encodes <i>n</i> secret images into a pie-shaped universal share and <i>n</i> noisy shares. Universal share is a common share for all <i>n</i> secrets; hence, it offers an efficient utilization of the available network bandwidth. Experimental results illustrate the effectiveness of the proposed scheme.</p>

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

Universal share-based two-in-one multi-image secret sharing scheme by rotating random grids

  • Dipak K. Rabari,
  • Yogesh K. Meghrajani,
  • Laxmi S. Desai

摘要

Multi-image secret sharing (MSS) scheme for two decoding options by employing universal share is discussed in this manuscript. One decoding option is piling of shares to get a secret image preview and the other option needs computation of shares to get a finer view of the secret image. In the past, universal share-based MSS schemes were presented using the common share. This paper presents a universal share-based MSS scheme which also offers two-in-one decoding. Boolean-based light-weight computation is utilized for lossless recovery of secret images. The proposed scheme encodes n secret images into a pie-shaped universal share and n noisy shares. Universal share is a common share for all n secrets; hence, it offers an efficient utilization of the available network bandwidth. Experimental results illustrate the effectiveness of the proposed scheme.