Progressive Secret Sharing with Adaptive Priority and Perfect Reconstruction
Abstract
:1. Introduction
- Identity:
- Performing XOR over “odd number” times:
- Performing XOR over “even number” times:
- Symmetric Inverse:
- Commutative:
- Associative:
2. Former PVSS Scheme
2.1. PVSS Scheme for Binary Image
Algorithm 1: Former Scheme [15]. |
Input: Secret image in binary format, , of size |
Number of shared images, |
Output: A set of generated shared images, , each of size |
Step 1: Based on priority weight , determine the location set , for . |
Step 2: For Each Pixel . Based on information , select two shared images and . Do |
Step 3: |
Step 4:If, then |
Step 5: Else |
Step 6: For Each other shared images, , with condition and Do |
Step 7: |
Step 8: Obtain generated shared images, |
2.2. Limitation of PVSS Scheme
3. Proposed PVSS Method
3.1. Proposed Bitwise-Based PVSS Method
Algorithm 2: Proposed Bitwise-Based PVSS Method. |
Input: Secret image in binary format, , of size |
Number of shared images, |
Output: A set of generated shared images, , each of size |
Step 1: Based on priority weight , determine the location set , for . |
Step 2: For Each Pixel . Based on information of , select two shared images and . Do |
Step 3: |
Step 4: If , Then |
Step 5: Else |
Step 6: For Each Generated shared images, , with the condition and Do |
Step 7: |
Step 8: Obtain generated shared images, |
3.2. Proposed XOR-ed Based PVSS Method
Algorithm 3: Proposed XOR-ed Based PVSS Method. |
Input: A grayscale or color image as secret, , of size |
Number of shared images, |
Output: Full set of generated shared images, , each of size |
Step 1: Based on priority weight , determine the location set , for . |
Step 2: For Each Pixel Position . Based on the information in , decide the selected shared images and . Do |
Step 3: |
Step 4: |
Step 5: |
Step 6: For Each other generated shared images, , under the condition and Do |
Step 7: |
Step 8: Obtain the generated shared images, |
4. Experimental Results
4.1. Performance Evaluation
4.2. Visual Evaluation on Binary Image
4.3. Visual Investigation on Grayscale Image
4.4. Visual Assessment of Color Image
4.5. Performance Comparisons in Terms of Objective Image Quality Assessment
4.6. Comparison of Algorithm Aspects for the Proposed Method and Other Schemes
5. Conclusions
Author Contributions
Funding
Institutional Review Board Statement
Informed Consent Statement
Data Availability Statement
Conflicts of Interest
References
- Zarepour-Ahmadabadi, J.; Shiri-Ahmadabadi, M.; Latif, A. A cellular automata-based multi-stage secret image sharing scheme. Multimed. Tools Appl. 2018, 77, 24073–24096. [Google Scholar] [CrossRef]
- Bharti, S.S.; Gupta, M.; Agarwal, S. A novel approach for verifiable (n, n) audio secret sharing scheme. Multimed. Tools Appl. 2018, 77, 25629–25657. [Google Scholar] [CrossRef]
- Liu, Y.-N.; Zhong, Q.; Xie, M.; Chen, Z.-B. A novel multiple-level secret image sharing scheme. Multimed. Tools Appl. 2017, 77, 6017–6031. [Google Scholar] [CrossRef]
- Guo, J.-M.; Riyono, D.; Prasetyo, H. Hyperchaos permutation on false-positive-free SVD-based image watermarking. Multimed. Tools Appl. 2019, 78, 29229–29270. [Google Scholar] [CrossRef]
- Prasetyo, H.; Hsia, C.-H. Improved multiple secret sharing using generalized chaotic image scrambling. Multimed. Tools Appl. 2019, 78, 29089–29120. [Google Scholar] [CrossRef]
- Guo, J.M.; Riyono, D.; Prasetyo, H. Improved Beta Chaotic Image Encryption for Multiple Secret Sharing. IEEE Access 2018, 6, 46297–46321. [Google Scholar] [CrossRef]
- Prasetyo, H.; Guo, J.-M. A Note on Multiple Secret Sharing Using Chinese Remainder Theorem and Exclusive-OR. IEEE Access 2019, 7, 37473–37497. [Google Scholar] [CrossRef]
- Yan, X.; Lu, Y. Contrast-improved visual secret sharing based on random grid for general access structure. Digit. Signal Process. 2017, 71, 36–45. [Google Scholar] [CrossRef]
- Fang, W.-P.; Lin, J.-C. Progressive viewing and sharing of sensitive images. Pattern Recognit. Image Anal. 2006, 16, 632–636. [Google Scholar] [CrossRef]
- Wang, R.-Z. Region Incrementing Visual Cryptography. IEEE Signal Process. Lett. 2009, 16, 659–662. [Google Scholar] [CrossRef]
- Hou, Y.-C.; Quan, Z.-Y. Progressive Visual Cryptography with Unexpanded Shares. IEEE Trans. Circuits Syst. Video Technol. 2011, 21, 1760–1764. [Google Scholar] [CrossRef]
- Hou, Y.-C.; Quan, Z.-Y.; Tsai, C.-F. A privilege-based visual secret sharing model. J. Vis. Commun. Image Represent. 2015, 33, 358–367. [Google Scholar] [CrossRef]
- Lin, C.-H.; Lee, Y.-S.; Chen, T.-H. Friendly progressive random-grid-based visual secret sharing with adaptive contrast. J. Vis. Commun. Image Represent. 2015, 33, 31–41. [Google Scholar] [CrossRef]
- Yang, C.-N.; Liao, J.-K.; Wang, D.-S. New privilege-based visual cryptography with arbitrary privilege levels. J. Vis. Commun. Image Represent. 2017, 42, 121–131. [Google Scholar] [CrossRef]
- Chao, H.-C.; Fan, T.-Y. Random-grid based progressive visual secret sharing scheme with adaptive priority. Digit. Signal Process. 2017, 68, 69–80. [Google Scholar] [CrossRef]
- Prasetyo, H.; Hsia, C.-H. Lossless progressive secret sharing for grayscale and color images. Multimed. Tools Appl. 2019, 78, 24837–24862. [Google Scholar] [CrossRef]
Method | Share Style | Encoding Matrix | Pixel Expansion | Adaptive Priority | Quality |
---|---|---|---|---|---|
Fang’s Scheme [9] | Noise-Like Form | Require | Need | No | Lossless for is even |
Wang’s Scheme [10] | Noise-Like Form | Require | Need | No | - |
Hou’s Scheme [11] | Noise-Like Form | Require | No | No | - |
Hou’s Scheme [12] | Noise-Like Form | Require | No | Adaptive Priority | Lossy |
Lin’s Scheme [13] | Friendly Appearance | No | No | No | Lossy |
Yang’s Scheme [14] | Noise-Like Form | Require | No | Adaptive Priority | Lossy |
Former Scheme [15] | Noise-Like Form | No | No | Adaptive Priority | Lossy, if is oddLossless, if is even |
Prasetyo’s Scheme [16] | Noise-Like Form | No | No | No | Lossless for is odd or even |
Proposed Method | Noise-Like Form | No | No | Adaptive Priority | Lossless for is odd or even |
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Prasetyo, H.; Hsia, C.-H.; Wicaksono Hari Prayuda, A. Progressive Secret Sharing with Adaptive Priority and Perfect Reconstruction. J. Imaging 2021, 7, 70. https://doi.org/10.3390/jimaging7040070
Prasetyo H, Hsia C-H, Wicaksono Hari Prayuda A. Progressive Secret Sharing with Adaptive Priority and Perfect Reconstruction. Journal of Imaging. 2021; 7(4):70. https://doi.org/10.3390/jimaging7040070
Chicago/Turabian StylePrasetyo, Heri, Chih-Hsien Hsia, and Alim Wicaksono Hari Prayuda. 2021. "Progressive Secret Sharing with Adaptive Priority and Perfect Reconstruction" Journal of Imaging 7, no. 4: 70. https://doi.org/10.3390/jimaging7040070
APA StylePrasetyo, H., Hsia, C. -H., & Wicaksono Hari Prayuda, A. (2021). Progressive Secret Sharing with Adaptive Priority and Perfect Reconstruction. Journal of Imaging, 7(4), 70. https://doi.org/10.3390/jimaging7040070