Integrating Coordinate Transformation and Random Sampling Into High-Capacity Reversible Data Hiding in Encrypted Polygonal Models
Reversible data hiding in encrypted media involves using algorithms to perform data encryption to improve the privacy of the original media and hide data for covert communication or access control. This study explores the feasibility of applying coordinate transformation and random sampling to enhan...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on dependable and secure computing 2023-07, Vol.20 (4), p.3508-3519 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Reversible data hiding in encrypted media involves using algorithms to perform data encryption to improve the privacy of the original media and hide data for covert communication or access control. This study explores the feasibility of applying coordinate transformation and random sampling to enhance the embedding rate and total embedding capacity of separable reversible data hiding in encrypted polygonal models based on multiple most significant bit (multi-MSB) prediction and Huffman coding. We first transform each vertex coordinate value of the input model into a decimal value between 0 and 1 and then convert the value into numerous binary digits with a user-defined compression threshold. Thereafter, the random sampling concept is used to generate embeddable vertices with only partial neighboring vertices as a reference. Thus, the embedding rate and total embedding capacity can both be increased considerably. The multi-MSB prediction technique is adopted to obtain the embedding capacity of each embeddable vertex, each vertex coordinate value in the proposed study can have a respective embedding length. Finally, the auxiliary information compressed through Huffman coding and an encrypted secret message are embedded in the multi-MSB of each embeddable vertex coordinate value through bit substitution. The experimental results of this study indicate the feasibility of the proposed algorithm. |
---|---|
ISSN: | 1545-5971 1941-0018 |
DOI: | 10.1109/TDSC.2022.3204291 |