Randomized Block Size (RBS) Model for Secure Data Storage in Distributed Server

• Keshav Sinha,
• Partha Paul,
• Amritanjali,

Vol. 15, No. 12, December 31, 2021
10.3837/tiis.2021.12.014, Download Paper (Free):

• Distributed Storage Server (DSS)
• Key Management Server (KMS)
• Chinese Reminder Theorem (CRT)
• Key Generation Phase (KGP)
• Rand Generation Phase (RGP)

Abstract

Today distributed data storage service are being widely used. However lack of proper means of security makes the user data vulnerable. In this work, we propose a Randomized Block Size (RBS) model for secure data storage in distributed environments. The model work with multifold block sizes encrypted with the Chinese Remainder Theorem-based RSA (C-RSA) technique for end-to-end security of multimedia data. The proposed RBS model has a key generation phase (KGP) for constructing asymmetric keys, and a rand generation phase (RGP) for applying optimal asymmetric encryption padding (OAEP) to the original message. The experimental results obtained with text and image files show that the post encryption file size is not much affected, and data is efficiently encrypted while storing at the distributed storage server (DSS). The parameters such as ciphertext size, encryption time, and throughput have been considered for performance evaluation, whereas statistical analysis like similarity measurement, correlation coefficient, histogram, and entropy analysis uses to check image pixels deviation. The number of pixels change rate (NPCR) and unified averaged changed intensity (UACI) were used to check the strength of the proposed encryption technique. The proposed model is robust with high resilience against eavesdropping, insider attack, and chosen-plaintext attack.

Statistics

Cite this article