Supplemental Material for Reading Through a Noisy Channel: Why There's Nothing Special About the Perception of Orthography

2012 ◽  
Keyword(s):  
2020 ◽  
Vol 2020 (4) ◽  
pp. 76-1-76-7
Author(s):  
Swaroop Shankar Prasad ◽  
Ofer Hadar ◽  
Ilia Polian

Image steganography can have legitimate uses, for example, augmenting an image with a watermark for copyright reasons, but can also be utilized for malicious purposes. We investigate the detection of malicious steganography using neural networkbased classification when images are transmitted through a noisy channel. Noise makes detection harder because the classifier must not only detect perturbations in the image but also decide whether they are due to the malicious steganographic modifications or due to natural noise. Our results show that reliable detection is possible even for state-of-the-art steganographic algorithms that insert stego bits not affecting an image’s visual quality. The detection accuracy is high (above 85%) if the payload, or the amount of the steganographic content in an image, exceeds a certain threshold. At the same time, noise critically affects the steganographic information being transmitted, both through desynchronization (destruction of information which bits of the image contain steganographic information) and by flipping these bits themselves. This will force the adversary to use a redundant encoding with a substantial number of error-correction bits for reliable transmission, making detection feasible even for small payloads.


Author(s):  
Amir Hossein Estiri ◽  
Mohammad Reza Sabramooz ◽  
Ali Banaei ◽  
Amir Hossein Dehghan ◽  
Benyamin Jamialahmadi ◽  
...  

Entropy ◽  
2020 ◽  
Vol 23 (1) ◽  
pp. 17
Author(s):  
Assaf Ben-Yishai ◽  
Young-Han Kim ◽  
Rotem Oshman ◽  
Ofer Shayevitz

The interactive capacity of a noisy channel is the highest possible rate at which arbitrary interactive protocols can be simulated reliably over the channel. Determining the interactive capacity is notoriously difficult, and the best known lower bounds are far below the associated Shannon capacity, which serves as a trivial (and also generally the best known) upper bound. This paper considers the more restricted setup of simulating finite-state protocols. It is shown that all two-state protocols, as well as rich families of arbitrary finite-state protocols, can be simulated at the Shannon capacity, establishing the interactive capacity for those families of protocols.


2005 ◽  
Vol 9 (5) ◽  
pp. 417-419 ◽  
Author(s):  
Yunfei Chen ◽  
N.C. Beaulieu ◽  
C. Tellambura

2014 ◽  
Vol 25 (05) ◽  
pp. 563-584 ◽  
Author(s):  
PARTHA SARATHI MANDAL ◽  
ANIL K. GHOSH

Location verification in wireless sensor networks (WSNs) is quite challenging in the presence of malicious sensor nodes, which are called attackers. These attackers try to break the verification protocol by reporting their incorrect locations during the verification stage. In the literature of WSNs, most of the existing methods of location verification use a set of trusted verifiers, which are vulnerable to attacks by malicious nodes. These existing methods also use some distance estimation techniques, which are not accurate in noisy channels. In this article, we adopt a statistical approach for secure location verification to overcome these limitations. Our proposed method does not rely on any trusted entities and it takes care of the limited precision in distance estimation by using a suitable probability model for the noise. The resulting verification scheme detects and filters out all malicious nodes from the network with a very high probability even when it is in a noisy channel.


Sign in / Sign up

Export Citation Format

Share Document