Results 1  10
of
1,561
Informationtheoretic analysis of information hiding
 IEEE Transactions on Information Theory
, 2003
"... Abstract—An informationtheoretic analysis of information hiding is presented in this paper, forming the theoretical basis for design of informationhiding systems. Information hiding is an emerging research area which encompasses applications such as copyright protection for digital media, watermar ..."
Abstract

Cited by 269 (19 self)
 Add to MetaCart
, an attacker may seek to destroy this hidden information, and for this purpose, introduce additional distortion to the data set. Side information (in the form of cryptographic keys and/or information about the host signal) may be available to the information hider and to the decoder. We formalize these notions
Pretense and representation: The origins of a theory of mind
 Psychol. Rev
, 1987
"... One of the major developments of the second year of human life is the emergence of the ability to pretend. A child's knowledge of a real situation is apparently contradicted and distorted by pretense. If, as generally assumed, the child is just beginning to construct a system for internally rep ..."
Abstract

Cited by 384 (14 self)
 Add to MetaCart
One of the major developments of the second year of human life is the emergence of the ability to pretend. A child's knowledge of a real situation is apparently contradicted and distorted by pretense. If, as generally assumed, the child is just beginning to construct a system for internally representing such knowledge, why is this system of representation not undermined by its use in both comprehend ing and producing pretense? In this article I present a theoretical analysis of the representational mechanism underlying this ability. This mechanism extends the power of the infant's existing capacity for (primary) representation, creating a capacity for metarepresentation. It is this, developing toward the end of infancy, that underlies the child's new abilities to pretend and to understand pretense in others. There is a striking isomorphism between the three fundamental forms of pretend play and three crucial logical properties of mental stale expressions in language. This isomorphism points to a common underlying form of internal representation that is here called metarepresentation. A performance model, the decoupler, is outlined embodying ideas about how an infant might compute the complex function postulated to underlie pretend play. This model also reveals pretense as an early manifestation of the ability to understand mental states. Aspects of later preschool development, both normal and abnormal, are discussed in the light of the new model. This
ON INFORMATION HIDING WITH INCOMPLETE INFORMATION ABOUT STEGANALYSIS
"... Suppose the information hider has a set of information hiding schemes to be employed in the presence of a set of steganalysis detectors. Let the information hider have only an incomplete information about the steganalysis detectors. That is, suppose the probability of the jth steganalysis detector w ..."
Abstract
 Add to MetaCart
Suppose the information hider has a set of information hiding schemes to be employed in the presence of a set of steganalysis detectors. Let the information hider have only an incomplete information about the steganalysis detectors. That is, suppose the probability of the jth steganalysis detector
On Information Hiding with Incomplete Information about Steganalysis
"... Suppose the information hider has a set of information hiding schemes to be employed in the presence of a set of steganalysis detectors. Let the information hider have only an incomplete information about the steganalysis detectors. That is, suppose the probability of the jth steganalysis detector w ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Suppose the information hider has a set of information hiding schemes to be employed in the presence of a set of steganalysis detectors. Let the information hider have only an incomplete information about the steganalysis detectors. That is, suppose the probability of the jth steganalysis detector
MultiStep MultiSensor HiderSeeker Games
"... We study a multistep hiderseeker game where the hider is moving on a graph and, in each step, the seeker is able to search c subsets of the graph nodes. We model this game as a zerosum Bayesian game, which can be solved in weakly polynomial time in the players ’ action spaces. The seeker’s action ..."
Abstract

Cited by 40 (7 self)
 Add to MetaCart
We study a multistep hiderseeker game where the hider is moving on a graph and, in each step, the seeker is able to search c subsets of the graph nodes. We model this game as a zerosum Bayesian game, which can be solved in weakly polynomial time in the players ’ action spaces. The seeker’s
Complexity of searching an immobile hider in a graph
 DISCRETE APPLIED MATHEMATICS
, 1997
"... ..."
InformationTheoretic Analysis Of Watermarking
 in Proc. Int. Conf. on Accoustic, Speech and Signal Processing
, 2000
"... An informationtheoretic analysis of watermarking is presented in this paper. We formulate watermarking as a communication problem with side information at the encoder and decoder and determine the hiding capacity, which upperbounds the rates of reliable transmission and quantifies the fundamental ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
tradeoff between three quantities: the achievable watermarking rates and the allowed distortion levels for the information hider and the attacker. The hiding capacity is the value of a game between the information hider and the attacker. The optimal attack strategy is the solution of a particular rate
On the Capacity Game of Public Watermarking Systems
 IEEE Trans. on Information Theory
, 2002
"... Watermarking codes are analyzed as a game between two players: an information hider, and a decoder, on the one hand, and an attacker on the other hand. The information hider is allowed to cause some tolerable level of distortion to the original data within which the message is hidden, and the result ..."
Abstract

Cited by 30 (4 self)
 Add to MetaCart
Watermarking codes are analyzed as a game between two players: an information hider, and a decoder, on the one hand, and an attacker on the other hand. The information hider is allowed to cause some tolerable level of distortion to the original data within which the message is hidden
A Sufficient Condition for Private Information Hiding of Two Correlated Sources Under Multiple Access Attacks ∗
"... Abstract — Consider a multiuser private informationhiding scenario in which two information hiders separately embed correlated sources (S1, S2) into a common host source U (covertext). The ith information hider embeds the secret source Si into the covertext U subject to a distortion constraint Di ..."
Abstract
 Add to MetaCart
Abstract — Consider a multiuser private informationhiding scenario in which two information hiders separately embed correlated sources (S1, S2) into a common host source U (covertext). The ith information hider embeds the secret source Si into the covertext U subject to a distortion constraint
On Random Coding Error Exponents of Watermarking Codes
 IEEE Trans. Info Thy
, 2000
"... steganography, watermarking, information hiding, error exponent, random coding Watermarking codes are analyzed from an informationtheoretic viewpoint as a game between an information hider and an active attacker. While the information hider embeds a secret message (watermark) in a covertext message ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
steganography, watermarking, information hiding, error exponent, random coding Watermarking codes are analyzed from an informationtheoretic viewpoint as a game between an information hider and an active attacker. While the information hider embeds a secret message (watermark) in a covertext message
Results 1  10
of
1,561