Author
Listed:
- Chao Jiang
(College of Cryptography Engineering, Engineering University of PAP, Xi’an 710018, China
Key Laboratory of PAP for Cryptology and Information Security, Xi’an 710018, China)
- Minqing Zhang
(College of Cryptography Engineering, Engineering University of PAP, Xi’an 710018, China
Key Laboratory of PAP for Cryptology and Information Security, Xi’an 710018, China)
- Yongjun Kong
(College of Cryptography Engineering, Engineering University of PAP, Xi’an 710018, China
Key Laboratory of PAP for Cryptology and Information Security, Xi’an 710018, China)
- Zongbao Jiang
(College of Cryptography Engineering, Engineering University of PAP, Xi’an 710018, China
Key Laboratory of PAP for Cryptology and Information Security, Xi’an 710018, China)
- Fuqiang Di
(College of Cryptography Engineering, Engineering University of PAP, Xi’an 710018, China
Key Laboratory of PAP for Cryptology and Information Security, Xi’an 710018, China)
Abstract
In the current distributed environment, reversible data hiding in encrypted domain (RDH-ED) cannot grant corresponding privileges according to users’ identity classes. To address this issue, this paper proposes a hierarchical authorization structure embedding scheme based on secret image sharing (SIS) and users’ hierarchical identities. In the first embedding, the polynomial coefficient redundancy generated in the encryption process of the SIS is utilized by the image owner. For the second, the participants are categorized into two parts. One is core users with adaptive difference reservation embedding, and the other is ordinary users with pixel bit replacement embedding. At the time of reconstruction, more than one core user must provide pixel differences, which grants more privileges to core users. The experimental results demonstrate that the average embedding rate (ER) of the test images is 4.3333 bits per pixel (bpp) in the (3, 4) threshold scheme. Additionally, the reconstructed image achieves a PSNR of +∞ and an SSIM of 1. Compared to existing high-performance RDH-ED schemes based on secret sharing, the proposed scheme with a larger ER maintains strong security and reversibility. Moreover, it is also suitable for multiple embeddings involving multilevel participant identities. In conclusion, the results underscore the efficacy of our technique in achieving both security and performance objectives within a complex distributed setting.
Suggested Citation
Chao Jiang & Minqing Zhang & Yongjun Kong & Zongbao Jiang & Fuqiang Di, 2024.
"A Hierarchical Authorization Reversible Data Hiding in Encrypted Image Based on Secret Sharing,"
Mathematics, MDPI, vol. 12(14), pages 1-16, July.
Handle:
RePEc:gam:jmathe:v:12:y:2024:i:14:p:2262-:d:1439020
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:14:p:2262-:d:1439020. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.