Universal share-based two-in-one multi-image secret sharing scheme by rotating random grids
Abstract 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 t...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2025-03-01
|
| Series: | EURASIP Journal on Information Security |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s13635-024-00185-0 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Abstract 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. |
|---|---|
| ISSN: | 2510-523X |