Lossless and unlimited multi-image sharing based on Chinese remainder theorem and Lagrange interpolation

Chang, Chin‐Chen; Huynh, Ngoc-Tu; Le, Hai-Duong

doi:10.1016/j.sigpro.2013.12.022

Cited by 28 publications

(17 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to evaluate the performances of the proposed construction with respect to the already proposed schemes, we implemented the images sharing approach proposed in Thien and Lin (2002) based on Shamir's scheme, and a CRTbased approach adapted from Chang et al (2014). Implementation of the experimented approaches was performed using Delphi 6, and experimented on an i7-2600 3.40 Ghz platform.…”

Section: Experiments and Performances Resultsmentioning

confidence: 99%

A novel fast and provably secure (t,n)-threshold secret sharing construction for digital images

Faraoun

2014

Journal of Information Security and Applications

View full text Add to dashboard Cite

Section: Experiments and Performances Resultsmentioning

confidence: 99%

A novel fast and provably secure (t,n)-threshold secret sharing construction for digital images

Faraoun

2014

Journal of Information Security and Applications

View full text Add to dashboard Cite

“…The CRT [22][23][24], resulting from Bézout's Lemma [25], is an approach to determine an integer in a specific range by the given system of simultaneous congruencies in number theory. CRT is used as a main building block in our proposed scheme and described as follows.…”

Section: Chinese Remainder Theoremmentioning

confidence: 99%

“…CRT can make a solution to determine an integer by the given system of simultaneous congruencies in number theory. Nowadays, CRT is used extensively in secret sharing and other applications of information security [22][23][24]. Fortunately, we also find that CRT is very suitable for data hiding.…”

Section: Introductionmentioning

confidence: 98%

Efficient Information Hiding Based on Theory of Numbers

et al. 2018

Self Cite

View full text Add to dashboard Cite

Data hiding is an efficient technique that conceals secret data into a digital medium. In 2006, Zhang and Wang proposed a data hiding scheme called exploiting modification direction (EMD) which has become a milestone in the field of data hiding. In recent years, many EMD-type data hiding schemes have been developed, but their embedding capacity remains restricted. In this paper, a novel data hiding scheme based on the combination of Chinese remainder theorem (CRT) and a new extraction function is proposed. By the proposed scheme, the cover image is divided into non-overlapping pixel groups for embedding to increase the embedding capacity. Experimental results show that the embedding capacity of the proposed scheme is significantly higher (greater than 2.5 bpp) than previously proposed schemes while ensuring very good visual quality of the stego image. In addition, security analysis is given to show that the proposed scheme can resist visual attack.

show abstract

“…The resultant shadow size is N/k. In 2014, Chang et al [4] proposed a multi-image sharing scheme based on Chinese remainder theorem and Lagrange interpolation. All secret images have the same size.…”

Section: Introductionmentioning

confidence: 99%

Secret image sharing with smaller shadow sizes for general access structures

Chen

Shyu³

2015

Multimed Tools Appl

View full text Add to dashboard Cite

In the area of secret image sharing (SIS), most papers focused on the schemes for threshold or some special access structures. Regarding general access structures (GAS), few results have been found in the literature. Two SIS schemes for GAS were proposed in 2001 and 2010, both are based on qualified sets. However, one distorts the reconstructed secret image, and some extra information is needed in both schemes. Here, we propose three polynomial based SIS schemes for GAS. Considering either qualified or forbidden sets, these schemes can reconstruct the secret image perfectly without any extra information needed. Some proof and analysis on the shadow sizes of the three schemes are given to lead us to choose the one with the smallest size. In addition, we also give some comparisons with two existing schemes, and security issue is also addressed in conclusion.

show abstract

Lossless and unlimited multi-image sharing based on Chinese remainder theorem and Lagrange interpolation

Cited by 28 publications

References 18 publications

A novel fast and provably secure (t,n)-threshold secret sharing construction for digital images

A novel fast and provably secure (t,n)-threshold secret sharing construction for digital images

Efficient Information Hiding Based on Theory of Numbers

Secret image sharing with smaller shadow sizes for general access structures

Contact Info

Product

Resources

About