2022-03

2022 International Conference on Computer Science and Software Engineering (CSASE)

ElGamal cryptosystem is one of the well-known public-key algorithms for its ability to generate different ciphertexts for the same plaintext on successive runs. However, this algorithm results in a ciphertext occupying a larger memory space than its plaintext due to its encryption nature. As a result, it is pretty infeasible to use data that require their encrypted form to have the same size, such as image data. To overcome this issue, we propose an enhanced ElGamal cryptosystem that can be used for any given digital data message, including image, text, and video. The proposed approach mainly tests image data, consisting of three stages: key pair generation, image encryption, and image decryption. First, we generate as many random bytes as required for encrypting or decrypting images using the sender or receiver's public key information. Then, we use an XOR operation between each pixel in the image and each randomly generated byte to obtain the encrypted or decrypted image. Experimental results revealed that the proposed approach gives excellent results in various evaluation metrics tested on four different color images.

2019-04

2019 IEEE International Conference on Advanced Science and Engineering (ICOASE)

Information hiding has brought a lot of attention in recent years. In much of this research tasks, different techniques were considered where data could be prevented from stealing. This will avoid any possible risk it may happen to our data. Due to the challenges involved in designing different security algorithms using hiding based aspects such as the nature of wireless communication, literature has proposed new algorithms in order to increase the security of the data. Steganography has been used to hide data using media cover to deal with the right target. However, these techniques have different issues regarding the visual quality, capacity, and robustness. Based on this, we proposed a new method of steganography to make the balance between all factors by using the feature points. The proposed method also improves the layer of security for the hidden data due to applying Arnold Cat algorithm on secret message prior to the embedding stage.

2017-05

IEEE Long Island Systems, Applications and Technology Conference (LISAT)

Nowadays, video steganography has become important in many security applications. The performance of any steganographic method ultimately relies on the imperceptibility, hiding capacity, and robustness. In the past decade, many video steganography methods have been proposed; however, the literature lacks of sufficient survey articles that discuss all techniques. This paper presents a comprehensive study and analysis of numerous cutting edge video steganography methods and their performance evaluations from literature. Both compressed and raw video steganographic methods are surveyed. In the compressed domain, video steganographic techniques are categorized according to the video compression stages as venues for data hiding such as intra frame prediction, inter frame prediction, motion vectors, transformed and quantized coefficients, and entropy coding. On the other hand, raw video steganographic methods are classified into spatial and transform domains. This survey suggests current research directions and recommendations to improve on existing video steganographic techniques.

2016-09

IEEE 37th Sarnoff Symposium

In the past decade, the science of information hiding has gained tremendous significance due to advances in information and communication technology. The performance of any steganographic algorithm relies on the embedding efficiency, embedding payload, and robustness against attackers. Low hidden ratio, less security, and low quality of stego videos are the major issues of many existing steganographic methods. In this paper, we propose a novel video steganography method in DCT domain based on Hamming and BCH codes. To improve the security of the proposed algorithm, a secret message is first encrypted and encoded by using BCH codes. Then, it is embedded into the discrete cosine transform (DCT) coefficients of video frames. The hidden message is embedded into DCT coefficients of each Y, U, and V planes excluding DC coefficients. The proposed algorithm is tested under two types of videos that contain slow and fast moving objects. The experiential results of the proposed algorithm are compared with three existing methods. The comparison results show that our proposed algorithm outperformed other algorithms. The hidden ratio of the proposed algorithm is approximately 27.53%, which is considered as a high hiding capacity with a minimal tradeoff of the visual quality. The robustness of the proposed algorithm was tested under different attacks.

2016-04

IEEE Long Island Systems, Applications and Technology Conference (LISAT)

Due to the significant growth of video data over the Internet, it has become a popular choice for data hiding field. The performance of any steganographic algorithm relies on the embedding efficiency, embedding payload, and robustness against attackers. Low hidden ratio, less security, and low quality of stego videos are the major issues of many existing steganographic methods. In this paper, we propose a DCT-based robust video steganographic method using BCH codes. To improve the security of the proposed algorithm, a secret message is first encrypted and encoded by using BCH codes. Then, it is embedded into the discrete cosine transform (DCT) coefficients of video frames. The hidden message is embedded into DCT coefficients of each Y, U, and V planes excluding DC coefficients. The proposed algorithm is tested under two types of videos that contain slow and fast moving objects. The results of the proposed algorithm are compared with three existing methods. The results demonstrate better performance for the proposed algorithm than for the others. The hidden ratio of the proposed algorithm is approximately 27.53%, which is evaluated as a high hiding capacity with a minimal tradeoff of the visual quality. The robustness of the proposed algorithm was tested under different attacks.

2015-12

IEEE 14th International Conference on Machine Learning and Applications (ICMLA)

In the modern world, video steganography has become a popular option for secret data communication. The performance of any steganography algorithm is based on the embedding efficiency, embedding payload, and robustness against attackers. In this paper, we propose a new video steganography algorithm based on the multiple object tracking algorithm and Hamming codes. The proposed algorithm includes four different stages. First, the secret message is preprocessed, and Hamming codes (n, k) are applied in order to produce an encoded message. Second, a motion-based multiple object tracking algorithm is applied on cover videos in order to identify the regions of interest of the moving objects. Third, the process of embedding 3 and 6 bits of the encoded message into the 1 LSB and 2 LSBs of RGB pixel components is performed for all motion regions in the video using the foreground mask. Fourth, the process of extracting the secret message from the 1 LSB and 2 LSBs for each RGB component of all moving regions is accomplished. Experimental results of the proposed video steganography algorithm have demonstrated a high embedding efficiency and a high embedding payload.

2015-05

IEEE Long Island Systems, Applications and Technology Conference (LISAT)

Recently, video steganography has become a popular option for a secret data communication. The performance of any steganography algorithm is based on the embedding efficiency, embedding payload, and robustness against attackers. In this paper, we propose a novel video steganography algorithm in the wavelet domain based on the KLT tracking algorithm and BCH codes. The proposed algorithm includes four different phases. First, the secret message is preprocessed, and BCH codes (n, k, t) are applied in order to produce an encoded message. Second, face detection and face tracking algorithms are applied on the cover videos in order to identify the facial regions of interest. Third, the process of embedding the encoded message into the high and middle frequency wavelet coefficients of all facial regions is performed. Forth, the process of extracting the secret message from the high and middle frequency wavelet coefficients for each RGB components of all facial regions is accomplished. Experimental results of the proposed video steganography algorithm have demonstrated a high embedding efficiency and a high embedding payload.

2015-04

American Society for Engineering Education Conference (ASEE)

In this paper, in order to improve the security and efficiency of the steganography algorithm, we propose an efficient video steganography algorithm based on the binary BCH codes. First the pixels’ positions of the video frames’ components are randomly permuted by using a private key. Moreover, the bits’ positions of the secret message are also permuted using the same private key. Then, the secret message is encoded by applying BCH codes (n, k, t), and XORed with random numbers before the embedding process in order to protect the message from being read. The selected embedding area in each Y, U, and V frame components is randomly chosen, and will differ from frame to frame. The embedding process is achieved by hiding each of the encoded blocks into the 3-2-2 least significant bit (LSB) of the selected YUV pixels. Experimental results have demonstrated that the proposed algorithm have a high embedding efficiency, high embedding payload, and resistant against hackers.

2015-04

IEEE Wireless Telecommunications Symposium (WTS)

Video steganography has become a popular topic due to the significant growth of video data over the Internet. The performance of any steganography algorithm depends on two factors: embedding efficiency and embedding payload. In this paper, a high embedding payload of video steganography algorithm has been proposed based on the BCH coding. To improve the security of the algorithm, a secret message is first encoded by BCH(n, k, t) coding. Then, it is embedded into the discrete wavelet transform (DWT) coefficients of video frames. As the DWT middle and high frequency regions are considered to be less sensitive data, the secret message is embedded only into the middle and high frequency DWT coefficients. The proposed algorithm is tested under two types of videos that contain slow and fast motion objects. The results of the proposed algorithm are compared to both the Least Significant Bit (LSB) and [1] algorithms. The results demonstrate better performance for the proposed algorithm than for the others. The hiding ratio of the proposed algorithm is approximately 28%, which is evaluated as a high embedding payload with a minimal tradeoff of visual quality. The robustness of the proposed algorithm was tested under various attacks. The results were consistent.

2014-05

IEEE Long Island Systems, Applications and Technology Conference (LISAT)

Due to the high speed of internet and advances in technology, people are becoming more worried about information being hacked by attackers. Recently, many algorithms of steganography and data hiding have been proposed. Steganography is a process of embedding the secret information inside the host medium (text, audio, image and video). Concurrently, many of the powerful steganographic analysis software programs have been provided to unauthorized users to retrieve the valuable secret information that was embedded in the carrier files. Some steganography algorithms can be easily detected by steganalytical detectors because of the lack of security and embedding efficiency. In this paper, we propose a secure video steganography algorithm based on the principle of linear block code. Nine uncompressed video sequences are used as cover data and a binary image logo as a secret message. The pixels' positions of both cover videos and a secret message are randomly reordered by using a private key to improve the system's security. Then the secret message is encoded by applying Hamming code (7, 4) before the embedding process to make the message even more secure. The result of the encoded message will be added to random generated values by using XOR function. After these steps that make the message secure enough, it will be ready to be embedded into the cover video frames. In addition, the embedding area in each frame is randomly selected and it will be different from other frames to improve the steganography scheme's robustness. Furthermore, the algorithm has high embedding efficiency as demonstrated by the experimental results that we have obtained. Regarding the system's quality, the Pick Signal to Noise Ratio (PSNR) of stego videos are above 51 dB, which is close to the original video quality. The embedding payload is also acceptable, where in each video frame we can embed 16 Kbits and it can go up to 90 Kbits without noticeable degrading of the stego video's quality.

2014-04

IEEE American Society for Engineering Education (ASEE Zone 1)

The advances in hardware speed has being rapidly increased rapidly in the recent years, which will lead to the ability to decrypt well known decryption algorithms in short time. This motivated many researchers to investigate better techniques to prevent disclosing and eavesdropping of communicated data. Quantum Cryptography is a promising solution, since it relies on the prosperities of quantum physics that ensure no change in the quantum state without the knowledge of the sender/receiver. Quantum Communication Scheme for Blind Signature with Two-Particle Entangled Quantum-Trits was proposed by Jinjing et al. [1] That scheme uses qutits during the communications and the process of the encryption is not clearly defined. In this paper we suggest a modification of Jinjing et al. protocol using qubits and qutrits during the encryption and decryption which proposed by Zhou et al. [2] The proposed algorithms enhances the efficiency of that scheme and creates a quantum cryptosystem environment to exchange the data in a secure way. During the communications, all the messages are encrypted using the the private key of the sender and a third party verifies the authenticity and the blindness of the signature.

2014-03

IEEE American Society for Engineering Education (ASEE Zone 1)

Recently wireless sensor networks (WSN) became an interesting topic because of its increasing usage in many fields; medical systems, environment monitoring, military applications and video surveillance. Usually sensors are placed in the desired locations to gather information frequently and then transfer it to the observers. WSN consists of a collection of application specific sensors, a wireless transceiver and a simple general purpose processor. In heterogeneous wireless sensor network, researchers found many challenging issues including the limited energy, the efficient usage of the energy, and the problem with the hierarchy of the network as imbalance network. Many studies indicated that the node clustering is a promising solution for such issues. Clustering has been shown to increase the efficacy of the energy consumption where clusters are formed dynamically with neighboring sensors and the power is assumed to be distributed equally among nodes. One of the nodes is considered as the cluster head that is responsible for transferring data among the neighboring sensors. In this work, we propose a modification based on SEP protocol. EM-SEP aims to prolong the stable period of the sensor network by maintaining balanced energy consumption. This means that we choose the advanced nodes to become cluster heads more often than the normal nodes as the case with SEP protocol. Furthermore, EMSEP takes in account the number of nodes that are associated with each cluster head. Another important enhancement of EMSEP protocol that if there are more than one sensor available to be a cluster head at certain round, we choose the sensor with highest energy.

2013-04

American Society for Engineering Education

Vehicular Ad-hoc Network (VANET) is a new network technology where the cars are used as mobile nodes to form a communication network. In VANET, routing protocols have a significant role in terms of the performance because they determine the way of sending and receiving packets between mobile nodes. In this paper, we examine and analyze the performance of Ad-hoc On-Demand (AODV), Ad-hoc On-demand Multipath Distance Vector (AOMDV), Dynamic Source Routing (DSR) and Destination-Sequenced Distance Vector (DSDV) routing protocols over two different traffic connections; TCP and Constant Bit Rate (CBR) using different speeds and packet sizes. The performance measurements; Packet Delivery Ratio, Average End to End Delay and Average Throughput are examined with respect to speed and packet size. The objective of this study is to find the best routing protocol over all circumstances. Based on our validated results, DSR performs the best among all evaluated protocols.

2013-03

American Society for Engineering Education

Innovation of technology and having fast Internet make information to distribute over the world easily and economically. This is made people to worry about their privacy and works. Steganography is a technique that prevents unauthorized users to have access to the important data. The steganography and digital watermarking provide methods that users can hide and mix their information within other information that make them difficult to recognize by attackers. In this paper, we review some techniques of steganography and digital watermarking in both spatial and frequency domains. Also we explain types of host documents and we focused on types of images.