Efficient and secure data hiding in encrypted images: A new approach using chaos

ABSTRACT

The recent trends in technology have made it possible to reproduce and share digital media more easily and more rapidly. This leads to the problem of exploiting the media illegitimately. To alleviate this problem, many cryptographic techniques are used to secure the data by encrypting them. However, the cloaked form of encrypted data attracts the intruder and shows the way to malicious attacks. Due to this, in recent times steganography has drawn more attention to secure the data. This article presents a new technique that embeds data in intermediate significant bit (ISB) and least significant bit (LSB) planes of the cover image. The method employs chaotic maps to generate random locations to hide the data bits as well as permutation order to encrypt the cover image. The cover image is first encrypted by applying permutation order, then embedding is carried out on the random locations generated. After embedding, the decrypted cover image is transmitted. This method provides two-level security in extracting the hidden data. Experimental outcomes (PSNR, MSE, NAE, and NCC) confirm that the method is proficient. The randomness of the values generated by chaotic maps is assessed by the NIST standard test suite.     

Data hiding in scrambled images: A new double layer security data hiding technique

The contemporary multimedia and communication technology has made it possible to replicate and distribute digital media easier and faster. This ease of availability causes the problem of exposing transmitted digital data on the network with the risk of being copied or intercepted illegally. Many cryptographic techniques are in vogue to encrypt the data before transmission to avert any security problems. However, disguised appearance of the encrypted data makes the adversary suspicious and increases the chances of malicious attack. In such a scenario data hiding has received significant attention as an alternate way to ensure data security. This paper presents a data hiding technique based on the concepts of scrambling and pseudorandom data hiding; to provide a data hiding system with two layer security to the embedded data, and good perceptual transparency of the stego images. The proposed system uses the novel concept of embedding the secret data in scrambled (encrypted) cover images. The data embedding is carried out in the Intermediate Significant and least significant bit planes of encrypted image at the predetermined locations pointed to by Pseudorandom Address Space (PAS) and Address Space Direction Pointer (ASDP). Experimental results prove the efficacy of scheme viz-a-viz various parameters of interest.     

Dual encoding approach with sequence folding for reversible data hiding in dual stego images

Multimedia Tools and Applications - This paper proposes a dual encoding approach with sequence folding for reversible data hiding in dual stego images. This method initially encodes the secret data...     

Separable reversible data hiding in encrypted images with improved security and capacity

Multimedia Tools and Applications - Reversible data hiding (RDH) has to be conducted in the encrypted images when original images are encrypted for privacy protection in some open environments,...     

Secure data hiding scheme using shape generation algorithm: a key based approach

Data hiding in images has evolved as one of the trusted methods of secure data communication and numerous approaches have been introduced over the years using gray scale images as the cover media. Most of the methods are based on data hiding in least significant bit planes of cover images. Many such methods purely depend on data substitution algorithms by defining a pattern in which data is embedded. One can gain access to the secret data in a few attempts, if the algorithm is known. Keeping this in view several approaches based on secret keys have also been proposed by researchers. This paper proposes an efficient data embedding scheme using a key and an embedding pattern generated through midpoint circle generation algorithm. The pattern can be applied to a carrier that is mapped onto a grid/image. The cryptosystem uses the concept of steganography and is computationally light and secure. The secret-key is generated in such a way that Avalanche effect is ensured except in very rare cases. The proposed data embedding method is shown to be robust and highly secure while maintaining good hiding capacity and imperceptibility. It is applicable for data hiding in a generic grid that could be of pixels or bits.     

Issues and solution on distortion drift in reversible video data hiding

Different from reversible image data hiding, most reversible video data hiding schemes have the particular problem that the distortion due to hidden data will spread and accumulate. In this paper, the problem of distortion drift caused by reversible data hiding in compressed video is analyzed, and a lossless drift compensation scheme is proposed to restrain the distortion for the first time. In order to ensure the reversibility, drift compensation signals are merged in the quantized DCT (Discrete Cosine Transform) coefficients of P-frames and the corresponding recovery mechanism is presented as well. Experimental results demonstrate that the proposed lossless drift compensation scheme significantly improves the video quality, and the original compressed video can be recovered exactly after the hidden data and compensation signals are removed. In addition, the proposed scheme does not depend on specific reversible data hiding method.     

Efficient and secure BIG data delivery in Cloud Computing

Multimedia Tools and Applications - Big Data (BD) is a new technology which rapidly growing in the telecommunications sectors, especially in the contemporary field of wireless telecommunications....     

Reversible data hiding in dual Stegano-image using an improved center folding strategy

Multimedia Tools and Applications - In recent years, the dual stego-image reversible data embedding methods have been developed rapidly, e.g., exploiting modification direction, magic matrix, least...     

A novel approach for dual layer security of message using Steganography and Cryptography

Multimedia Tools and Applications - It is well known that the world is becoming more interconnected with the help of World Wide Web in distributed environment. Persons and Organizations want to...     

Reversible data hiding in compressed and encrypted images by using Kd-tree

In this paper, a joint scheme and a separable scheme for reversible data hiding (RDH) in compressed and encrypted images by reserving room through Kd-tree were proposed. Firstly, the plain cover image was losslessly compressed and encrypted with lifting based integer wavelet transform (IWT) and set partition in hierarchical tree (SPIHT) encoding. Then, several shift operations were performed on the generated SPIHT bit-stream. The shifted bit-stream was restructured into small chunks and packed in the form of a large square matrix. The binary square matrix was exposed to Kd-tree with random permutations and reserving uniform areas of ones and zeros for secret data hiding. After that, a joint or a separable RDH scheme can be performed in these reserved spaces. In the joint RDH scheme, the secret data were embedded in the reserved spaces before encrypting with multiple chaotic maps. Thus, secret data extraction and cover image recovery were achieved together. In the separable RDH scheme, the secret data were embedded in the reserved spaces after encrypting with multiple chaotic maps. Since message extraction and cover image recovery are performed separately, anyone who has the embedding key can extract the secret message from the marked encrypted copy, while cannot recover the cover image. A complete encoding and decoding procedure of RDH for compressed and encrypted images was elaborated. The imperceptibility analysis showed that the proposed methods bring no distortion to the cover image because there was no change to the original cover image. The experimental results showed that the proposed schemes can perform better for secret data extraction and can restore the original image with 100% reversibility with much more embedding capacity and security. The proposed schemes significantly outperform the state-of-the-art RDH methods in the literature on compressed and encrypted images.

     

Web开发中高效安全的数据持久层研究

本文阐述了企业数据的重要性,分析了当前流行的持久层解决方案的优缺点,并给出了基于XML的设计模式,建立一个高性能、高安全性、有弹性、可拓展性的数据持久层的方法.同时用一个信息查询的完整业务流程解释了持久性框架的主要设计思想.     

Energy-efficient and secure in-network storage and retrieval for WSNs: an adaptive approach

Storage and retrieval of data in Wireless Sensor Networks (WSNs) have been found to be challenging issues in recent studies. The two principal approaches used in almost all proposed schemes in this field are Centralized and Decentralized. Many investigations have considered the security and communication issues in centralized schemes where a central node exists as the sink and all collected data are sent to it to be processed or the central node provides access to the possible users. In decentralized systems, all nodes are equally responsible for the duties of the central node in centralized approaches. In cases where sensors cannot transmit data immediately, which is usually the case in distributed approaches, in-network storage and retrieval is an alternative with its own security and communication issues stemming from the properties of energy sensitive sensors. In this paper, a semi-centralized scheme is introduced that is based on a number of traditional techniques, namely, clustering, symmetric and asymmetric key-management, and threshold secret sharing. The proposed scheme provides an energy-efficient and secure in-network storage and retrieval that could be applied to WSNs. A predictive method is proposed to adaptively determine the proper parameters for the threshold secret sharing technique. Confidentiality, dependability, and integrity of the sensed data are enhanced in a distributed manner with fairly low communication and computation costs. Simulations were utilized to illustrate the effect of several network parameters on energy consumption and to come up with optimization recommendations for the parameters of the proposed secret sharing scheme.     

StreamTune: dynamic resource scheduling approach for workload skew in video data center

Video surveillance applications need video data center to provide elastic virtual machine (VM) provisioning. However, the workloads of the VMs are hardly to be predicted for online video surveillance service. The unknown arrival workloads easily lead to workload skew among VMs. In this paper, we study how to balance the workload skew on online video surveillance system. First, we design the system framework for online surveillance service which consists of video capturing and analysis tasks. Second, we propose StreamTune, an online resource scheduling approach for workload balancing, to deal with irregular video analysis workload with the minimum number of VMs. We aim at timely balancing the workload skew on video analyzers without depending on any workload prediction method. Furthermore, we evaluate the performance of the proposed approach using a traffic surveillance application. The experimental results show that our approach is well adaptive to the variation of workload and achieves workload balance with less VMs.     

Embedding electronic patient information in clinical images: an improved and efficient reversible data hiding technique

Multimedia Tools and Applications - Reversible Data Hiding (RDH) is one of the popular and highly recommended methods to enhance medical data security or Electronic Patient Record (EPR) privacy. In...     

ESKI-IBE: Efficient and secure key issuing identity-based encryption with cloud privacy centers

Multimedia Tools and Applications - Digital certificate validation associated with traditional public key cryptosystems make it impractical in real-world environments due to their storage cost. The...     

An efficient reversible data hiding with reduplicated exploiting modification direction using image interpolation and edge detection

Multimedia Tools and Applications - Data hiding is a technique that embeds a cluster of secret messages into the original image. The image with secret messages can be distributed on the Internet...     

High capacity reversible and secured data hiding in images using interpolation and difference expansion technique

Multimedia Tools and Applications - Data hiding is a noteworthy research topic in digital technology for years. Reversible data hiding (RDH) technique plays a vital role for confirming security of...     

EDGES: Efficient data gathering in sensor networks using temporal and spatial correlations

In this paper, we present an approximate data gathering technique, called EDGES, for sensor networks that utilizes temporal and spatial correlations. The goal of EDGES is to efficiently obtain the sensor reading within a certain error bound. To do this, EDGES utilizes the multiple model Kalman filter, which is for the non-linear data distribution, as an approximation approach. The use of the Kalman filter allows EDGES to predict the future value using a single previous sensor reading in contrast to the other statistical models such as the linear regression and multivariate Gaussian. In order to extend the lifetime of networks, EDGES utilizes the spatial correlation. In EDGES, we group spatially close sensors as a cluster. Since a cluster header in a network acts as a sensor and router, a cluster header wastes its energy severely to send its own reading and/or data coming from its children. Thus, we devise a redistribution method which distributes the energy consumption of a cluster header using the spatial correlation. In some previous works, the fixed routing topology is used or the roles of nodes are decided at the base station and this information propagates through the whole network. But, in EDGES, the change of a cluster is notified to a small portion of the network. Our experimental results over randomly generated sensor networks with synthetic and real data sets demonstrate the efficiency of EDGES.