Applying cheating identifiable secret sharing scheme in multimedia security

Abstract In (k,n) secret sharing scheme, one secret is encrypted into n shares in such a way that only k or more shares can decrypt the secret. Secret sharing scheme can be extended into the field of multimedia that provides an efficient way to protect confidential information on multimedia. Secret image sharing is just the most important extension of secret sharing that can safely guard the secrecy of images among multiple participants. On the other hand, cheating detection is an important issue in traditional secret sharing schemes that have been discussed for many years. However, the issue of cheating detection in secret image sharing has not been discussed sufficiently. In this paper, we consider the cheating problem in the application of secret image sharing schemes and construct a (k,n) secret image sharing scheme with the ability of cheating detection and identification. Our scheme is capable of identifying cheaters when k participants involve in reconstruction. The cheating identification ability and size of shadow in the proposed scheme are improved from the previous cheating identifiable secret image sharing scheme.

Download Full-text

Secret Image Sharing Scheme Based on a Boolean Operation

Cybernetics and Information Technologies ◽

10.2478/cait-2014-0023 ◽

2014 ◽

Vol 14 (2) ◽

pp. 98-113 ◽

Cited By ~ 6

Author(s):

Amitava Nag ◽

Sushanta Biswas ◽

Debasree Sarkar ◽

Partha Pratim Sarka

Keyword(s):

Fault Tolerance ◽

Secret Sharing ◽

Boolean Operation ◽

Secret Image Sharing ◽

Research Papers ◽

Secret Image ◽

Image Sharing ◽

Generation Technique ◽

Sharing Scheme ◽

Secret Image Sharing Scheme

Abstract Traditionally extensive researches have been done on secret image sharing which support the fault tolerance property. But their reconstruction complexity is high. Some research papers on secret image sharing are also available with smaller reconstruction complexity, due to the use of a Boolean operation. But these research works lack the fault tolerance property which is the heart of secret sharing. This paper deals with a general (k, n) secret image sharing scheme for gray scale images with both low reconstruction complexity and preservation of the fault tolerance property. Moreover, the proposed sharing generation technique can also be applied on colour images.

Download Full-text

Polynomial-Based Secret Image Sharing Scheme with Fully Lossless Recovery

International Journal of Digital Crime and Forensics ◽

10.4018/ijdcf.2018040107 ◽

2018 ◽

Vol 10 (2) ◽

pp. 120-136 ◽

Cited By ~ 7

Author(s):

Wanmeng Ding ◽

Kesheng Liu ◽

Xuehu Yan ◽

Lintao Liu

Keyword(s):

Storage Capacity ◽

Image Data ◽

Secret Sharing Scheme ◽

Secret Image Sharing ◽

Secret Image ◽

Image Sharing ◽

Lossless Recovery ◽

Sharing Scheme ◽

And Storage ◽

Secret Image Sharing Scheme

Lossless recovery is important for the transmission and storage of image data. In polynomial-based secret image sharing, despite many previous researchers attempted to achieve lossless recovery, none of the proposed work can simultaneously satisfy an efficiency execution and at no cost of some storage capacity. This article proposes a secret sharing scheme with fully lossless recovery based on polynomial-based scheme and modular algebraic recovery. The major difference between the proposed method and polynomial-based scheme is that, instead of only using the first coefficient of sharing polynomial, this article uses the first two coefficients of sharing polynomial to embed the pixels as well as guarantee security. Both theoretical proof and experimental results are given to demonstrate the effectiveness of the proposed scheme.

Download Full-text

(k,n) secret image sharing scheme capable of cheating detection

EURASIP Journal on Wireless Communications and Networking ◽

10.1186/s13638-018-1084-7 ◽

2018 ◽

Vol 2018 (1) ◽

Cited By ~ 8

Author(s):

Yan-Xiao Liu ◽

Qin-Dong Sun ◽

Ching-Nung Yang

Keyword(s):

Secret Image Sharing ◽

Secret Image ◽

Image Sharing ◽

Sharing Scheme ◽

Cheating Detection ◽

Secret Image Sharing Scheme

Download Full-text

Multi Secret Image Sharing Scheme of General Access Structure with Meaningful Shares

Mathematics ◽

10.3390/math8091582 ◽

2020 ◽

Vol 8 (9) ◽

pp. 1582

Author(s):

Hongliang Cai ◽

Dan Tang

Keyword(s):

Secret Sharing ◽

Secret Sharing Schemes ◽

Access Structure ◽

Secret Image Sharing ◽

Secret Image ◽

Image Sharing ◽

Sharing Scheme ◽

General Access Structure ◽

Multi Secret Sharing ◽

Secret Image Sharing Scheme

A Multi Secret Image sharing scheme can share several secret images among certain participators securely. Boolean-based secret sharing schemes are one kind of secret sharing method with light-weighted computation compared to the previous complex algebraic-based methods, which can realize the sharing of multi secret images. However, the existing Boolean-based multi secret sharing schemes are mostly restricted to the particular case of (2, n) and (n, n), only few Boolean-based multi secret sharing schemes study the general access structure, and the shares are mostly meaningless. In this paper, a new Boolean-based multi secret sharing scheme with the general access structure is proposed. All the shares are meaningful, which can avoid attracting the attention of adversaries, and the secret images can be recovered in a lossless manner. The feasibility of the scheme is proven, the performance is validated by the experiments on the gray images, and the analysis of the comparison with other methods is also given out.

Download Full-text

An Image Secret Sharing Method Based on Matrix Theory

Symmetry ◽

10.3390/sym10100530 ◽

2018 ◽

Vol 10 (10) ◽

pp. 530 ◽

Cited By ~ 8

Author(s):

Wanmeng Ding ◽

Kesheng Liu ◽

Xuehu Yan ◽

Huaixi Wang ◽

Lintao Liu ◽

...

Keyword(s):

Secret Sharing ◽

Matrix Theory ◽

Secret Image Sharing ◽

Secret Image ◽

Image Sharing ◽

Lossless Recovery ◽

Sharing Scheme ◽

Image Secret Sharing ◽

Special Case ◽

Secret Image Sharing Scheme

Most of today’s secret image sharing technologies are based on the polynomial-based secret sharing scheme proposed by shamir. At present, researchers mostly focus on the development of properties such as small shadow size and lossless recovery, instead of the principle of Shamir’s polynomial-based SS scheme. In this paper, matrix theory is used to analyze Shamir’s polynomial-based scheme, and a general (k, n) threshold secret image sharing scheme based on matrix theory is proposed. The effectiveness of the proposed scheme is proved by theoretical and experimental results. Moreover, it has been proved that the Shamir’s polynomial-based SS scheme is a special case of our proposed scheme.

Download Full-text

Improvements in Geometry-Based Secret Image Sharing Approach with Steganography

Mathematical Problems in Engineering ◽

10.1155/2009/187874 ◽

2009 ◽

Vol 2009 ◽

pp. 1-11 ◽

Cited By ~ 4

Author(s):

Mustafa Ulutas ◽

Vasif V. Nabiyev ◽

Guzin Ulutas

Keyword(s):

Secret Sharing ◽

The Internet ◽

Secret Sharing Scheme ◽

Secret Image Sharing ◽

Sensitive Data ◽

Secret Image ◽

Meaningful Shares ◽

Image Sharing ◽

Sharing Scheme ◽

Fast Development

Protection of the sensitive data is an important issue because of the fast development of applications that need exchange of the secret information over the Internet. Secret sharing is an idea proposed by Shamir and Blakley separately with different implementations in 1979. Lin and Tsai proposed a method that uses Steganography to create meaningful shares by using Shamir's secret sharing scheme in 2004. In recent years, researchers work to remove some of the weaknesses of this method. However, all of these methods need cover images four times bigger than the secret image. This arises two problems: increased storage and bandwidth need for shares. We used cover images with the same size as the secret image by using both Blakley's secret sharing approach and Steganography. Therefore, we achieved reduced storage and transmission bandwidth for shares. Besides, the proposed method creates meaningful shares by using Steganography instead of noise-like shares, different from other studies that use Blakley's approach.

Download Full-text