Constructing Perfect Steganographic Systems
نویسندگان
چکیده
Article history: Received 11 September 2008 Revised 29 April 2011 Available online 22 July 2011
منابع مشابه
Steganographic Codes -- a New Problem of Coding Theory
— To study how to design steganographic algorithm more efficiently, a new coding problem – steganographic codes (abbreviated stego-codes) – is presented in this paper. The stego-codes are defined over the field with q(q ≥ 2) elements. Firstly a method of constructing linear stego-codes is proposed by using the direct sum of vector subspaces. And then the problem of linear stego-codes is convert...
متن کاملOn The Limits Of Perfect Security For Steganographic System
Until now the discussion on perfect security for steganographic systems has remained confined within the realm of mathematicians and information theory experts whose concise and symbolic representation of their philosophies, postulates, and inference thereafter has made it hard for the naïve academics to have an insight of the concepts. This paper is an endeavor not only to appraise on the limi...
متن کاملProduct perfect Z2 Z4-linear codes in steganography
Product perfect codes have been proven to enhance the performance of the F5 steganographic method, whereas perfect Z2Z4-linear codes have been recently introduced as an efficient way to embed data, conforming to the ±1-steganography. In this paper, we present two steganographic methods. On the one hand, a generalization of product perfect codes is made. On the other hand, this generalization is...
متن کاملEfficient Public Key Steganography Secure Against Adaptive Chosen Stegotext Attacks
We provide construction of steganographic schemes secure against adaptive chosen stegotext attacks. Our constructions achieve embedding rate equals to the Shannon entropy bound on steganographic channel capacity. Further the covertext distribution can be given as either an integrable probability function or as a random covertext sampler. We also introduce steganographic codes that are of intere...
متن کاملOn Ryabko&Ryabko asymptotically optimal perfect steganographic scheme in a noisy channel
We consider a scenario when a perfect steganographic system of [1] is used for data transmission over a noisy channel. We shown that errors in the resulting channel form the insertion-deletion channel.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 209 شماره
صفحات -
تاریخ انتشار 2011