Multiple-Image Encryption by Rotating Random Grids

Chen, Tzung‐Her; Tsao, Kai-Hsiang; Wei, Kuo‐Chen

doi:10.1109/isda.2008.141

Cited by 43 publications

(34 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several visual multi-secret sharing (VMSS) schemes have been discussed in the past few years. Studies [6][7][8][9][10][11][12] have demonstrated methods for encrypting several images simultaneously. In 2008, Chen et al [6] proposed a VMSS scheme that involves using an RG to encrypt two secret images into two shares.…”

Section: Introductionmentioning

confidence: 99%

“…Studies [6][7][8][9][10][11][12] have demonstrated methods for encrypting several images simultaneously. In 2008, Chen et al [6] proposed a VMSS scheme that involves using an RG to encrypt two secret images into two shares. In 2010, Chang et al [7] proposed a method that entails using shifting RGs to embed two secret images; this method can reduce the distortion to 1/2p.…”

Section: Introductionmentioning

confidence: 99%

“…The aforementioned studies [6][7][8][9][10][11][12], have their own unique features, and we can observe that none of them can satisfactorily deal with the concerns of encoding of more than two secret images into two shares simultaneously while possessing adjustable distortion. In this paper, we provide a general shifting approach that can embed N (≥ 2) secret images simultaneously with adjustable distortion.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A New Visual Multi-Secrets Sharing Scheme by Random Grids

2018

View full text Add to dashboard Cite

In (2, 2)-visual secret sharing (VSS) schemes, a common type of (k, n)-threshold VSS schemes, secret information can be decoded directly through only two shares by using a human vision system. Several studies have analyzed methods of simplifying the decoding process and refining encoding to pass more secret images through two identical shares. However, limited secret images are retrieved, and the quality of the recovered images is low. This paper proposes an advanced (2, 2)-VSS scheme that can embed N secret images into two rectangular shares. Compared with other related VSS schemes, more secret images can be encrypted and the distortion is adjustable in the proposed scheme, yielding more flexibility in theory and practice.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A New Visual Multi-Secrets Sharing Scheme by Random Grids

2018

View full text Add to dashboard Cite

show abstract

“…Stacking them is the only way to restore the hidden secret. Random grid-based VSS, invented by Kafri and Keren [2], received more attention in recent years, such as [3][4][5][6][7][8][9]. This method takes each pixel as a grid on the image and applies the concept of random variables to encrypt images.…”

Section: Introductionmentioning

confidence: 99%

Fault-Tolerant Visual Secret Sharing Schemes without Pixel Expansion

2016

View full text Add to dashboard Cite

Abstract:Visual cryptography encrypts a secret image into two meaningless random images, called shares, such that it can be decrypted by human vision without any calculations. However, there would be problems in alignment when these two shares are staked by hand in practice. Therefore, this paper presents the fault-tolerant schemes of stacking two shares that are acquired from secret image encryption without pixel expansion. The main idea of these schemes is to combine several pixels as a unit and then to encrypt each unit into a specific combination of pixels. Both theoretical analysis and simulation results demonstrate the effectiveness and practicality of the proposed schemes.

show abstract

“…Stacking them is the only way to restore the hidden secret. Random grid visual secret sharing (VSS for short) which is made by [6] receives more attention in recent years, such as references [3,4,5,9,12,14] are visual cryptography algorithms, designed on the basis of random grid. In the method proposed by Kafri and Keren, taking each pixel as a grid on the image and apply the concept of random variables to encrypt images.…”

Section: Introductionmentioning

confidence: 99%

Towards Shift Tolerant Visual Secret Sharing Schemes without Pixel Expansion

2016

View full text Add to dashboard Cite

Naor and Shamir proposed the visual cryptography in 1995, they encrypted secret image into two meaningless random images, called shares, and it can be decrypted by human vision without any calculations. However, there would be problems in alignment when these two shares are staked by hand in practical. Therefore, this paper presents the fault-tolerant schemes of stacking two shares which are acquired from secret image encryption without pixel expansion. The main idea of these schemes is combining several pixels to be a unit, then encrypting every unit into a specific combination of pixels. It makes visual secret sharing scheme more practical.

show abstract

Multiple-Image Encryption by Rotating Random Grids

Cited by 43 publications

References 8 publications

A New Visual Multi-Secrets Sharing Scheme by Random Grids

A New Visual Multi-Secrets Sharing Scheme by Random Grids

Fault-Tolerant Visual Secret Sharing Schemes without Pixel Expansion

Towards Shift Tolerant Visual Secret Sharing Schemes without Pixel Expansion

Contact Info

Product

Resources

About