Robust privacy preservation and authenticity of the collected data in cognitive radio network鈥擶alsh-Hadamard based steganographic approach

详细信息    查看全文

• 作者：Alsharif Abuadbba^a ; ^{alsharif.abuadbba@rmit.edu.au" class="auth_mail" title="E-mail the corresponding author} ; Ibrahim Khalil^a ; ^{ibrahim.khalil@rmit.edu.au" class="auth_mail" title="E-mail the corresponding author} ; Mohammed Atiquzzaman^b ; ^{atiq@ou.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Steganography ; Walsh&ndash ; Hadamard ; Security ; Privacy preservation ; Cognitive radio
• 刊名：Pervasive and Mobile Computing
• 出版年：2015
• 出版时间：September 2015
• 年：2015
• 卷：22
• 期：Complete
• 页码：58-70
• 全文大小：1367 K

文摘

Cognitive Radio Networks have recently attracted attention because of high efficiency and throughput performance. They transmit (1) repetitively collected readings (e.g. monitoring) and (2) highly confidential data (e.g. geometric location). However, the privacy and the authenticity of the transmitted data are major challenges. This paper proposes a novel steganographic technique that guarantees (1) strong end-to-end protection of the confidential information by hiding them randomly inside the normal readings using a generated key, and (2) robust evidence of authenticity for the transported readings. To expand hiding, the Walsh–Hadamard Transformation (WHT) is used to decompose normal readings into a set of coefficients. To achieve minimum distortion, only the least featured coefficients are used. To achieve high security, a key is used to reshape the coefficients into a random 2D M$M$-by-N$N$ matrix and to generate a randomly selected order used in the hiding process. To accurately measure the distortion after hiding and extracting the confidential data, Percentage Residual Difference (PRD) has been used. It is obvious from experiments that our technique has little effect on the original readings (<1%$<1\%$). Also, our security evaluation proves that unauthorized retrieval of the intended confidential information within a reasonable time is highly improbable.