During the past two decades a lot of attention has been paid to the use of special logics to analyze the cryptographic protocols, foremost among these being the logic of Burrows, Abadi and Needham (the BAN logic). In our project, the idea is hiding a secret message through the text in which the main point is similar to cryptography and difference is imperceptibility of the secret message. We also have same keys with cryptsystems. Could you please give me any example of Ban Logic which is used in text steganography or recommend me any other formal proofs that can be used in steganography?
Hey Milad,
As far as I know there are no formal methods to be applied in order to reveal hidden data. Stenography is a delicate field; neither Ban logic nor other formal methods are suitable to be applied in your case. Besides, I believe the existing formal methods are not really mature and are required to be further improved.
The purpose of steganography is not to reveal the identity of the person whom the message is sent him, so it is required to reduce the number of messages sent and their size.
in my opinion, the BAN logic requires exchange many messages between the sender and the receiver which it may be reveal the identity of the person .
you can use the combination of BAN logic and any one of the text steganography to make a strong system which is unbreakable.use the reverse process to decode it.using BAN logic add more characters or random numbers and then use any one of the text steganography techniques.
When designing a cryptographic protocol or explaining it, one often uses arguments such as “since this message was signed by machine B, machine A can be sure it came from B” in informal proofs justifying how the protocol works. Since it is, in such informal proofs, often easy to overlook an essential assumption, such as a trust relation or the belief that a message is not a replay from a previous session, it seems desirable to write such proofs in a formal system. While such logics do not replace the recent techniques of automatic proofs of safety properties, they help in pointing the weaknesses of the system. In this paper, we present briefly the BAN (Burrows – Abadi – Needham) formal system [9, 10] as well as some derivative. We show how to prove some properties of a simple protocol, as well as detecting undesirable assumptions. We then explain how the manual search for proofs can be made automatic.
source- David Monniaux
- Badges
- Science topic
- Similar topics
- Biological Science
- Anatomy
- Tissue