scholarly journals High Complexity Bit-Plane Security Enchancement in BPCS Steganography

2017 ◽  
Author(s):  
Andysah Putera Utama Siahaan
Keyword(s):  
Data Hiding ◽  
Data Security ◽  
Original Data ◽  
Cover Image ◽  
Security Level ◽  
High Complexity ◽  
High Security Level ◽  
Bit Plane ◽  
Exclusive Or ◽  
Plane Form

In BPCS Steganography, data hiding will be split into blocks that have a high complexity where the blocks are categorized into informative and noise-like regions. A noise-like region is a bit-plane that has the greatest probability as a data hiding since it has a high complexity. In this region, the data inserted is vulnerable to attack. Someone can easily take a series of characters that are stored on a noise-like region previously if the system is not modified. Improving the bit-plane composition is to increase data security. Bit-plane will be combined with a specified key. The key should be changed to bit-plane form as well. The key that has already been turned into the bit-plane will be mated with the original data. Using an exclusive-or of this part is the best way to produce the cipher bit-plane. Finally, the data residing on the cover image produced have a high-security level.

scholarly journals Secure Data Hiding using Reversible Image Transformation

2020 ◽  
Vol 9 (4) ◽  
pp. 132-138
Keyword(s):  
Data Storage ◽  
Data Hiding ◽  
Original Data ◽  
Cover Image ◽  
Equal Size ◽  
Image Transformation ◽  
Additional Information ◽  
Insertion Algorithm ◽  
Encrypted Images ◽  
Carrier Image

In today’s era, the large amount of data’s are stored in cloud. But nowadays securely storing data to the cloud is an important task. But the unauthorized parties are tries to decrypt the data from the cloud. So, the data stored in cloud should be secure from any malicious activities. Based on these requests, we propose a framework named reversible data hiding (RDH). It mainly works on encrypted images based on reversible image transformation (RIT). The server insert data into the cloud. On that time, he will add some additional information for the protection of data. In the given framework, the original data can be embedded in another image named carrier image with equal size. So, the hacker tries to pullout the data, he will only get the carrier image. So we can accommodate more data’s into a single storage space. The method picks the data to be hide and a carrier image with equal size. The cover image is embedded into the original image based on the LSB insertion algorithm. i.e., the original data’s are dissolved into the carrier image using a secret hiding key. The cover image is encrypted using blow fish encryption algorithm. It includes normal RDH method and RDH with RIT. Using RIT, it gives high visual quality and security. The technique is mainly used in medical imagery, military imagery for reliable data storage.

Applications of Machine Learning in Steganography for Data Protection and Privacy

2021 ◽  
pp. 306-325
Author(s):  
Mahip M. Bartere ◽  
Sneha Bohra ◽  
Prashant Adakane ◽  
B. Santhosh Kumar
Keyword(s):  
Machine Learning ◽  
Data Hiding ◽  
Data Protection ◽  
Data Security ◽  
Data Extraction ◽  
Original Data ◽  
Extraction Techniques ◽  
Reverse Engineer ◽  
Applications Of Machine Learning

Data security is one of the most important aspects in today's scenario. Whenever we send our data from source to destination, data protection is one of the prime components. With the help of data hiding and data extraction techniques, we are able to provide the solution of different types of problems whenever we transfer our data. Steganography is a process where we can hide our data and maintain the quality of the image. At the same time, we think about data alteration. With the help of stegtanalysis method, we reverse engineer and extract the original data. In this chapter, data hiding and data extraction techniques are explained in the combination of machine learning architecture. The combination of steganography and steganalysis along with machine learning is used to identify protected data using different techniques.

Dual images in reversible data hiding with adaptive color space variation using wavelet transforms

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
K. Upendra Raju ◽  
N. Amutha Prabha
Keyword(s):  
Wavelet Transform ◽  
Data Hiding ◽  
Data Security ◽  
Reversible Data Hiding ◽  
Color Space ◽  
Cover Image ◽  
Color Spaces ◽  
Lifting Wavelet Transform ◽  
Content Type ◽  
Lifting Wavelet

PurposeSteganography is a data hiding technique used in the data security. while transmission of data through channel, no guarantee that the data is transmitted safely or not. Variety of data security techniques exists such as patch work, low bit rate data hiding, lossy compression etc. This paper aims to increase the security and robustness.Design/methodology/approachThis paper describes, an approach for multiple images steganography that is oriented on the combination of lifting wavelet transform (LWT) and discrete cosine transform (DCT). Here, we have one cover image and two secret images. The cover image is applied with one of the different noises like Gaussian, Salt & Pepper, Poisson, and speckle noises and converted into different color spaces of YCbCr, HSV, and Lab.FindingsDue to the vast development of Internet access and multimedia technology, it becomes very simple to hack and trace secret information. Using this steganography process in reversible data hiding (RDH) helps to prevent secret information.Originality/valueWe can divide the color space converted image into four sub-bands of images by using lifting wavelet transform. By selecting lower bands, the discrete cosine transform is computed for hiding two secret images into the cover image and again one of the transformed secret images is converted by using Arnold transform to get the encrypted/embedded/encoded image. To extract the Stego image, we can apply the revertible operation. For comparing the results, we can calculate PSNR, SSIM, and MSE values by applying the same process for all color spaces of YCbCr, HSV, and Lab. The experimental results give better performance when compared to all other spaces.

scholarly journals Implementasi Algoritma Massey-Omura dan Algoritma Elias Delcta Code Pada Pengamanan dan Kompresi File Dokumen

2020 ◽  
Vol 1 (3) ◽  
pp. 239
Author(s):  
Rosalina Manalu
Keyword(s):  
Data Security ◽  
Data Exchange ◽  
Rapid Development ◽  
Exchange Process ◽  
Lossless Compression ◽  
Original Data ◽  
Security Level ◽  
Time Data ◽  
Cryptographic Algorithm ◽  
Compression Time

The rapid development of information technology requires users to be more careful in maintaining data confidentiality and security so that data is not known or manipulated by other parties. Data security is very important for users, data security can be maintained by everyone. Cryptography is one of the security tools used to encode a document file. One of them is by using the Massey-Omura algorithm, which is an asymmetric cryptographic algorithm, so that it has different keys for encryption and decryption. In the process of sending data, it also requires the duration of sending files to not give an opportunity to data thieves by compressing the data or reducing the size of the file to be smaller without losing the contents of the document file, so the data exchange process can be shorter Data compression is a process where text, audio, and video files are transformed into compressed files with smaller data sizes but do not lose the actual information. This study discusses the type of lossless compression, so that files obtained from decompression will be identical to the original data. Elias Delta Code is a type of lossless compression. The performance parameters of this algorithm will be measured by Ratio of Compression (RC, Space Saving (SS) and compression time. Data used in the testing process is data that consists of several types of characters. In this discussion will include explanation, how to work, advantages and The author will also try to provide a review of ways to improve the security level of document files.

scholarly journals Improving Security of Crypto-Steg Approach using Time Sequence Dictionary and Modifying Spacing Techniques

2021 ◽  
Author(s):  
Inas Ali Abdulmunem
Keyword(s):  
Data Security ◽  
Block Size ◽  
Time Sequence ◽  
Time Shift ◽  
Secret Message ◽  
Security Level ◽  
Aes Algorithm ◽  
Computational Requirement ◽  
High Security Level ◽  
Space Method

Cryptography and steganography are significant tools for data security. Hybrid the cryptography with Steganography can give more security by taking advantage of each technique. This work has proposed a method for improving the crypto-stego method by utilizing the proposed dictionary method to modified ciphertext then hiding modified encrypt ciphertext in the text by used the proposed modified space method. For cryptography, we have been utilized an advanced encryption standard (AES) to the encrypted message, The AES algorithm is utilized a 128bit Block Size and 256bit key size. The ciphertext characters is then replaced by the characters identified by dictionary list. The dictionary is time-dependent, where each of the equivalent words will shifting based on the time-shift equation. The modified ciphertext is then embedded into a cover text so that the attacker cannot separate them by applying cryptanalysis.  The “Modifying Spaces” method used “Spaces” to build a steganography tool that hide the secret message. The experimental results show that the proposed method has achieved high-security level when combined cryptography and steganography in such way that the ciphertext is changed to another value by a used dictionary with time sequence that makes cryptanalysis test failed to guess and identify the algorithm that been used for encryption. The stego. test shows the proposed method achieved good results in term of capacity and visibility which is approved it hard to notice. The tests also approved that the proposed methods run fast with a less computational requirement.

A New User-controlled and Efficient Encrypted Data Sharing Model in Cloud Storage

2019 ◽  
Vol 13 (4) ◽  
pp. 356-363
Author(s):  
Yuezhong Wu ◽  
Wei Chen ◽  
Shuhong Chen ◽  
Guojun Wang ◽  
Changyun Li
Keyword(s):  
Data Sharing ◽  
Data Security ◽  
Cloud Storage ◽  
Screening Program ◽  
Original Data ◽  
Third Party ◽  
Active System ◽  
Encrypted Data ◽  
Active User ◽  
User Data

Background: Cloud storage is generally used to provide on-demand services with sufficient scalability in an efficient network environment, and various encryption algorithms are typically applied to protect the data in the cloud. However, it is non-trivial to obtain the original data after encryption and efficient methods are needed to access the original data. Methods: In this paper, we propose a new user-controlled and efficient encrypted data sharing model in cloud storage. It preprocesses user data to ensure the confidentiality and integrity based on triple encryption scheme of CP-ABE ciphertext access control mechanism and integrity verification. Moreover, it adopts secondary screening program to achieve efficient ciphertext retrieval by using distributed Lucene technology and fine-grained decision tree. In this way, when a trustworthy third party is introduced, the security and reliability of data sharing can be guaranteed. To provide data security and efficient retrieval, we also combine active user with active system. Results: Experimental results show that the proposed model can ensure data security in cloud storage services platform as well as enhance the operational performance of data sharing. Conclusion: The proposed security sharing mechanism works well in an actual cloud storage environment.

scholarly journals E-ART: A New Encryption Algorithm Based on the Reflection of Binary Search Tree

Cryptography ◽  
2021 ◽  
Vol 5 (1) ◽  
pp. 4
Author(s):  
Bayan Alabdullah ◽  
Natalia Beloff ◽  
Martin White
Keyword(s):  
Data Storage ◽  
Statistical Tests ◽  
Data Encryption ◽  
Search Tree ◽  
Binary Search ◽  
Binary Search Tree ◽  
Security Level ◽  
Avalanche Effect ◽  
High Security Level ◽  
Tree Data Structure

Data security has become crucial to most enterprise and government applications due to the increasing amount of data generated, collected, and analyzed. Many algorithms have been developed to secure data storage and transmission. However, most existing solutions require multi-round functions to prevent differential and linear attacks. This results in longer execution times and greater memory consumption, which are not suitable for large datasets or delay-sensitive systems. To address these issues, this work proposes a novel algorithm that uses, on one hand, the reflection property of a balanced binary search tree data structure to minimize the overhead, and on the other hand, a dynamic offset to achieve a high security level. The performance and security of the proposed algorithm were compared to Advanced Encryption Standard and Data Encryption Standard symmetric encryption algorithms. The proposed algorithm achieved the lowest running time with comparable memory usage and satisfied the avalanche effect criterion with 50.1%. Furthermore, the randomness of the dynamic offset passed a series of National Institute of Standards and Technology (NIST) statistical tests.

Sign in / Sign up

Export Citation Format

Share Document