Dynamic Graph Based Encryption Scheme for Cloud Based Services and Storage

AbstractThe security of digital content during transmission and storage through insecure communication links and databases is a challenging issue in today's world. In this article, an encryption scheme based on fractal Tromino and Chebyshev polynomial-based generated chaotic matrix is presented. The scheme fulfills the most fundamental aspect of encryption that is diffusion and confusion. For confusion highly non-linear, pre-defined S-boxes are used. The proposed scheme has been tested using state-of-the-art key performance indicators including differential analysis, statistical analysis. Information entropy analysis, mean square error, and NIST-based randomness analysis. The encrypted images have the highest practically achievable entropy of 7.999 and the time analysis shows that the proposed system is suitable for real-time implementation. The rest of the results indicates that the proposed cryptosystem possesses high immunity toward various attacks. The security analysis compared with the existing scheme shows the strength of the suggested scheme.

Download Full-text

A Novel Chaos-Based Color Image Encryption Scheme Using Bit-Level Permutation

Symmetry ◽

10.3390/sym12091497 ◽

2020 ◽

Vol 12 (9) ◽

pp. 1497 ◽

Cited By ~ 1

Author(s):

Zhen Li ◽

Changgen Peng ◽

Weijie Tan ◽

Liangrong Li

Keyword(s):

Image Encryption ◽

Color Image ◽

Encryption Scheme ◽

Cyclic Shift ◽

Color Image Encryption ◽

Differential Attack ◽

Speed Advantage ◽

Plain Image ◽

And Storage ◽

Color Components

To ensure the security of digital images during transmission and storage, an efficient and secure chaos-based color image encryption scheme using bit-level permutation is proposed. Our proposed image encryption algorithm belongs to symmetric cryptography. Here, we process three color components simultaneously instead of individually, and consider the correlation between them. We propose a novel bit-level permutation algorithm that contains three parts: a plain-image related rows and columns substitution, a pixel-level roll shift part, and a bit-level cyclic shift part. In the plain-related rows and columns substitution part, we involve the plain-image information to generate a control sequence by using a skew tent system. This process ensures that the correlation between three color components can be totally broken, and our cryptosystem has enough plain-image sensitivity to resist the differential attack. In the pixel-level roll shift part and bit-level cyclic shift part, we have a fully bit-level permutation controlled by two sequences using a Rucklidge system. The simulation and some common security analyses are given. Test results show that our proposed scheme has good security performance and a speed advantage compared to other works.

Download Full-text

Modelling and Interpreting Network Dynamics

10.1101/124016 ◽

2017 ◽

Cited By ~ 8

Author(s):

Ankit N. Khambhati ◽

Ann E. Sizemore ◽

Richard F. Betzel ◽

Danielle S. Bassett

Keyword(s):

Computational Models ◽

Method Development ◽

Imaging Techniques ◽

Statistical Testing ◽

High Temporal Resolution ◽

Dynamic Graph ◽

Recent Advances ◽

Dynamic Patterns ◽

And Storage ◽

Interconnected Structure

Recent advances in brain imaging techniques, measurement approaches, and storage capacities have provided an unprecedented supply of high temporal resolution neural data. These data present a remarkable opportunity to gain a mechanistic understanding not just of circuit structure, but also of circuit dynamics, and its role in cognition and disease. Such understanding necessitates a description of the raw observations, and a delineation of computational models and mathematical theories that accurately capture fundamental principles behind the observations. Here we review recent advances in a range of modeling approaches that embrace the temporally-evolving interconnected structure of the brain and summarize that structure in a dynamic graph. We describe recent efforts to model dynamic patterns of connectivity, dynamic patterns of activity, and patterns of activity atop connectivity. In the context of these models, we review important considerations in statistical testing, including parametric and non-parametric approaches. Finally, we offer thoughts on careful and accurate interpretation of dynamic graph architecture, and outline important future directions for method development.

Download Full-text

LBS Hybrid Encryption Scheme Based on IMSI Pseudonym

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.659.174 ◽

2013 ◽

Vol 659 ◽

pp. 174-180

Author(s):

Lei Li ◽

Ang Chen ◽

Jing Chen ◽

Zhi Hong Zhang

Keyword(s):

Encryption Scheme ◽

Security Model ◽

Storage Process ◽

Security Risks ◽

The Public ◽

Hybrid Encryption ◽

Identity Information ◽

Unique Identity ◽

Symmetric Key ◽

And Storage

A hybrid encryption scheme based on the IMSI pseudonym is proposed in this paper. The security model of the scheme is deployed in a cloud environment, and the IMSI pseudonym as a unique identity of a user in the transmission and storage process, which marks and identifies the user, to ensure the privacy of his identity information. Hybrid encryption scheme between communicating parties can be achieved by combining the public-private key pairs updated frequently and symmetric key related to the user identity information, which fully considers the privacy information on security of storage and wireless network transmission and effectively alleviates the current LBS security risks.

Download Full-text

Privacy-Preserving Multi-Receiver Certificateless Broadcast Encryption Scheme with De-Duplication

Sensors ◽

10.3390/s19153370 ◽

2019 ◽

Vol 19 (15) ◽

pp. 3370 ◽

Cited By ~ 1

Author(s):

Jianhong Zhang ◽

Peirong Ou

Keyword(s):

High Performance ◽

Privacy Preserving ◽

Broadcast Encryption ◽

Encryption Scheme ◽

Key Escrow ◽

Plain Text ◽

Security Models ◽

Duplication Detection ◽

And Storage ◽

Chosen Ciphertext Attack

Nowadays, the widely deployed and high performance Internet of Things (IoT) facilitates the communication between its terminal nodes. To enhance data sharing among terminal devices and ensure the recipients’ privacy protection, a few anonymous multi-recipient broadcast encryption (AMBE) proposals are recently given. Nevertheless, the majority of these AMBE proposals are only proven be securely against adaptively chosen plain-text attack (CPA) or selectively chosen ciphertext attack (CCA). Furthermore, all AMBE proposals are subjected to key escrow issue due to inherent characteristics of the ID-based public cryptography (ID-PKC), and cannot furnish secure de-duplication detection. However, for cloud storage, it is very important for expurgating duplicate copies of the identical message since de-duplication can save the bandwidth of network and storage space. To address the above problems, in the work, we present a privacy-preserving multi-receiver certificateless broadcast encryption scheme with de-duplication (PMCBED) in the cloud-computing setting based on certificateless cryptography and anonymous broadcast encryption. In comparison with the prior AMBE proposals, our scheme has the following three characteristics. First, it can fulfill semantic security notions of data-confidentiality and receiver identity anonymity, whereas the existing proposals only accomplish them by formalizing the weaker security models. Second, it achieves duplication detection of the ciphertext for the identical message encrypted with our broadcast encryption. Finally, it also avoids the key escrow problem of the AMBE schemes.

Download Full-text

An Overview of Digital Image Processing and Recognition (Invited Paper)

Proceedings, annual meeting, Electron Microscopy Society of America ◽

10.1017/s0424820100055837 ◽

1982 ◽

Vol 40 ◽

pp. 700-702

Author(s):

R. C. Gonzalez

Keyword(s):

Image Processing ◽

New York ◽

Digital Image Processing ◽

Digital Image ◽

Practical Implementation ◽

Submarine Cable ◽

Vigorous Growth ◽

Digitized Pictures ◽

Processing Techniques ◽

And Storage

Interest in digital image processing techniques dates back to the early 1920's, when digitized pictures of world news events were first transmitted by submarine cable between New York and London. Applications of digital image processing concepts, however, did not become widespread until the middle 1960's, when third-generation digital computers began to offer the speed and storage capabilities required for practical implementation of image processing algorithms. Since then, this area has experienced vigorous growth, having been a subject of interdisciplinary research in fields ranging from engineering and computer science to biology, chemistry, and medicine.

Download Full-text

Control of Secretory Production in the Isopod Hepatopancreas

Proceedings, annual meeting, Electron Microscopy Society of America ◽

10.1017/s0424820100094085 ◽

1972 ◽

Vol 30 ◽

pp. 166-167

Author(s):

John W. Roberts ◽

E. R. Witkus

Keyword(s):

B Cells ◽

Morphological Data ◽

Secretory Product ◽

Secretory Function ◽

Secretory Material ◽

Blind Ending ◽

Secretory Production ◽

Regenerative Cells ◽

Immature Cells ◽

And Storage

The isopod hepatopancreas, as exemplified by Oniscus ascellus. is comprised of four blind-ending diverticula. The regenerative cells at the tip of each diverticula differentiate into either club-shaped B-cells, which serve a secretory function, or into conoid S-cells, which serve in the absorption and storage of nutrients.The glandular B-cells begin producing secretory material with the development of rough endoplasmic reticulum during their process of maturation from the undifferentiated regenerative cells. Cytochemical and morphological data indicate that the hepatopancreas sequentially produces two types of secretory material within the large club-shaped cells. The production of the carbohydrate-like secretory product in immature cells seems to be phased out as the production of the osmiophilic secretion was phased in as the cell matured.

Download Full-text

Quantitative Analysis Of X-Ray Images From Geological Materials

Proceedings, annual meeting, Electron Microscopy Society of America ◽

10.1017/s042482010013482x ◽

1990 ◽

Vol 48 (2) ◽

pp. 244-245

Author(s):

J. M. Paque ◽

R. Browning ◽

P. L. King ◽

P. Pianetta

Keyword(s):

Quantitative Analysis ◽

Bulk Composition ◽

Principal Component ◽

Analytical Description ◽

Bulk Sample ◽

Geological Samples ◽

X Ray ◽

Software And Hardware ◽

And Storage ◽

Insight Into

Geological samples typically contain many minerals (phases) with multiple element compositions. A complete analytical description should give the number of phases present, the volume occupied by each phase in the bulk sample, the average and range of composition of each phase, and the bulk composition of the sample. A practical approach to providing such a complete description is from quantitative analysis of multi-elemental x-ray images.With the advances in recent years in the speed and storage capabilities of laboratory computers, large quantities of data can be efficiently manipulated. Commercial software and hardware presently available allow simultaneous collection of multiple x-ray images from a sample (up to 16 for the Kevex Delta system). Thus, high resolution x-ray images of the majority of the detectable elements in a sample can be collected. The use of statistical techniques, including principal component analysis (PCA), can provide insight into mineral phase composition and the distribution of minerals within a sample.

Download Full-text