Orchini Similarity User Authentication Based Streebog Hash Function for Secured Data Storage in Cloud

Bebe, P. Calista and Akila, D. (2019) Orchini Similarity User Authentication Based Streebog Hash Function for Secured Data Storage in Cloud. In: 2019 International Conference on Computational Intelligence and Knowledge Economy (ICCIKE), Dubai, United Arab Emirates.

Full text not available from this repository. (Request a copy)

Abstract

Cloud provides a flexible on-demand data outsourcing services for the individuals and organizations to store their data in the server. Security of cloud storage is guaranteed through providing data confidentiality. The cloud computing provides several benefits but the major risk to provide security to the user's data since the cloud infrastructures vulnerable to various threats. In order to improve the secure cloud storage, an Orchini Similarity Authentication based Streebog Hashing Secured Data Storage (OSA-SHSDS) mechanism is introduced. The main aim of OSA-SHSDS mechanism is to store the cloud user data with higher confidentiality rate and lesser space complexity. In order to store the data in the cloud server, the cloud user personal details are to be registered. After registering, the cloud server generates the ID and password for every registered cloud user. Whenever the user wants to store the data, the user has to login with ID and password to the cloud server for authentication. The cloud server verifies whether the user has authenticated the user or not through orchini similarity measure. After authentication, the cloud user is allowed to store the data in the cloud server.. This helps to increase the data confidentiality rate and to minimize the space complexity. The experimental evaluation of OSA-SHSDS mechanism and existing methods are performed using Amazon dataset with the metrics such as authentication accuracy, computation time, data confidentiality rate and space complexity. The observed results reveal that the proposed OSA-SHSDS mechanism attains higher authentication accuracy and data confidentiality with minimum computation time as well as space complexity than the other state -the- art- methods.

Item Type: Conference or Workshop Item (Paper)
Subjects: Computer Science > Database Management System
Domains: Computer Science
Depositing User: Mr IR Admin
Date Deposited: 28 Aug 2025 06:19
Last Modified: 28 Aug 2025 06:19
URI: https://ir.vistas.ac.in/id/eprint/10645

Actions (login required)

View Item
View Item