A Key-Value pair Schema based Message Digest-5 Hash Algorithm for the Dynamic Data Masking

• Published in: 2024 International Conference on Data Science and Network Security (ICDSNS) pp. 1 - 7
• Main Authors: Tumkur Shankare Gowda, Bharath, Krishna Raju, Channa
• Format: Conference Proceeding
• Language: English
• Published: IEEE 26-07-2024
• Subjects: Data Embedding; Data Retrieval; Dynamic data masking; Encryption; Hash functions; Heuristic algorithms; Key-Value pair schema; Malware; Measurement; Message Digest-5; Network security; Particle swarm optimization; PSNR; Relational databases; Steganography
• DOI: 10.1109/ICDSNS62112.2024.10691251

Dynamic data masking (DDM) is an efficient data security system for protecting personal, as well as other data from attackers or third parties. Reversible Data Hiding (RDH) is a scheme that hides secret data in a cover image through steganography images. However, when hiding a large amount of data in an embedding process, the data can be lost, leading to security problems. Hence, this research proposes the Key-Value pair schema-based Message Digest-5 (MD5) algorithm for dynamic data masking. The MD5 algorithm produces fixed size message digest of 128-bit and makes the process irreversible, thereby enhancing the security level over unauthorized users. Data masking is introduced on selected database areas to hide sensitive data in the group of query outcomes. The proposed Key-Value pair schema-based MD5 approach embeds one or multiple secret attributes about various hiding attributes in a similar relational database. The proposed method is validated using various performance metrics like Peak Signal-to-Noise Ratio (PSNR) of 8.383dB and Embedding Rate of 0.0065, as opposed to the existing methods, Quantum Particle Swarm Optimization (QPSO) and Multi-direction Pixel Swapping Approach (MPSA).