The main goal of this tutorial is to review the theory and design the worst case additive attack (WCAA) for ∣M∣-ary quantization-based data-hiding methods using as performance criteria the error probability and the maximum achievable rate of reliable communications. Our analysis focuses

The main goal of this tutorial is to review the theory and design the worst case additive attack (WCAA) for |M|-ary quantizationbased data-hiding methods using as performance criteria the error probability and the maximum achievable rate of reliable communications. Our analysis focuses

Structured codes are known to be necessary in practical implementations of capacity-approaching “dirty paper schemes”. In this paper we study the performance of a recently proposed dirty paper technique, by Erez and ten Brink which, to the authors ’ knowledge, is firstly applied to data-hiding

focus is on the mathematical models, fundamental principles, and code design techniques that are applicable to data hiding. The approach draws from basic concepts in information theory, coding theory, game theory, and signal processing, and is illustrated with applications to the problem of hiding data

In this paper we analyze security of robust data-hiding in channels with geometrical transformations. We categorize possible decoding strategies for channels with geometrical transformations within the information-theoretic framework for geometrically-robust datahiding. Furthermore, considering

In data-hiding the issue of the achievable rate maximization is closely related to the problem of host interference cancellation. The optimal host interference cancellation relies on the knowledge of the host realization and the channel statistics (the additive white Gaussian noise (AWGN) variance

An information-theoretic model for image watermarking and data hiding is proposed in this paper. Recent theoretical results are used to characterize the fundamental capacity limits of image watermarking and data-hiding systems. Capacity is determined by the statistical model used for the host

Abstract. We analyze three different data hiding methods from a gametheoretic point of view, using the probability of bit error as the payoff. Those data hiding schemes can be regarded to as representatives of three families of methods: spread-spectrum, informed-embedding and hybrid. In all cases

This paper describes a technique for tracing anonymous packet flooding attacks in the Internet back towards their source. This work is motivated by the increased frequency and sophistication of denial-of-service attacks and by the difficulty in tracing packets with incorrect, or “spoofed”, source addresses. In this paper we describe a general purpose traceback mechanism based on probabilistic packet marking in the network. Our approach allows a victim to identify the network path(s) traversed by attack traffic without requiring interactive operational support from Internet Service Providers (ISPs). Moreover, this traceback can be performed “post-mortem ” – after an attack has completed. We present an implementation of this technology that is incrementally deployable, (mostly) backwards compatible and can be efficiently implemented using conventional technology. 1.

Since 1984, the Condor project has enabled ordinary users to do extraordinary computing. Today, the project continues to explore the social and technical problems of cooperative computing on scales ranging from the desktop to the world-wide computational grid. In this chapter, we provide the history and philosophy of the Condor project and describe how it has interacted with other projects and evolved along with the field of distributed computing. We outline the core components of the Condor system and describe how the technology of computing must correspond to social structures. Throughout, we reflect on the lessons of experience and chart the course traveled by research ideas as they grow into production systems.