Protecting Relational Database Using Audio Steganography and Clustering

View at publisher Summarise with VIRAT
Authors: Eshraq Sami Younis, Yaseen Hikmat Ismaiel
Cited by: 0
References: 35

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

The relational databases are widely used in most of the organizations and companies that include their financial information such as payments, activities and salaries. Some of the information have high level of confidentiality and have to be secured either when they are stored or shared with authorized clients. Audio Stegan-ography can be used to hide secret data because the higher number of frames in audio files and more length provides more payload capacity. LSB algorithm is used embed bit of secret data into the frames of audio file according to mapping function. In this paper, we proposed a method to conceal a big database into audio file using K-mean algorithm as a mapping function for LSB algorithm. The proposed method is applied to Salary list which includes 64003 records and 39 columns of different data type. The database analyzed to deal with its numeric columns. The data is transformed to bits and embedded into largest cluster of the 44 MB audio file based on K-means clustering algorithm. On channel of the audio is used to avoid changes at the same moment of the audio. Different scenarios are executed to show the performance of the method with different data size according to the evaluation metrices. The result showed high efficiency with expandable payload according to the audio length.

Fields of Study & Subjects

Advanced Steganography and Watermarking Techniques Computer Science and Engineering Cryptography and Data Security

Publication details

Journal / source
International Conference on Smart City and Information System (ICSCIS)
Pages
1–6
Publication date
30 January 2026
Language
EN