Securing Cloud Identity Information Under Key Introduction

M. Geetha Priya., V. Kavitha
{"title":"Securing Cloud Identity Information Under Key Introduction","authors":"M. Geetha Priya., V. Kavitha","doi":"10.1109/ICCCI56745.2023.10128194","DOIUrl":null,"url":null,"abstract":"A fine-grained question authorization scheme with integrity verification is proposed primarily based totally on Density primarily based totally Space-filling Curve (DSC). The proposed scheme extricates the appropriation of the re- appropriated POIs, and makes use of the non-uniform parcel withinside the spatial area. Each divided district includes curve obstacles for spatial extrade in that locale, and the parceled districts with a comparable length scale are consolidated. Then, the curve obstacles of those mixed locales are refreshed primarily based totally at the obstacles in their sub districts. These curve obstacles are indicated because the extrade keys evaluating to those consolidated areas. The extrade keys are coordinated in a quad tree shape, and tree hubs at diverse ranges examine to distinct spatial locales, which empowers the fine-grained question cap potential authorization. Moreover, the proposed scheme creates digests facts for every parceled vicinity, which can be then coordinated in a quadtree shape for question end result verification. Tree hubs at diverse ranges examine to diverse spatial districts, and the pertaining to digests are applied for question end result verification. Subsequently, the fine-grained verification potential authorization is upheld, which suggests simply the customers with the verification shape referring to the authorised vicinity can verify the integrity of the question end result.","PeriodicalId":205683,"journal":{"name":"2023 International Conference on Computer Communication and Informatics (ICCCI)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Computer Communication and Informatics (ICCCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCI56745.2023.10128194","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A fine-grained question authorization scheme with integrity verification is proposed primarily based totally on Density primarily based totally Space-filling Curve (DSC). The proposed scheme extricates the appropriation of the re- appropriated POIs, and makes use of the non-uniform parcel withinside the spatial area. Each divided district includes curve obstacles for spatial extrade in that locale, and the parceled districts with a comparable length scale are consolidated. Then, the curve obstacles of those mixed locales are refreshed primarily based totally at the obstacles in their sub districts. These curve obstacles are indicated because the extrade keys evaluating to those consolidated areas. The extrade keys are coordinated in a quad tree shape, and tree hubs at diverse ranges examine to distinct spatial locales, which empowers the fine-grained question cap potential authorization. Moreover, the proposed scheme creates digests facts for every parceled vicinity, which can be then coordinated in a quadtree shape for question end result verification. Tree hubs at diverse ranges examine to diverse spatial districts, and the pertaining to digests are applied for question end result verification. Subsequently, the fine-grained verification potential authorization is upheld, which suggests simply the customers with the verification shape referring to the authorised vicinity can verify the integrity of the question end result.
在密钥介绍下保护云身份信息
提出了一种基于全密度全空间填充曲线(DSC)的细粒度问题完整性验证方案。该方案解决了重新占用的指标点的占用问题,并利用了空间区域内的不均匀包裹。每个划分的区域都包含了该区域空间扩展的曲线障碍,并且具有可比长度尺度的分区被整合。然后,对混合区域的曲线障碍物进行刷新,主要基于其子区域的障碍物。之所以指出这些曲线障碍,是因为对这些固结区域进行了额外的关键评价。额外的密钥以四边形树形协调,不同范围的树形中心检查不同的空间区域,从而支持细粒度的问题帽潜在授权。此外,提出的方案为每个分组附近创建摘要事实,然后可以在四叉树形状中协调问题最终结果验证。不同范围的树中心检查不同的空间区域,并应用相关的摘要进行问题最终结果验证。随后,支持细粒度验证潜在授权,这表明仅具有引用授权附近的验证形状的客户可以验证问题最终结果的完整性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信