2006Unpublished venueRequires access

An Image Secret Sharing Method

Li Bai, Saroj Biswas, Albert Ortiz, Don Dalessandro

Open publisher page 16 citations

Abstract

This paper presents an image secret sharing method which essentially incorporates two k-out-of-n secret sharing schemes: i) Shamir's secret sharing scheme and ii) matrix projection secret sharing scheme. The technique allows a secret image to be divided as n image shares so that: i) any k image shares (klesn) can be used to reconstruct the secret image in lossless manner and ii) any (k-1) or fewer image shares cannot get sufficient information to reveal the secret image. It is an effective, reliable and secure method to prevent the secret image from being lost, stolen or corrupted. In comparison with other image secret sharing methods, this approach's advantages are its large compression rate on the size of the image shares, its strong protection of the secret image and its ability for realtime processing

About this research paper

What this paper is about

This paper presents an image secret sharing method which essentially incorporates two k-out-of-n secret sharing schemes: i) Shamir's secret sharing scheme and ii) matrix projection secret sharing scheme. The technique allows a secret image to be divided as n image shares so that: i) any k image shares (klesn) can be used to reconstruct the secret image in lossless manner and ii) any (k-1) or fewer image shares cannot get sufficient information to reveal the secret image. It is an effective, reliable and secure method to prevent the secret image from being lost, stolen or corrupted. In comparison with other image secret sharing methods, this approach's advantages are its large compression rate on the size of the image shares, its strong protection of the secret image and its ability for realtime processing

Why it matters

OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper presents an image secret sharing method which essentially incorporates two k-out-of-n secret sharing schemes: i) Shamir's secret sharing scheme and ii) matrix projection secret sharing scheme. The technique allows a secret image to be divided as n image shares so that: i) any k image shares (klesn) can be used to reconstruct the secret image in lossless manner and ii) any (k-1) or fewer image shares cannot get sufficient information to reveal the secret image. It is an effective, reliable and secure method to prevent the secret image from being lost, stolen or corrupted. In comparison with other image secret sharing methods, this approach's advantages are its large compression rate on the size of the image shares, its strong protection of the secret image and its ability for realtime processing

Key concepts: Secret sharing, Image sharing, Homomorphic secret sharing, Shamir's Secret Sharing, Secure multi-party computation, Lossless compression, Image (mathematics), Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
An Image Secret Sharing Method — Research Paper | ScholarLens