Abstract

Abstract For good security and large payload in information hiding, matrix embedding is a popular method for increasing the embedding efficiency. This paper analyzes the security of matrix embedding against cryptanalytic attacks. The secrecy security of matrix embedding using information theory under the conditions of known-cover attack and chosen-stego attack is studied. After that, the unicity distance of the key, message equivocation and the relationship among wet ratio, embedding rate and key equivocation for the wet paper channel are given through analyzing the key model under the known-cover attack condition. Furthermore, an effective differential attack to matrix embedding under chosen-stego attack condition is proposed. The results of analysis show that the matrix embedding is not secure enough with respect to cryptographic secrecy against the stronger adversaries.

Highlights

  • The Internet of things (Iot) is a large network which integrates the current devices including Radio Frequency Identification (RFID) devices, sensors and other equipments and services etc

  • Based on the results in [15], we further study the secrecy security of matrix embedding using information theory under the condition of known-cover attack and chosen-stego attack

  • The contributions of this paper lie in the following three aspects: (i) To the best of our known, this paper firstly studies the secrecy security of matrix embedding under the condition of known-cover attack which has become a real-world steganalysis under some special attacking conditions. (ii) For wet paper channel, this paper shows the relationship among wet ratio, embedding rate, and key equivocation for the wet paper channel under the known-cover attack condition

Read more

Summary

Introduction

The Internet of things (Iot) is a large network which integrates the current devices including Radio Frequency Identification (RFID) devices, sensors and other equipments and services etc. Many matrix embedding methods based on structured covering codes [10,11] or random linear codes [12,13] have been reported to increase the embedding efficiency and enhance the concealment security of steganography. Phillip firstly studied the secrecy security of matrix embedding under the condition of stego-only attack in [15]. It is easy for the attacker to detect the existence of the steganography, but it is still hard to recover the stego key and extract the hidden message. The secrecy security of matrix embedding under the stronger attack condition, such as known-cover should be considered by both steganographers and attackers. Based on the results in [15], we further study the secrecy security of matrix embedding using information theory under the condition of known-cover attack and chosen-stego attack.

Symbols
Matrix embedding
Wet paper codes
Secrecy security analysis
Key equivocation
Unicity distance
Message equivocation
Differential attack
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call