اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدConstructing Perfect Steganographic Systems
271
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We propose steganographic systems for the case when covertexts (containers) are generated by a finite-memory source with possibly unknown statistics. The probability distributions of covertexts with and without hidden information are the same; this means that the proposed stegosystems are perfectly secure, i.e. an observer cannot determine whether hidden information is being transmitted. The speed of transmission of hidden information can be made arbitrary close to the theoretical limit - the Shannon entropy of the source of covertexts. An interesting feature of the suggested stegosystems is that they do not require any (secret or public) key. At the same time, we outline some principled computational limitations on steganography. We show that there are such sources of covertexts, that any stegosystem that has linear (in the length of the covertext) speed of transmission of hidden text must have an exponential Kolmogorov complexity. This shows, in particular, that some assumptions on the sources of covertext are necessary.
قيم البحث
اقرأ أيضاً
A binary 1-error-correcting code can always be embedded in a 1-perfect code of some larger length
We investigate perfect codes in $mathbb{Z}^n$ under the $ell_p$ metric. Upper bounds for the packing radius $r$ of a linear perfect code, in terms of the metric parameter $p$ and the dimension $n$ are derived. For $p = 2$ and $n = 2, 3$, we determine
all radii for which there are linear perfect codes. The non-existence results for codes in $mathbb{Z}^n$ presented here imply non-existence results for codes over finite alphabets $mathbb{Z}_q$, when the alphabet size is large enough, and has implications on some recent constructions of spherical codes.
Security and memory management are the major demands for electronics devices like ipods, cell phones, pmps, iphones and digital cameras. In this paper, we have suggested a high level of security mechanism by considering the concept of steganography a
long with the principle of cryptography. Four different methods that can save a considerable amount of memory space have been discussed. Based on these methods, we have constructed secured stego image creator and secured multi image viewer in Microsoft platform so as to provide high level of security and using less memory space for storage of image files in the above said electronic devices
Steganography, as one of the three basic information security systems, has long played an important role in safeguarding the privacy and confidentiality of data in cyberspace. The text is the most widely used information carrier in peoples daily life
, using text as a carrier for information hiding has broad research prospects. However, due to the high coding degree and less information redundancy in the text, it has been an extremely challenging problem to hide information in it for a long time. In this paper, we propose a steganography method which can automatically generate steganographic text based on the Markov chain model and Huffman coding. It can automatically generate fluent text carrier in terms of secret information which need to be embedded. The proposed model can learn from a large number of samples written by people and obtain a good estimate of the statistical language model. We evaluated the proposed model from several perspectives. Experimental results show that the performance of the proposed model is superior to all the previous related methods in terms of information imperceptibility and information hidden capacity.
Multi-class classification is mandatory for real world problems and one of promising techniques for multi-class classification is Error Correcting Output Code. We propose a method for constructing the Error Correcting Output Code to obtain the suitab
le combination of positive and negative classes encoded to represent binary classifiers. The minimum weight perfect matching algorithm is applied to find the optimal pairs of subset of classes by using the generalization performance as a weighting criterion. Based on our method, each subset of classes with positive and negative labels is appropriately combined for learning the binary classifiers. Experimental results show that our technique gives significantly higher performance compared to traditional methods including the dense random code and the sparse random code both in terms of accuracy and classification times. Moreover, our method requires significantly smaller number of binary classifiers while maintaining accuracy compared to the One-Versus-One.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
