476 research outputs found

    Securing Text Messages Using Graph Theory and Steganography

    Get PDF
    تامين البيانات يعتبر كعنصر مهم في انظمة لاتصالات وتناقل البيانات. ويكمن دوره الرئيسي في الحفاظ على المعلومات الحساسة بأمان وبشكل متكامل من المرسل إلى المتلقي ، وهناك نوعان من مبادئ الامنية هما التشفير وإخفاء المعلومات ، الأول يعمل على تغيير مظهر المعلومات ويغير من هيئتها في حين أن الثاني يخفيها من الدخلاء. النظام المصمم يقترح طريقة جديدة للتشفير باستخدام خصائص نظرية البيانات ؛ يعطي مفتاحًا تم إنشاؤه بتحويل كلمة السر الى مخطط (graph) من نوع متكامل  complete  ثم نستخرج مصفوفة التجاور adjacency matrix  للمخطط ونستخدمها كمفتاح نهائي لتشفير النص  وذلك باستخدام عملية الضرب (ضرب المصفوفات) للحصول على النص المشفر بعدها يتم استخدام طريقة البت الاقل اهمية Least Significant Bit LSB   لإخفاء الرسالة المشفرة في صورة ملونة في المكون الاخضر G من مكوناتها. وكذلك تم توظيف معادلة تحليل PSNR والتي اثبتت كفاءة النظام في اخفاء الرسالة باقل تشويش ممكن بحوالي (97-85)  dB لصورة الغلاف قبل وبعد عملية الاخفاء و MSE تتراوح بين  (4.537e-05 -5.27546e-04) و  SSIM=1.0.       Data security is an important component of data communication and transmission systems. Its main role is to keep sensitive information safe and integrated from the sender to the receiver. The proposed system aims to secure text messages through two security principles encryption and steganography. The system produced a novel method for encryption using graph theory properties; it formed a graph from a password to generate an encryption key as a weight matrix of that graph and invested the Least Significant Bit (LSB) method for hiding the encrypted message in a colored image within a green component. Practical experiments of (perceptibility, capacity, and robustness) were calculated using similarity measures like PSNR, MSE, and SSIM. These measures had proved the efficiency of the system for image quality and hiding messages with PSNR ratio more than 85 dB, MSE ranged (4.537e-05  to 5.27546e-04) and SSIM=1.0 for using a cover file with size ranged from 256×300 to 1200×760 pixels and message ranged from 16 to 300 characters.

    Hard Communication Channels for Steganography

    Get PDF
    This paper considers steganography - the concept of hiding the presence of secret messages in legal communications - in the computational setting and its relation to cryptography. Very recently the first (non-polynomial time) steganographic protocol has been shown which, for any communication channel, is provably secure, reliable, and has nearly optimal bandwidth. The security is unconditional, i.e. it does not rely on any unproven complexity-theoretic assumption. This disproves the claim that the existence of one-way functions and access to a communication channel oracle are both necessary and sufficient conditions for the existence of secure steganography in the sense that secure and reliable steganography exists independently of the existence of one-way functions. In this paper, we prove that this equivalence also does not hold in the more realistic setting, where the stegosystem is polynomial time bounded. We prove this by constructing (a) a channel for which secure steganography exists if and only if one-way functions exist and (b) another channel such that secure steganography implies that no one-way functions exist. We therefore show that security-preserving reductions between cryptography and steganography need to be treated very carefully

    Information similarity metrics in information security and forensics

    Get PDF
    We study two information similarity measures, relative entropy and the similarity metric, and methods for estimating them. Relative entropy can be readily estimated with existing algorithms based on compression. The similarity metric, based on algorithmic complexity, proves to be more difficult to estimate due to the fact that algorithmic complexity itself is not computable. We again turn to compression for estimating the similarity metric. Previous studies rely on the compression ratio as an indicator for choosing compressors to estimate the similarity metric. This assumption, however, is fundamentally flawed. We propose a new method to benchmark compressors for estimating the similarity metric. To demonstrate its use, we propose to quantify the security of a stegosystem using the similarity metric. Unlike other measures of steganographic security, the similarity metric is not only a true distance metric, but it is also universal in the sense that it is asymptotically minimal among all computable metrics between two objects. Therefore, it accounts for all similarities between two objects. In contrast, relative entropy, a widely accepted steganographic security definition, only takes into consideration the statistical similarity between two random variables. As an application, we present a general method for benchmarking stegosystems. The method is general in the sense that it is not restricted to any covertext medium and therefore, can be applied to a wide range of stegosystems. For demonstration, we analyze several image stegosystems using the newly proposed similarity metric as the security metric. The results show the true security limits of stegosystems regardless of the chosen security metric or the existence of steganalysis detectors. In other words, this makes it possible to show that a stegosystem with a large similarity metric is inherently insecure, even if it has not yet been broken

    Security during Transmission of Data Using Web Steganography

    Get PDF
    The project entitled Steganography is to give security to a content record. Since the security of the data over the internet has raised a concern to the people. There are many methods to protect the data from going into the access of unauthorized people. Steganography can be used along with the encryption technique to secure the data. Steganography is used to hide the data or a secret message whereas cryptography is used to encrypt the message and make it difficult the people to read. So, the proposed system is to combine both steganography and cryptography for the secret data transmission. The transmission can be done by using an image as a carrier of data. This paper uses high-performance BMP steganography along with a substitution encryption methodology. The approach that is used here is IDEA (International Data Encryption Algorithm) algorithm which is used for encryption. The IDEA algorithm works as follows, it will take the TEXT document and mystery key as the input and gives the encrypted and BMP picture as the output for the sender side. There can additionally be “Voice Recognition System” framework so that it can use voice to decrypt the message. This is the future expansion or scope of this paper

    A review and open issues of multifarious image steganography techniques in spatial domain

    Get PDF
    Nowadays, information hiding is becoming a helpful technique and fetch more attention due fast growth of using internet, it is applied for sending secret information by using different techniques. Steganography is one of major important technique in information hiding. Steganography is science of concealing the secure information within a carrier object to provide the secure communication though the internet, so that no one can recognize and detect it’s except the sender & receiver. In steganography, many various carrier formats can be used such as an image, video, protocol, audio. The digital image is most popular used as a carrier file due its frequency on internet. There are many techniques variable for image steganography, each has own strong and weak points. In this study, we conducted a review of image steganography in spatial domain to explore the term image steganography by reviewing, collecting, synthesizing and analyze the challenges of different studies which related to this area published from 2014 to 2017. The aims of this review is provides an overview of image steganography and comparison between approved studies are discussed according to the pixel selection, payload capacity and embedding algorithm to open important research issues in the future works and obtain a robust method

    Improve a secure blind watermarking technique for digital video

    Get PDF
    In recent years, digital watermark video has become increasingly popular in a range of industries, but because it is widely available on the Internet, it is simple to make unlawful copies and tamper with digital video. Watermarking digital video has become more popular as a method of detecting changes and preventing illegal duplication. This paper presents a video copyright protection system that is secure, blind, and robust. Two approaches that are resistant to diverse attacks are proposed in this research. The initial step is to encrypt a hybrid watermark (Message, Image) using two different encryption techniques (RSA and AES).The second is a steganography technique based on LSB-based robust watermarking, which embeds an encrypted secret bit Message and Image in key frames of an MP4 video file by utilizing the mean of the grayscale images that differ and take the most significant differences between the two images. The intensity of the histogram will become more consistent across all pixels as the encryption quality improves. For keyframe watermarking in the spatial domain, the proposed methods can maintain the watermarked information while achieving high imperceptibility and a Peak Single to Noise Ratio [PSNR] equivalent to more than 50 db, where quality measures (MSE, PSNR, and correlation coefficient) that calculate the levels of distortion caused by embedding a watermark in digital video produce good results
    corecore