Full Text

Turn on search term navigation

© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.

Abstract

Authentication, authorization, and data access control are playing major roles in data security and privacy. The proposed model integrated the multi-factor authentication–authorization process with dependable and non-dependable factors and parameters based on providing security for tenants through a hybrid approach of fully homomorphic encryption methodology: the enhanced homomorphic cryptosystem (EHC) and the Brakersky–Gentry–Vaikuntanathan (BGV) scheme. This research was composed of four major elements: the fully homomorphic encryption blended schemes, EHC and BGV; secure token and key implications based on dependable and don-dependable factors; an algorithm for generating the tokens and the suitable keys, depending on the user’s role; and the execution of experimental test cases by using the EHC algorithm for key and token generation, based on dependable and non-dependable parameters and time periods. The proposed approach was tested with 152 end-users by integrating six multi-tenants, five head tenants, and two enterprise levels; and achieved a 92 percent success rate. The research integrated 32-bit plain text in the proposed hybrid approach by taking into consideration the encryption time, decryption time, and key generation time of data transmission via cloud servers. The proposed blended model was efficient in preventing data from ciphertext attacks and achieved a high success rate for transmitting data between the multi-tenants, based on the user-role-user type of enterprise cloud servers.

Details

Title
Secure Token–Key Implications in an Enterprise Multi-Tenancy Environment Using BGV–EHC Hybrid Homomorphic Encryption
Author
Dhiman, Pooja 1   VIAFID ORCID Logo  ; Henge, Santosh Kumar 1   VIAFID ORCID Logo  ; Rajakumar Ramalingam 2   VIAFID ORCID Logo  ; Dumka, Ankur 3 ; Singh, Rajesh 4 ; Gehlot, Anita 4 ; Rashid, Mamoon 5   VIAFID ORCID Logo  ; Alshamrani, Sultan S 6   VIAFID ORCID Logo  ; Ahmed Saeed AlGhamdi 7   VIAFID ORCID Logo  ; Alshehri, Abdullah 8   VIAFID ORCID Logo 

 School of Computer Applications, Lovely Professional University, Phagwara 144402, India; [email protected] (P.D.); [email protected] (S.K.H.) 
 Department of Computer Science and Technology, Madanapalle Institute of Technology & Science, Madanapalle 517325, India; [email protected] 
 Department of Computer Science and Engineering, Women Institute of Technology, Dehradun 248007, India; [email protected]; Department of Computer Science and Engineering, Graphic Era Deemed to be University, Dehradun 248001, India 
 Uttaranchal Institute of Technology, Uttaranchal University, Dehradun 248007, India; [email protected] (R.S.); [email protected] (A.G.) 
 Department of Computer Engineering, Faculty of Science and Technology, Vishwakarma University, Pune 411048, India 
 Department of Information Technology, College of Computer and Information Technology, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia; [email protected] 
 Department of Computer Engineering, College of Computer and Information Technology, Taif University, P.O. Box 11099, Taif 21994, Saudi Arabia; [email protected] 
 Department of Information Technology, Al Baha University, P.O. Box 1988, Al Baha 65731, Saudi Arabia; [email protected] 
First page
1942
Publication year
2022
Publication date
2022
Publisher
MDPI AG
e-ISSN
20799292
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2686184027
Copyright
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.