Verifiable data distribution technique for multiple applicants in a cloud computing ecosystem

Jayalakshmi Karemallaiah, Prabha Revaiah
{"title":"Verifiable data distribution technique for multiple applicants in a cloud computing ecosystem","authors":"Jayalakshmi Karemallaiah, Prabha Revaiah","doi":"10.11591/ijai.v13.i2.pp1241-1249","DOIUrl":null,"url":null,"abstract":"Cloud computing is the most exploited research technology in both industry and academia due to wide application and increases in adoption from global organizations. In cloud, computing data storage is one of the primary resources offered through cloud computing, however, an increase in participants raises major security concerns, as the user has no hold over the data. Furthermore, recent research has shown great potential for efficient data sharing with multiple participants. Existing researches suggest complicated and inefficient cloud security architecture. Hence, this research work proposes identifiable data sharing for multiple users (IDSMU) mechanism, which aims to provide security for multiple users in a particular cloud group. A novel signature scheme is used for identifying the participants, further verification of the Novel Signature Scheme is proposed along with a retraction process where the secret keys of the participant and the sender is cross-verified; at last, a module is designed for the elimination of any malicious participants within the group. IDSMU is evaluated on computation count and efficiency is proved by comparing with an existing model considering computation count. IDSMU performs marginal improvisation over the existing model in comparison with the existing model using the novel signature scheme. ","PeriodicalId":507934,"journal":{"name":"IAES International Journal of Artificial Intelligence (IJ-AI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IAES International Journal of Artificial Intelligence (IJ-AI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11591/ijai.v13.i2.pp1241-1249","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Cloud computing is the most exploited research technology in both industry and academia due to wide application and increases in adoption from global organizations. In cloud, computing data storage is one of the primary resources offered through cloud computing, however, an increase in participants raises major security concerns, as the user has no hold over the data. Furthermore, recent research has shown great potential for efficient data sharing with multiple participants. Existing researches suggest complicated and inefficient cloud security architecture. Hence, this research work proposes identifiable data sharing for multiple users (IDSMU) mechanism, which aims to provide security for multiple users in a particular cloud group. A novel signature scheme is used for identifying the participants, further verification of the Novel Signature Scheme is proposed along with a retraction process where the secret keys of the participant and the sender is cross-verified; at last, a module is designed for the elimination of any malicious participants within the group. IDSMU is evaluated on computation count and efficiency is proved by comparing with an existing model considering computation count. IDSMU performs marginal improvisation over the existing model in comparison with the existing model using the novel signature scheme. 
云计算生态系统中多个申请人的可验证数据分发技术
由于云计算的广泛应用和全球组织采用云计算的增加,云计算成为工业界和学术界利用率最高的研究技术。在云计算中,计算数据存储是云计算提供的主要资源之一,然而,参与者的增加引发了重大的安全问题,因为用户无法掌控数据。此外,最近的研究表明,与多个参与者高效共享数据具有巨大潜力。现有研究表明,云安全架构复杂且效率低下。因此,本研究工作提出了多用户可识别数据共享(IDSMU)机制,旨在为特定云组中的多用户提供安全保障。该机制采用一种新颖的签名方案来识别参与者,并提出了新颖签名方案的进一步验证以及参与者和发送者密钥交叉验证的撤回流程;最后,还设计了一个模块来消除组内的任何恶意参与者。IDSMU 根据计算量进行了评估,并通过与考虑计算量的现有模型进行比较,证明了其效率。与使用新型签名方案的现有模型相比,IDSMU 在改进方面略胜一筹。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信