article

Improved schemes for visual secret sharing based on random grids

Authors:

Bin YuAuthors Info & Claims

Multimedia Tools and Applications, Volume 78, Issue 9

Pages 12055 - 12082

https://doi.org/10.1007/s11042-018-6738-2

Published: 01 May 2019 Publication History

Abstract

Random grid (RG) is an alternative approach to realize a visual secret sharing (VSS) scheme. RG-based VSS has merits such as no pixel expansion and no tailor-made matrix requirement. Recently, many investigations on RG-based VSS are made. However, they need further improvements. In this paper, we obtain some improvements on RG-based VSS. Actually, two improved schemes are proposed, namely RG-based VSS for general access structure (GAS) with improved contrast and extended RG-based VSS with improved access structure. The first scheme can achieve better contrast than previous schemes. The second scheme reduces the chance of suspicion on secret image encryption by generating meaningful shares instead of noise-like shares in the first scheme, and improves the access structure from (k, k) to GAS while maintaining the property that the contrast of the recovered image is traded with that of share images by setting a certain parameter from small to large. Finally, theoretical analyses and experimental results are provided to demonstrate the effectiveness and advantages of the proposed schemes.

References

[1]

Ateniese G, Blundo C, De Santis A, Stinson D (1996) Visual cryptography for general access structures. Inf Comput 129(2):86---106

Digital Library

[2]

Blundo C, De Santis A, Stinson D (1999) On the contrast in visual cryptography. J Cryptol 12:261---289

Digital Library

[3]

Chao H, Fan T (2017) Random-grid based progressive visual secret sharing scheme with adaptive priority. Digit Sign Process 68:69---80

[4]

Chen Y (2017) Fully incrementing visual cryptography from a succinct non-monotonic structure. IEEE Trans Inform Foren Sec 12(5):1082---1091

[5]

Chen T, Tsao K (2009) Visual secret sharing by random grids revisited. Pattern Recogn 42(9):2203---2217

Digital Library

[6]

Chen T, Tsao K (2011) Threshold visual secret sharing by random grids. J Syst Softw 84:1197---1208

Digital Library

[7]

Chen T, Tsao K (2011) User-friendly random-grid-based visual secret sharing. IEEE Trans Circ Syst Video Technol 21(11):1693---1703

Digital Library

[8]

Cimato S., Prisco R., De Santis A.: Probabilistic visual cryptography schemes. Comput J 49, 97---107 (2006)

Digital Library

[9]

D'Arco P, Prisco R, Desmedt Y (2016) Private visual share-homomorphic computation and randomness reduction in visual cryptography. Int Conf Inform Theor Sec: 95---113

[10]

De Prisco R, De Santis A (2014) On the relation of random grid and deterministic visual cryptography. IEEE Trans Inform Foren Sec 9(4):653---665

Digital Library

[11]

Fu Z, Yu B (2013) Visual cryptography and random grids schemes. Digit-Foren Watermark: 109---122

[12]

Fu Z, Yu B (2014) Optimal pixel expansion of deterministic visual cryptography scheme. Multimed Tools Appl 73(3):1177---1193

Digital Library

[13]

Guo T, Liu F, Wu C (2013) Threshold visual secret sharing by random grids with improved contrast. J Syst Softw 86:2094---2109

Digital Library

[14]

Guo T, Liu F, Wu C (2014) k out of k extended visual cryptography scheme by random grids. Signal Process 94:90---101

Digital Library

[15]

Horng G, Chen T, Tsai D (2006) Cheating in visual cryptography. Designs Codes Cryptograp 38(2):219---236

Digital Library

[16]

Hu H, Shen G, Fu Z, Wang J (2016) General construction for XOR-based visual cryptography and its extended capability. Multimed Tools Appl 75(21):1---29

Digital Library

[17]

Ito R, Kuwakado H, Tanaka H (1999) Image size invariant visual cryptography. IEICE Trans Fundam Electron Commun Comput Sci 82(10):2172---2177

[18]

Kafri O, Keren E (1987) Encryption of pictures and shapes by random grids. Opt Lett 12(6):377---379

[19]

Liu F, Wu C (2011) Embedded extended visual cryptography schemes. IEEE Trans Inform Foren Sec 6(2):307---322

Digital Library

[20]

Naor M, Shamir A (1995) Visual cryptography. Lect Notes Comput Sci 950(1):1---2

Digital Library

[21]

Prisco R, Santis A (2013) Color visual cryptography schemes for black and white secret images. Theor Comput Sci 510(7):62---86

Digital Library

[22]

Ren Y, Liu F, Guo T, Feng R, Lin D (2017) Cheating prevention visual cryptography scheme using Latin square. IET Inf Secur 11(4):211---219

[23]

Shen, G Liu F, Fu Z., Yu B (2016) Perfect contrast XOR-based visual cryptography schemes via linear algebra. Designs Codes Cryptogra: 1---23

Digital Library

[24]

Shivani S, Agarwal S (2016) Progressive visual cryptography with unexpanded meaningful shares. ACM transactions on multimedia computing. Commun Appl 12(4):1---24

Digital Library

[25]

Shyu S (2006) Efficient visual secret sharing scheme for color images. Pattern Recogn 39(5):866---880

Digital Library

[26]

Shyu S (2007) Image encryption by random grids. Pattern Recogn 40(3):1014---1031

Digital Library

[27]

Shyu S (2009) Image encryption by multiple random grids. Pattern Recogn 42(7):1582---1596

Digital Library

[28]

Shyu S (2013) Visual cryptograms of random grids for general access structures. IEEE Trans Circ Syst Video Technol 23(3):414---424

Digital Library

[29]

Wu X, Sun W (2012) Random grid-based visual secret sharing for general access structures with cheat-preventing ability. J Syst Softw 85(5):1119---1134

Digital Library

[30]

Wu X, Sun W (2012) Visual secret sharing for general access structures by random grids. IET Inf Secur 6(4):299---309

[31]

Wu X, Sun W (2013) Improving the visual quality of random grid-based visual secret sharing. Signal Process 93(5):977---995

Digital Library

[32]

Wu X, Sun W (2014) Generalized random grid and its applications in visual cryptography. IEEE Trans Inform Foren Sec 8(9):1541---1553

Digital Library

[33]

Yan X, Lu Y (2016) Participants increasing for threshold random grids-based visual secret sharing. J Real-Time Image Proc:1---12

[34]

Yan X, Liu Y, Huang H, Liu L, Wang S (2017) Quality-adaptive threshold visual secret sharing by random grids. IEEE Int Conf Signal Image Process.

[35]

Yang C (2004) New visual secret sharing schemes using probabilistic method. Pattern Recogn Lett 25(4):481---494

Digital Library

[36]

Yang C, Wu C, Wang D (2014) A discussion on the relationship between probabilistic visual cryptography and random grid. Inf Sci 278:141---173

[37]

Yu B, Shen G (2014) Multi-secret visual cryptography with deterministic contrast. Multimed Tools Appl 72(2):1867---1886

Digital Library

Cited By

Pande DRawat ADeshmukh MSingh M(2023)Single Secret Sharing Scheme Using Chinese Remainder Theorem, Modified Shamir’s Scheme and XOR OperationWireless Personal Communications: An International Journal10.1007/s11277-023-10315-5130:2(957-985)Online publication date: 31-Mar-2023
https://dl.acm.org/doi/10.1007/s11277-023-10315-5
Kakkar ASingh M(2023)Performance Analysis of a Lightweight Robust Chaotic Image Re-encryption Scheme for 5G Heterogeneous NetworksWireless Personal Communications: An International Journal10.1007/s11277-023-10248-z129:4(2607-2631)Online publication date: 6-Mar-2023
https://dl.acm.org/doi/10.1007/s11277-023-10248-z
Liu ZZhu GWang YYang JKwong S(2020)A Novel (t, s, k, n)-Threshold Visual Secret Sharing Scheme Based on Access Structure PartitionACM Transactions on Multimedia Computing, Communications, and Applications10.1145/341821216:4(1-21)Online publication date: 17-Dec-2020
https://dl.acm.org/doi/10.1145/3418212
Show More Cited By

Improved schemes for visual secret sharing based on random grids
1. Information systems
  1. Data management systems
    1. Data structures
      1. Data layout
2. Security and privacy

Recommendations

XOR-based meaningful visual secret sharing by generalized random grids
IH&MMSec '13: Proceedings of the first ACM workshop on Information hiding and multimedia security

In recent years, random grid (RG) received much attention for constructing visual secret sharing (VSS) scheme without pixel expansion. But recovered secret image with low visual quality reveals due to the stacking operation. To improve the recovered ...
Distortionless visual multi-secret sharing based on random grid

We proposed an visual multi-secret sharing without secret distortion.We define the shape of share as pie, not traditional doughnut shape.Number of secret sharing is more than two.We adopt RG-based for implementing VMSS to void pixel expansion and ...
Priority visual secret sharing of random grids for threshold access structures

Conventional (k, n)-threshold visual secret sharing of random grids (VSSRG) schemes generate n shares having the same average light transmission from a secret image to be shared, and any information related to the secret image cannot be identified ...

Comments

Information & Contributors

Information

Published In

cover image Multimedia Tools and Applications

Multimedia Tools and Applications Volume 78, Issue 9

May 2019

1514 pages

ISSN:1380-7501

Issue’s Table of Contents

Copyright © Copyright © 2019 Springer Science+Business Media, LLC, part of Springer Nature.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 May 2019

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Pande DRawat ADeshmukh MSingh M(2023)Single Secret Sharing Scheme Using Chinese Remainder Theorem, Modified Shamir’s Scheme and XOR OperationWireless Personal Communications: An International Journal10.1007/s11277-023-10315-5130:2(957-985)Online publication date: 31-Mar-2023
https://dl.acm.org/doi/10.1007/s11277-023-10315-5
Kakkar ASingh M(2023)Performance Analysis of a Lightweight Robust Chaotic Image Re-encryption Scheme for 5G Heterogeneous NetworksWireless Personal Communications: An International Journal10.1007/s11277-023-10248-z129:4(2607-2631)Online publication date: 6-Mar-2023
https://dl.acm.org/doi/10.1007/s11277-023-10248-z
Liu ZZhu GWang YYang JKwong S(2020)A Novel (t, s, k, n)-Threshold Visual Secret Sharing Scheme Based on Access Structure PartitionACM Transactions on Multimedia Computing, Communications, and Applications10.1145/341821216:4(1-21)Online publication date: 17-Dec-2020
https://dl.acm.org/doi/10.1145/3418212
Yu BFu ZLiu S(2019)A Novel Three-Layer QR Code Based on Secret Sharing Scheme and Liner CodeSecurity and Communication Networks10.1155/2019/79378162019Online publication date: 11-Nov-2019
https://dl.acm.org/doi/10.1155/2019/7937816

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents