A Secure and Efficient Digital-Data-Sharing System for Cloud Environments

Abstract
“Education Cloud” is a cloud-computing application used in educational contexts
to facilitate the use of comprehensive digital technologies and establish data-based
learning environments. The immense amount of digital resources, data, and teaching
materials involved in these environments must be stored in robust data-access systems.
These systems must be equipped with effective security mechanisms to guarantee
confidentiality and ensure the integrity of the cloud-computing environment.

To minimize the potential risk of privacy exposure, digital sharing service

providers must encrypt their digital resources, data, and teaching materials, and digital-
resource owners must have complete control over what data or materials they share. In
addition, the data in these systems must be accessible to e-learners. In other words, data-
access systems should not only encrypt data, but also provide access control mechanisms
by which users may access the data. In cloud environments, digital sharing systems no
longer target single users, and the access control by numerous users may overload a
system and increase management burden and complexity.

This study addressed these challenges to create a system that preserves the benefits
of combining digital sharing systems and cloud computing. A cloud-based and learner-
centered access control mechanism suitable for multi-user digital sharing was developed.
The proposed mechanism resolves the problems concerning multi-user access requests in
cloud environments and dynamic updating in digital-sharing systems, thereby reducing
the complexity of security management.

Front –end – [Link]

Back-end – My SQL Submitted By

 An Efficient Ranked Multi-Keyword Search for Multiple Data Owners
Over Encrypted Cloud Data

Abstract
With the development of cloud storage, more data owners are inclined to
outsource their data to cloud services. For privacy concerns, sensitive data should be
encrypted before outsourcing. There are various searchable encryption schemes to ensure
data availability. However, the existing search schemes pay little attention to the
efficiency of data users' queries, especially for the multi-owner scenario. In this paper, we
proposed a tree-based ranked multi-keyword search scheme for multiple data owners.
Specifically, by considering a large amount of data in the cloud, we utilize the TF × IDF
model to develop a multi keyword search and return the top-k ranked search results.

To enable the cloud servers to perform a secure search without knowing any
sensitive data (e.g., keywords and trapdoors), we construct a novel privacy preserving
search protocol based on the bilinear mapping. To achieve an efficient search, for each
data owner, a tree-based index encrypted with an additive order and privacy-preserving
function family is constructed. The cloud server can then merge these indexes effectively,
using the depth-first search algorithm to find the corresponding files. Finally, the rigorous
security analysis proves that our scheme is secure, and the performance analysis
demonstrates its efficacy and efficiency.

Front –end – [Link]

Back-end – My SQL Submitted By

 Secure Reversible Image Data Hiding over Encrypted Domain via Key
Modulation

Abstract
This work proposes a novel Reversible Image Data Hiding (RIDH) scheme over
encrypted domain. The data embedding is achieved through a public key modulation
mechanism, in which access to the secret encryption key is not needed. Support Vector
Machine (SVM) has been widely used in machine learning for data classification. It has
high generalization ability which provides high reliability in real-world applications such
as image processing, computer vision, text mining, natural language processing, bio-
informatics and many more.

A digital watermark is a kind of marker covertly embedded in a noise-tolerant

signal such as an audio, video or image data. It is typically used to identify ownership of
the copyright of such signal. "Watermarking" is the process of hiding digital information
in a carrier signal; the hidden information should, but does not need to, contain a relation
to the carrier signal. Digital watermarks may be used to verify the authenticity or
integrity of the signal or to show the identity of its owners. At the decoder side, a
powerful two-class SVM classifier is designed to distinguish encrypted and non-
encrypted image patches, allowing us to jointly decode the embedded message and the
original image signal. Compared with the state of-the-arts, the proposed approach
provides higher embedding capacity, and is able to perfectly reconstruct the original
image as well as the embedded message. Extensive experimental results are provided to
validate the superior performance of our scheme.

Front –end – [Link]

Back-end – My SQL Submitted By

 Steganography Using Reversible Texture Synthesis

Abstract
We propose a novel approach for Steganography using a reversible texture
synthesis. A texture synthesis process Resample a smaller texture image, which
synthesizes a new texture image with a similar local appearance and an arbitrary size. We
weave the texture synthesis process into Steganography to conceal secret messages. In
contrast to using an existing cover image to hide messages, our algorithm conceals the
source texture image and embeds secret messages through the process of texture
synthesis. This allows us to extract the secret messages and source texture from a stego
synthetic texture.

Our approach offers three distinct advantages. First, our scheme offers the
embedding capacity that is proportional to the size of the stego texture image. Second, a
steganalytic algorithm is not likely to defeat our Steganography approach. Third, the
reversible capability inherited from our scheme provides functionality, which allows
recovery of the source texture. Experimental results have verified that our proposed
algorithm can provide various numbers of embedding capacities, produce a visually
plausible texture images, and recover the source texture.

Front –end – [Link]

Back-end – My SQL Submitted By

 A Secure and Efficient Data Sharing and Searching Scheme in Wireless
Sensor Networks

Abstract
Wireless sensor networks (WSN) generally utilize cloud computing to store and
process sensing data in real time, namely, cloud-assisted WSN. However, the cloud-
assisted WSN faces new security challenges, particularly outsourced data confidentiality.
Data Encryption is a fundamental approach but it limits target data retrieval in massive
encrypted data.

Public key encryption with keyword search (PEKS) enables a data receiver to
retrieve encrypted data containing some specific keyword in cloud-assisted WSN.
However, the traditional PEKS schemes suffer from an inherent problem, namely, the
keyword guessing attack (KGA). KGA includes off-line KGA and on-line KGA. To date,
the existing literature on PEKS cannot simultaneously resist both off-line KGA and on-
line KGA performed by an external adversary and an internal adversary. In this work, we
propose a secure and efficient data sharing and searching scheme to address the
aforementioned problem such that our scheme is secure against both off-line KGA and
on-line KGA performed by external and internal adversaries.

We would like to stress that our scheme simultaneously achieves document

encryption/decryption and keyword search functions. We also prove our scheme achieves
keyword security and document security. Furthermore, our scheme is more efficient than
previous schemes by eliminating the pairing computation.

Front –end – [Link]

Back-end – My SQL Submitted By

 New Framework of Reversible Data Hiding in Encrypted JPEG Bit
Streams

Abstract
This paper proposes a novel framework of reversible data hiding in encrypted
JPEG bit stream. We first provide a JPEG encryption algorithm to encipher a JPEG
image to a smaller size and keep the format compliant to JPEG decoders. After an image
owner uploads the encrypted JPEG bit streams to cloud storage, the server embeds
additional messages into the cipher text to construct a marked encrypted JPEG bit stream.
During data hiding, we propose a combined embedding algorithm including two stages,
the Huffman code mapping and the ordered histogram shifting. The embedding procedure
is reversible.

When an authorized user requires a downloading operation, the server extracts

additional messages from the marked encrypted JPEG bit stream and recovers the
original encrypted bit-stream losslessly. After downloading, the user obtains the original
JPEG bit stream by a direct decryption. The proposed framework out-performs previous
works on RDH-EI. First, since the tasks of data embedding/extraction and bit stream
recovery are all accomplished by the server, the image owner and the authorized user are
required to implement no extra operations except JPEG encryption or decryption.
Second, the embedding payload is larger than state-of-the-art works.

Front –end – [Link]

Back-end – My SQL Submitted By