中文
相关论文

相关论文: Upper and Lower Bounds on Black-Box Steganography

200 篇论文

In this paper, first, we investigate the model of degraded broadcast channel with side information and confidential messages. This work is from Steinberg's work on the degraded broadcast channel with causal and noncausal side information,…

信息论 · 计算机科学 2016-11-17 Bin Dai , A. J. Han Vinck , Zhuojun Zhuang , Yuan Luo

The paper presents Multi-Level Steganography (MLS), which defines a new concept for hidden communication in telecommunication networks. In MLS, at least two steganographic methods are utilised simultaneously, in such a way that one method…

密码学与安全 · 计算机科学 2013-12-06 Wojciech Fraczek , Wojciech Mazurczyk , Krzysztof Szczypiorski

The security of private communication is increasingly at risk due to widespread surveillance. Steganography, a technique for embedding secret messages within innocuous carriers, enables covert communication over monitored channels. Provably…

密码学与安全 · 计算机科学 2026-02-16 Kaiyi Pang , Minhao Bai

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO…

信息论 · 计算机科学 2009-05-01 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

Steganography is the task of concealing a message within a medium such that the presence of the hidden message cannot be detected. Though the prospect of steganography is conceivably interesting in many contexts, and though work has been…

密码学与安全 · 计算机科学 2017-07-04 Aubrey Alston

LSB steganography is a one of the most widely used methods for implementing covert data channels in image file exchanges [1][2]. The low computational complexity and implementation simplicity of the algorithm are significant factors for its…

多媒体 · 计算机科学 2016-06-09 James Collins , Sos Agaian

While the channel capacity reflects a theoretical upper bound on the achievable information transmission rate in the limit of infinitely many bits, it does not characterise the information transfer of a given encoding routine with finitely…

神经元与认知 · 定量生物学 2017-04-05 Sebastian Weichwald , Tatiana Fomina , Bernhard Schölkopf , Moritz Grosse-Wentrup

A state-dependent discrete memoryless multiple access channel is considered to model an integrated sensing and communication system, where two transmitters wish to convey messages to a receiver while simultaneously estimating the state…

信息论 · 计算机科学 2025-06-19 Yao Liu , Min Li , An Liu , Lawrence Ong , Aylin Yener

This paper considers the problem of stabilizing a discrete-time non-linear stochastic system over a finite capacity noiseless channel. Our focus is on systems which decompose into a stable and unstable component, and the stability notion…

最优化与控制 · 数学 2021-09-07 Nicolás Garcia , Christoph Kawan , Serdar Yüksel

Image steganography plays a vital role in securing secret data by embedding it in the cover images. Usually, these images are communicated in a compressed format. Existing techniques achieve this but have low embedding capacity. Enhancing…

多媒体 · 计算机科学 2021-01-05 Rohit Agrawal , Kapil Ahuja

Data security is of the utmost concern of a communication system. Since the early days, many developments have been made to improve the performance of the system. PSNR of the received signal, secure transmission channel, quality of encoding…

This paper studies the problem of secure communication over the broadcast channel with receiver side information under the lens of individual secrecy constraints. That is, the transmitter wants to send two independent messages to two…

信息论 · 计算机科学 2015-02-26 Yanling Chen , O. Ozan Koyluoglu , Aydin Sezgin

Biological sensory receptors provide excellent examples of microscopic scale information transduction amidst stochastic noise. We argue that stochasticity is not always a hindrance to sensing. Instead, it could allow a single stochastic…

统计力学 · 物理学 2023-04-24 Asawari Pagare , Sa Hoon Min , Zhiyue Lu

We consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, "covert" means that a warden on the channel should observe similar…

信息论 · 计算机科学 2017-08-09 Si-Hyeon Lee , Ligong Wang , Ashish Khisti , Gregory W. Wornell

We propose the construction of an unobservable communications network using social networks. The communication endpoints are vertices on a social network. Probabilistically unobservable communication channels are built by leveraging image…

密码学与安全 · 计算机科学 2015-03-19 Shishir Nagaraja , Amir Houmansadr , Pratch Piyawongwisal , Vijit Singh , Pragya Agarwal , Nikita Borisov

In this paper, we propose a transmission scheme that achieves information theoretic security, without making assumptions on the eavesdropper's channel. This is achieved by a transmitter that deliberately introduces synchronization errors…

信息论 · 计算机科学 2015-01-27 Jason Castiglione , Aleksandar Kavcic

We investigate the problem of information theoretically secure communication in a line network with erasure channels and state feedback. We consider a spectrum of cases for the private randomness that intermediate nodes can generate,…

信息论 · 计算机科学 2014-07-09 Athanasios Papadopoulos , Laszlo Czap , Christina Fragouli

Digital steganography or data hiding has emerged as a new area of research in connection to the communication in secured channel as well as intellectual property protection for multimedia signals. The redundancy in image representation can…

密码学与安全 · 计算机科学 2012-07-12 Tirtha sankar Das , Ayan K. Sau , V. H. Mankar , Subir K. Sarkar

In this paper, a novel data-driven information hiding scheme called generative steganography by sampling (GSS) is proposed. Unlike in traditional modification-based steganography, in our method the stego image is directly sampled by a…

多媒体 · 计算机科学 2019-07-23 Zhuo Zhang , Jia Liu , Yan Ke , Yu Lei , Jun Li , Minqing Zhang , Xiaoyuan Yang

An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared error for a strategy that consists of repeatedly quantizing the…

信息论 · 计算机科学 2016-11-17 Marius Kleiner , Bixio Rimoldi