Ramp Progressive Secret Image Sharing Using Ensemble of Simple Methods

This paper reviews the limitations of traditional Secret Image Sharing (SIS) methods and recent advancements such as PSIS, RPSIS, and SSIS, and presents an optimized and practical combinatorial method for secret image sharing by ensemble of simple methods. In this approach, a color or grayscale image is divided into n shares, each of which is individually meaningless. The image is reconstructed through XOR operations between corresponding pixels in different shares. The main innovation of this method is the introduction of two thresholds, <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{k}_{1}$</tex> and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{k}_{2}$</tex>. This scheme is characterized by parameters <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(\mathrm{k}_{1},\ \mathrm{k}_{2},\ \mathrm{n})$</tex>, where having fewer than <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{k}_{1}$</tex> shares reveals no information about the original image, while between <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{k}_{1}$</tex> and k2 shares, the image quality progressively improves and reaches near-complete reconstruction. Ultimately, with k2 or more shares, the image can be recovered in its full resolution. This method allows for customization of the image quality improvement rate between <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{k}_1$</tex> and k2 and addresses the limitations of previous designs regarding the selection of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{k}_{1},\mathrm{k}_{2}$</tex>, and n values. Its flexibility in providing suitable models based on specific user needs makes this method appropriate for various applications in secret image sharing.

Authors

Institutions

Publication Details

Published
2024-11-19
DOI
https://doi.org/10.1109/iccke65377.2024.10874825
Primary Topic
Advanced Steganography and Watermarking Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Ramp Progressive Secret Image Sharing Using Ensemble of Simple Methods

Mohammad Taheri, A. Mokhtari
1 links
Advanced Steganography and Watermarking Techniques
article

Ramp Progressive Secret Image Sharing Using Ensemble of Simple Methods

Mohammad Taheri, A. Mokhtari
article en

Abstract

This paper reviews the limitations of traditional Secret Image Sharing (SIS) methods and recent advancements such as PSIS, RPSIS, and SSIS, and presents an optimized and practical combinatorial method for secret image sharing by ensemble of simple methods. In this approach, a color or grayscale image is divided into n shares, each of which is individually meaningless. The image is reconstructed through XOR operations between corresponding pixels in different shares. The main innovation of this method is the introduction of two thresholds, <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{k}_{1}$</tex> and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{k}_{2}$</tex>. This scheme is characterized by parameters <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(\mathrm{k}_{1},\ \mathrm{k}_{2},\ \mathrm{n})$</tex>, where having fewer than <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{k}_{1}$</tex> shares reveals no information about the original image, while between <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{k}_{1}$</tex> and k2 shares, the image quality progressively improves and reaches near-complete reconstruction. Ultimately, with k2 or more shares, the image can be recovered in its full resolution. This method allows for customization of the image quality improvement rate between <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{k}_1$</tex> and k2 and addresses the limitations of previous designs regarding the selection of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{k}_{1},\mathrm{k}_{2}$</tex>, and n values. Its flexibility in providing suitable models based on specific user needs makes this method appropriate for various applications in secret image sharing.

Shiraz University (IR)
Openalex Percentile: Top 73%
Advanced Steganography and Watermarking Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.