Elements of information theory
Elements of information theory
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
On identification secret sharing schemes
Information and Computation
A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)
A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)
General theory of information transfer: Updated
Discrete Applied Mathematics
The common randomness capacity of a pair of independent discrete memoryless channels
IEEE Transactions on Information Theory
Common randomness in information theory and cryptography. II. CR capacity
IEEE Transactions on Information Theory
Information and control: matching channels
IEEE Transactions on Information Theory
New converses in the theory of identification via channels
IEEE Transactions on Information Theory
Common randomness and secret key generation with a helper
IEEE Transactions on Information Theory
The common randomness capacity of a network of discrete memoryless channels
IEEE Transactions on Information Theory
On random coding error exponents of watermarking systems
IEEE Transactions on Information Theory
On identification capacity of infinite alphabets or continuous-time channels
IEEE Transactions on Information Theory
Identification in the presence of side information with application to watermarking
IEEE Transactions on Information Theory
Information-theoretic analysis of information hiding
IEEE Transactions on Information Theory
New directions in the theory of identification via channels
IEEE Transactions on Information Theory
Bibliography of publications by Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
Watermarking identification codes were introduced by Y. Steinberg and N. Merhav. In their model they assumed that (1) the attacker uses a single channel to attack the watermark and both,the information hider and the decoder, know the attack channel; (2) the decoder either completely he knows the covertext or knows nothing about it. Then instead of the first assumption they suggested to study more robust models and instead of the second assumption they suggested to consider the case where the information hider is allowed to send a secret key to the decoder according to the covertext. In response to the first suggestion in this paper we assume that the attacker chooses an unknown (for both information hider and decoder) channel from a set of channels or a compound channel, to attack the watermark. In response to the second suggestion we present two models. In the first model according to the output sequence of covertext the information hider generates side information componentwise as the secret key. In the second model the only constraint to the key space is an upper bound for its rate. We present lower bounds for the identification capacities in the above models, which include the Steinberg and Merhav results on lower bounds. To obtain our lower bounds we introduce the corresponding models of common randomness. For the models with a single channel, we obtain the capacities of common randomness. For the models with a compound channel, we have lower and upper bounds and the differences of lower and upper bounds are due to the exchange and different orders of the max–min operations.