Secret Image Sharing Revisited: Forbidden Type, Support Type, and Their Two Approaches
Source abstract
Abstract
In this paper, we introduce two new image-sharing types to extend the applicability of sharing. Type 1 is our so-called forbidden type. In its sharing system, any t of the n shares can recover the secret image, unless the t shares form a forbidden group listed in a forbidden list. Type 2 is our so-called cross-department support type. If a government has 3 departments {DEPH, DEPM, DEPL}, then 3 thresholds (tH, tM and tL) exist. Any tH number of officers from department DEPH can unveil the secret image, and likewise for any tM and tL number of officers from departments DEPM and DEPL, respectively. Type 2 image sharing allows a secret to be disclosed not only in an intra-department meeting but also in a cross-department meeting. In this study, both types are implemented through two approaches: the polynomial and linear-equations approaches. Hackers can be confused when two approaches are mixed. As for the applications, use Type 1 to protect sensitive information in medical or military images or legal documents; and use type 2 to support cross-department crime investigation, industrial production, etc.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Advanced Steganography and Watermarking Techniques · Cryptography and Data Security · Chaos-based Image/Signal Encryption
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Department of Computer Science, National Chiao Tung University, Hsinchu 30050, Taiwan
References (22)
Show source-provided references
1. How to share a secret10.1145/359168.359176 ↗
2. Blakley, G.R. (1979, January 4–7). Safeguarding cryptographic keys. Proceedings of the AFIPS 1979 National Computing Conference, New York, NY, USA.10.1109/MARK.1979.8817296 ↗
3. Visual cryptography
4. Secret image sharing10.1016/S0097-8493(02)00131-0 ↗
5. Scalable secret image sharing10.1016/j.image.2006.12.012 ↗
6. Secret image sharing with smaller shadow images10.1016/j.patrec.2005.09.021 ↗
7. Friendly progressive visual secret sharing10.1016/j.patcog.2007.09.004 ↗
8. Fang, W.P. (2007, January 24–26). Multi-layer progressive secret image sharing. Proceedings of the 7th WSEAS International Conference on Signal Processing, Computation, Geometry & Artificial Vision, Athens, Greece.
9. Secret image sharing based on cellular automata and steganography10.1016/j.patcog.2009.06.007 ↗
10. Progressive sharing of multiple images with sensitivity-controlled decoding10.1186/s13634-015-0196-z ↗
11. Medical image security and EPR hiding using Shamir’s secret sharing scheme10.1016/j.jss.2010.11.928 ↗
12. Secret sharing approaches for 3D object encryption
13. 264 video watermarking with secret image sharing10.1049/iet-ipr.2009.0362 ↗
14. Essential secret image sharing with increasable shadows10.1117/1.OE.55.1.013103 ↗
15. An efficient (t,n)–threshold secret image sharing scheme10.1007/s11042-016-3917-x ↗
16. Protection of data in unsecured public cloud environment with open, vulnerable networks using threshold-based secret sharing10.5296/npa.v6i1.4862 ↗
17. Reversible secret image sharing scheme using histogram shifting and difference expansion10.9717/kmms.2014.17.7.849 ↗
18. Secret image sharing scheme with adaptive authentication strength10.1016/j.patrec.2012.10.017 ↗
19. Fault-tolerant and progressive transmission of images10.1016/j.patcog.2005.04.002 ↗
20. Gerald, C.F., and Wheatley, P.O. (1999). Applied Numerical Analysis, Addison-Wesley. [6th ed.].
21. Miscellaneous notes (Colin Maclaurin and Cramer’s rule)
22. Kreyszig, E. (2015). Advanced Engineering Mathematics, Wiley. [10th ed.].