scholarly journals Protecting Secret Data from Insider Attacks

2005 ◽  
pp. 16-30 ◽  
Author(s):  
David Dagon ◽  
Wenke Lee ◽  
Richard Lipton
Keyword(s):  
Secret Data

scholarly journals Generalized Reversible Data Hiding with Content-Adaptive Operation and Fast Histogram Shifting Optimization

Entropy ◽  
2021 ◽  
Vol 23 (7) ◽  
pp. 917
Author(s):  
Limengnan Zhou ◽  
Hongyu Han ◽  
Hanzhou Wu
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Hot Spot ◽  
Data Embedding ◽  
Histogram Shifting ◽  
Secret Data ◽  
Content Selection ◽  
Wide Range ◽  
Map Generation ◽  
Content Adaptive

Reversible data hiding (RDH) has become a hot spot in recent years as it allows both the secret data and the raw host to be perfectly reconstructed, which is quite desirable in sensitive applications requiring no degradation of the host. A lot of RDH algorithms have been designed by a sophisticated empirical way. It is not easy to extend them to a general case, which, to a certain extent, may have limited their wide-range applicability. Therefore, it motivates us to revisit the conventional RDH algorithms and present a general framework of RDH in this paper. The proposed framework divides the system design of RDH at the data hider side into four important parts, i.e., binary-map generation, content prediction, content selection, and data embedding, so that the data hider can easily design and implement, as well as improve, an RDH system. For each part, we introduce content-adaptive techniques that can benefit the subsequent data-embedding procedure. We also analyze the relationships between these four parts and present different perspectives. In addition, we introduce a fast histogram shifting optimization (FastHiSO) algorithm for data embedding to keep the payload-distortion performance sufficient while reducing the computational complexity. Two RDH algorithms are presented to show the efficiency and applicability of the proposed framework. It is expected that the proposed framework can benefit the design of an RDH system, and the introduced techniques can be incorporated into the design of advanced RDH algorithms.

scholarly journals Reversible Data Hiding in Encrypted Images Using Median Edge Detector and Two’s Complement

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 921
Author(s):  
Rui Wang ◽  
Guohua Wu ◽  
Qiuhua Wang ◽  
Lifeng Yuan ◽  
Zhen Zhang ◽  
...  
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Personal Information ◽  
Rapid Development ◽  
Prediction Method ◽  
Prediction Errors ◽  
Edge Detector ◽  
Secret Data ◽  
Encrypted Images ◽  
Cloud Servers

With the rapid development of cloud storage, an increasing number of users store their images in the cloud. These images contain many business secrets or personal information, such as engineering design drawings and commercial contracts. Thus, users encrypt images before they are uploaded. However, cloud servers have to hide secret data in encrypted images to enable the retrieval and verification of massive encrypted images. To ensure that both the secret data and the original images can be extracted and recovered losslessly, researchers have proposed a method that is known as reversible data hiding in encrypted images (RDHEI). In this paper, a new RDHEI method using median edge detector (MED) and two’s complement is proposed. The MED prediction method is used to generate the predicted values of the original pixels and calculate the prediction errors. The adaptive-length two’s complement is used to encode the most prediction errors. To reserve room, the two’s complement is labeled in the pixels. To record the unlabeled pixels, a label map is generated and embedded into the image. After the image has been encrypted, it can be embedded with the data. The experimental results indicate that the proposed method can reach an average embedding rate of 2.58 bpp, 3.04 bpp, and 2.94 bpp on the three datasets, i.e., UCID, BOSSbase, BOWS-2, which outperforms the previous work.

scholarly journals A Location Map Reduced Reversible Data Hiding Method Using Prediction Error Modification

2012 ◽  
Vol 6-7 ◽  
pp. 428-433
Author(s):  
Yan Wei Li ◽  
Mei Chen Wu ◽  
Tung Shou Chen ◽  
Wien Hong
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Prediction Error ◽  
Reversible Data Hiding ◽  
Experimental Results ◽  
Cover Image ◽  
Prediction Errors ◽  
Secret Data ◽  
Location Map ◽  
Comparable Image Quality

We propose a reversible data hiding technique to improve Hong and Chen’s (2010) method. Hong and Chen divide the cover image into pixel group, and use reference pixels to predict other pixel values. Data are then embedded by modifying the prediction errors. However, when solving the overflow and underflow problems, they employ a location map to record the position of saturated pixels, and these pixels will not be used to carry data. In their method, if the image has a plenty of saturated pixels, the payload is decreased significantly because a lot of saturated pixels will not joint the embedment. We improve Hong and Chen’s method such that the saturated pixels can be used to carry data. The positions of these saturated pixels are then recorded in a location map, and the location map is embedded together with the secret data. The experimental results illustrate that the proposed method has better payload, will providing a comparable image quality.

scholarly journals High Embedding Capacity Data Hiding Algorithm for H.264/AVC Video Sequences without Intraframe Distortion Drift

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Dinh-Chien Nguyen ◽  
Thai-Son Nguyen ◽  
Chin-Chen Chang ◽  
Huan-Sheng Hsueh ◽  
Fang-Rong Hsu
Keyword(s):  
Digital Media ◽  
Data Hiding ◽  
Video Sequences ◽  
Embedding Capacity ◽  
Secret Data ◽  
Low Distortion ◽  
High Embedding Capacity ◽  
Advanced Video Coding ◽  
Distortion Drift ◽  
Capacity Data

Data hiding is a technique that allows secret data to be delivered securely by embedding the data into cover digital media. In this paper, we propose a new data hiding algorithm for H.264/advanced video coding (AVC) of video sequences with high embedding capacity. In the proposed scheme, to embed secret data into the quantized discrete cosine transform (QDCT) coefficients of I frames without any intraframe distortion drift, some embeddable coefficient pairs are selected in each block, and they are divided into two different groups, i.e., the embedding group and the averting group. The embedding group is used to carry the secret data, and the averting group is used to prevent distortion drift in the adjacent blocks. The experimental results show that the proposed scheme can avoid intraframe distortion drift and guarantee low distortion of video sequences. In addition, the proposed scheme provides enhanced embedding capacity compared to previous schemes. Moreover, the embedded secret data can be extracted completely without the requirement of the original secret data.

Data hiding technique in steganography for information security using number theory

2018 ◽  
Vol 45 (6) ◽  
pp. 767-778 ◽  
Author(s):  
Amjad Rehman ◽  
Tanzila Saba ◽  
Toqeer Mahmood ◽  
Zahid Mehmood ◽  
Mohsin Shah ◽  
...  
Keyword(s):  
Number Theory ◽  
Data Transfer ◽  
Signal To Noise Ratio ◽  
Fibonacci Sequence ◽  
Critical Issue ◽  
Secret Data ◽  
Science And Art ◽  
Bit Planes ◽  
Audio Video ◽  
Salt And Pepper

In the current era, due to the widespread availability of the Internet, it is extremely easy for people to communicate and share multimedia contents with each other. However, at the same time, secure transfer of personal and copyrighted material has become a critical issue. Consequently, secure means of data transfer are the most urgent need of the time. Steganography is the science and art of protecting the secret data from an unauthorised access. The steganographic approaches conceal secret data into a cover file of type audio, video, text and/or image. The actual challenge in steganography is to achieve high robustness and capacity without bargaining on the imperceptibility of the cover file. In this article, an efficient steganography method is proposed for the transfer of secret data in digital images using number theory. For this purpose, the proposed method represents the cover image using the Fibonacci sequence. The representation of an image in the Fibonacci sequence allows increasing the bit planes from 8-bit to 12-bit planes. The experimental results of the proposed method in comparison with other existing steganographic methods exhibit that our method not only achieves high embedding of secret data but also gives high quality of stego images in terms of peak signal-to-noise ratio (PSNR). Furthermore, the robustness of the technique is also evaluated in the presence of salt and pepper noise attack on the cover images.

scholarly journals A secure image steganography based on burrows wheeler transform and dynamic bit embedding

2019 ◽  
Vol 9 (1) ◽  
pp. 460
Author(s):  
Ahmed Toman Thahab
Keyword(s):  
Communication Networks ◽  
Color Image ◽  
Image Steganography ◽  
Digital Data ◽  
Embedding Capacity ◽  
Image Size ◽  
Secret Data ◽  
Exclusive Or ◽  
Burrows Wheeler Transform ◽  
Color Image Steganography

In modern public communication networks, digital data is massively transmitted through the internet with a high risk of data piracy. Steganography is a technique used to transmit data without arousing suspicion of secret data existence.  In this paper, a color image steganography technique is proposed in spatial domain. The cover image is segmented into non-overlapping blocks which are scattered among image size window using Burrows Wheeler transform before embedding. Secret data is embedded in each block according to its sequence in the Burrows Wheeler transform output. The hiding method is an operation of an exclusive-or between a virtual bit which is generated from the most significant bit and the least significant bits of the cover pixel. Results of the algorithm are analyzed according to its degradation of the output image and embedding capacity. The results are also compared with other existing methods.

scholarly journals Taylor expansion based stereo image reversible data hiding

2020 ◽  
Author(s):  
Xinyang Ying ◽  
Guobing Zhou
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Taylor Expansion ◽  
Stereo Image ◽  
Embedding Capacity ◽  
Stereo Images ◽  
Secret Data ◽  
Stego Image ◽  
Multi Level

Abstract The reversible data hiding allows original image to be completely recovered from the stego image when the secret data has been extracted, it is has drawn a lot of attentions from researchers. In this paper, a novel Taylor Expansion (TE) based stereo image reversible data hiding method is presented. Since the prediction accuracy is essential to the data hiding performance, a novel TE based predictor using correlations of two views of the stereo image is proposed. TE can fully exploit strong relationships between matched pixels in the stereo image so that the accuracy of the prediction can be improved. Then, histogram shifting is utilized to embed data to decrease distortion of stereo images, and multi-level hiding can increase embedding capacity. Experimental results show that the proposed method is superior to some existing data hiding methods considering embedding capacity and the quality of the stego stereo images.

scholarly journals Improved Algorithm of Steganography Combined with Cryptography

2021 ◽  
Vol 9 (VI) ◽  
pp. 3793-3804
Author(s):  
Anees Banu
Keyword(s):  
Information Security ◽  
Multimedia Information ◽  
Secret Data ◽  
Confidential Information ◽  
Additional Layer ◽  
Confidential Data ◽  
The World ◽  
Cryptographic Algorithms ◽  
Written Form ◽  
Improved Algorithm

When it comes to preventing unauthorised access to, destruction of, or inspection of confidential data, information security has always been a major factor. Multimedia information is now used in every field throughout the world. The confidential information that is used in these areas must be kept secure. There are a variety of methods for keeping data secure. One of these is steganography, which is concealing information within other data into a format that the cover information remains unchanged. Cryptography, an encryption process that scrambles data into a written form that is sometimes referred to as a hash, is an auxiliary approach for securing information. Steganography and cryptography each have their own set of benefits and drawbacks. Even though both technologies give security, it is usually a good practise to combine Cryptographic algorithms to create additional layers of security. When cryptographic with steganography are combined, a multi-layer security paradigm is created. The proposed work's main goal is to add an additional layer of protection by using cryptography and steganography to encrypt and embed secret data conveyed across an insecure channel.

scholarly journals A Novel (2, 3)-Threshold Reversible Secret Image Sharing Scheme Based on Optimized Crystal-Lattice Matrix

Symmetry ◽  
2021 ◽  
Vol 13 (11) ◽  
pp. 2063
Author(s):  
Jiang-Yi Lin ◽  
Ji-Hwei Horng ◽  
Chin-Chen Chang
Keyword(s):  
Crystal Lattice ◽  
Three Dimensional ◽  
Lattice Models ◽  
Cover Image ◽  
Secret Image Sharing ◽  
Secret Data ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Growth Phenomenon

The (k, n)-threshold reversible secret image sharing (RSIS) is technology that conceals the secret data in a cover image and produces n shadow versions. While k (kn) or more shadows are gathered, the embedded secret data and the cover image can be retrieved without any error. This article proposes an optimal (2, 3) RSIS algorithm based on a crystal-lattice matrix. Sized by the assigned embedding capacity, a crystal-lattice model is first generated by simulating the crystal growth phenomenon with a greedy algorithm. A three-dimensional (3D) reference matrix based on translationally symmetric alignment of crystal-lattice models is constructed to guide production of the three secret image shadows. Any two of the three different shares can cooperate to restore the secret data and the cover image. When all three image shares are available, the third share can be applied to authenticate the obtained image shares. Experimental results prove that the proposed scheme can produce secret image shares with a better visual quality than other related works.

scholarly journals A Novel LSB Matching Algorithm Based on Information Pre-Processing

Mathematics ◽  
2021 ◽  
Vol 10 (1) ◽  
pp. 8
Author(s):  
Yongjin Hu ◽  
Xiyan Li ◽  
Jun Ma
Keyword(s):  
Golden Ratio ◽  
High Capacity ◽  
Matching Function ◽  
Secret Data ◽  
Matching Algorithm ◽  
Lsb Matching ◽  
Low Distortion ◽  
Good Trade ◽  
Scanned Documents ◽  
Theory And Experiment

This paper analyzes random bits and scanned documents, two forms of secret data. The secret data were pre-processed by halftone, quadtree, and S-Box transformations, and the size of the scanned document was reduced by 8.11 times. A novel LSB matching algorithm with low distortion was proposed for the embedding step. The golden ratio was firstly applied to find the optimal embedding position and was used to design the matching function. Both theory and experiment have demonstrated that our study presented a good trade-off between high capacity and low distortion and is superior to other related schemes.

Sign in / Sign up

Export Citation Format

Share Document