检索结果-南通市图书馆

Verifiable searchable symmetric encryption for conjunctive keyword queries in cloud storage

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2022年第6期16卷 103-121页

作者： Qingqing GAN Joseph K.LIU Xiaoming WANG Xingliang YUAN Shi-Feng SUN Daxin HUANG Cong ZUO Jianfeng WANG Guangzhou Key Laboratory of Multilingual Intelligent Processing School of Information Science and Technology/School of Cyber SecurityGuangdong University of Foreign StudiesGuangzhou510006China Department of Computer Science Jinan UniversityGuangzhou510632China Faculty of Information Technology Monash UniversityClayton3168Australia State Key Laboratory of Integrated Service Networks(ISN) Xidian UniversityXi’an710071China

Searchable symmetric encryption(SSE)has been introduced for secure outsourcing the encrypted database to cloud storage,while maintaining searchable features.Of various SSE schemes,most of them assume the server is honest but curious,while the server may be trustless in the real world.Considering a malicious server not honestly performing the queries,verifiable SSE(VSSE)schemes are constructed to ensure the verifiability of the search results.However,existing VSSE constructions only focus on single-keyword search or incur heavy computational cost during verification.To address this challenge,we present an efficient VSSE scheme,built on OXT protocol(Cash et al.,CRYPTO 2013),for conjunctive keyword queries with sublinear search overhead.The proposed VSSE scheme is based on a privacy-preserving hash-based accumulator,by leveraging a well-established cryptographic primitive,Symmetric Hidden Vector Encryption(SHVE).Our VSSE scheme enables both correctness and completeness verifiability for the result without pairing operations,thus greatly reducing the computational cost in the verification process.Besides,the proposed VSSE scheme can still provide a proof when the search result is empty.Finally,the security analysis and experimental evaluation are given to demonstrate the security and practicality of the proposed scheme.

关键词： searchable symmetric encryption verifiability conjunctive keyword queries hash-based accumulator cloud storage

Health Data Availability Protection:Delta-XOR-Relay Data Update in Erasure-Coded cloud storage Systems

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computer Modeling in Engineering & Sciences 2023年第4期135卷 169-185页

作者： Yifei Xiao Shijie Zhou School of Information and Software Engineering University of Electronic Science and Technology of ChinaChengdu610054China

To achieve the high availability of health data in erasure-coded cloud storage systems,the data update performance in erasure coding should be continuously optimized.However,the data update performance is often bottlenecked by the constrained cross-rack bandwidth.Various techniques have been proposed in the literature to improve network bandwidth efficiency,including delta transmission,relay,and batch update.These techniques were largely proposed individually previously,and in this work,we seek to use them jointly.To mitigate the cross-rack update traffic,we propose DXR-DU which builds on four valuable techniques:(i)delta transmission,(ii)XOR-based data update,(iii)relay,and(iv)batch update.Meanwhile,we offer two selective update approaches:1)data-deltabased update,and 2)parity-delta-based update.The proposed DXR-DU is evaluated via trace-driven local testbed experiments.Comprehensive experiments show that DXR-DU can significantly improve data update throughput while mitigating the cross-rack update traffic.

关键词： Data availability health data data update cloud storage IoT

Hash-Indexing Block-Based Deduplication Algorithm for Reducing storage in the cloud

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computer Systems Science & Engineering 2023年第7期46卷 27-42页

作者： D.Viji S.Revathy Department of Computer Science and Engineering Sathyabama Institute of Science and TechnologyChennaiIndia

cloud storage is essential for managing user data to store and retrieve from the distributed data centre.The storage service is distributed as pay a service for accessing the size to collect the data.Due to the massive amount of data stored in the data centre containing similar information and file structures remaining in multi-copy,duplication leads to increase storage space.The potential deduplication system doesn’t make efficient data reduction because of inaccuracy in finding similar data analysis.It creates a complex nature to increase the storage consumption under cost.To resolve this problem,this paper proposes an efficient storage reduction called Hash-Indexing Block-based Deduplication(HIBD)based on Segmented Bind Linkage(SBL)Methods for reducing storage in a cloud environment.Initially,preprocessing is done using the sparse augmentation technique.Further,the preprocessed files are segmented into blocks to make Hash-Index.The block of the contents is compared with other files through Semantic Content Source Deduplication(SCSD),which identifies the similar content presence between the file.Based on the content presence count,the Distance Vector Weightage Correlation(DVWC)estimates the document similarity weight,and related files are grouped into a cluster.Finally,the segmented bind linkage compares the document to find duplicate content in the cluster using similarity weight based on the coefficient match case.This implementation helps identify the data redundancy efficiently and reduces the service cost in distributed cloud storage.

关键词： cloud computing deduplication hash indexing relational content analysis document clustering cloud storage record linkage

Improved cloud storage Encryption Using Block Cipher-Based DNA Anti-Codify Model

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computer Systems Science & Engineering 2023年第10期47卷 903-918页

作者： E.Srimathi S.P.Chokkalingam SRM Institute of Science and Technology Ramapuram CampusChennai600089TamilnaduIndia Department of CSE Saveetha Institute of Medical and Technical Sciences602105TamilnaduIndia

When it comes to data storage,cloud computing and cloud storage providers play a critical role.The cloud data can be accessed from any location with an internet connection.Additionally,the risk of losing privacy when data is stored in a cloud environment is also increased.A variety of security techniques are employed in the cloud to enhance security.In this paper,we aim at maintaining the privacy of stored data in cloud environment by implementing block-based modelling to boost the privacy level with Anti-Codify Technique(ACoT)and block cipher-based algorithms.Initially,the cipher text is generated using Deoxyribo Nucleic Acid(DNA)model.Block-cipher-based encryption is used by ACoT,but the original encrypted file and its extension are broken up into separate blocks.When the original file is broken up into two separate blocks,it raises the security level and makes it more difficult for outsiders to cloud data access.ACoT improves the security and privacy of cloud storage data.Finally,the fuzzy-based classification is used that stores various access types in servers.The simulation results shows that the ACoT-DNA method achieves higher entropy against various block size with reduced computational cost than existing methods.

关键词： cloud storage cloud computing block cipher anti-codify technique

Secured Data storage Using Deduplication in cloud Computing Based on Elliptic Curve Cryptography

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computer Systems Science & Engineering 2022年第4期41卷 83-94页

作者： N.Niyaz Ahamed N.Duraipandian Department of Computer Science and Engineering Velammal Engineering CollegeChennai600066India

The tremendous development of cloud computing with related technol-ogies is an unexpected one.However,centralized cloud storage faces few chal-lenges such as latency,storage,and packet drop in the network.cloud storage gets more attention due to its huge data storage and ensures the security of secret information.Most of the developments in cloud storage have been positive except better cost model and effectiveness,but still data leakage in security are billion-dollar questions to consumers.Traditional data security techniques are usually based on cryptographic methods,but these approaches may not be able to with-stand an attack from the cloud server's interior.So,we suggest a model called multi-layer storage(MLS)based on security using elliptical curve cryptography(ECC).The suggested model focuses on the signiﬁcance of cloud storage along with data protection and removing duplicates at the initial level.Based on divide and combine methodologies,the data are divided into three parts.Here,theﬁrst two portions of data are stored in the local system and fog nodes to secure the data using the encoding and decoding technique.The other part of the encrypted data is saved in the cloud.The viability of our model has been tested by research in terms of safety measures and test evaluation,and it is truly a powerful comple-ment to existing methods in cloud storage.

关键词： cloud storage deduplication fog computing and elliptic curve cryptography

Enabling Efficient Batch Updating Verification for Multi-versioned Data in cloud storage

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2019年第2期28卷 377-385页

作者： QI Yining TANG Xin HUANG Yongfeng Department of Electronic Engineering Tsinghua University Tsinghua National Laboratory for Information Science and Technology

Existing dynamic data possession verification schemes not only suffer from low efficiency of rebalancing its Merkle Hash tree(MHT) when executing data updating, but also lack effective mechanism to verify multi-version files. Aiming at these problems, this paper propose a new data structure called Rank-based multi-version Merkle AVL tree(RBMV-MAT) to achieve efficient batch updating verification for multi-version data.RBMV-MAT uses a special lock and relaxed balance to decrease the frequency of rebalacing operations. The experimental results show that our efficient scheme has better efficiency than those of existing methods.

关键词： cloud storage Data integrity Provable data possession(PDP) Data dynamics cloud computing

Consistency Maintenance in Replication:A Novel Strategy Based on Diamond Topology in cloud storage

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2017年第1期26卷 192-198页

作者： LUO Siwei HOU Mengshu ZHAN Siyu LYU Mengjie LI Ming School of Computer Science and Engineering University of Electronic Science and Technology of China The Second Research Institute of Civil Aviation Administration of China

The problem of consistency maintenance in replication is a fundamental issue in cloud storage. Existing solutions either cannot obtain good efficiency, or suffer low reliability. We propose a novel consistency maintenance strategy based on diamond topology. It organizes all the nodes in cloud storage system into a high symmetrical, reliable structure. The experimental results show that our diamond topology reduces the network overhead by55.9% at least, compared to state-of-the-art random topology, and achieves at most 49.1% enhancement in reliability towards to tree topology.

关键词： Replication Consistency maintenance Topology cloud storage

Request Merging Based Cross-User Deduplication for cloud storage with Resistance Against Appending Chunks Attack

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2021年第2期30卷 199-209页

作者： TANG Xin ZHANG Yi ZHOU Linna LIU Dan HU Bingwei School of Information Science and Technology University of International Relations School of Cyberspace Security Beijing University of Posts and Telecommunications

Cross-user deduplication is an emerging technique to eliminate redundant uploading in cloud storage. Its deterministic response indicating the existence of data creates a side channel to attackers, which makes the privacy in the cloud at risk. Such kind of attack as well as further appending chunks attack, still cannot be well resisted in current solutions, thus is becoming a big obstacle in using this technique. We propose a secure cross-user deduplication, called Request merging based deduplication scheme(RMDS), which takes the lead to consider resistance against appending chunks attack in a lightweight way, let alone side channel attack. We utilize the proposed XOR based chunk-level server-side storage structure together with a request merging strategy to obfuscate attackers in minimized communication overhead. The experiment results show that, with security guaranteed, the proposed scheme is more efficient comparing with the state of the art.

关键词： Deduplication Side channel attack Appending chunks attack Request merging cloud storage

Privacy-Preserving Public Auditing Scheme for Data Confidentiality and Accountability in cloud storage

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2019年第1期28卷 179-187页

作者： YANG Zhen WANG Wenyu HUANG Yongfeng LI Xing Department of Electronic Engineering Tsinghua University Tsinghua National Laboratory for Information Science and Technology Information Networking Institute Carnegie Mellon University

cloud data confidentiality need to be audited for the data owner’s concern. Confidentiality auditing is usually based on logging schemes, whereas cloud data dynamics and sharing group dynamics result in massive logs, which makes confidentiality auditing a formidable task for user with limited resources. So we propose a public auditing scheme for data confidentiality,in which user resorts to a Third-party auditor(TPA)for auditing. Our scheme design a special log called attestation in which hash user pseudonym is used to preserve user privacy. Attestation-based data access identifying is presented in our scheme which brings no new vulnerabilities toward data confidentiality and no extra online burden for user. We further support accountability of responsible user for data leakage based on user pseudonym. Extensive security and performance analysis compare our scheme with existing auditing schemes.Results indicate that the proposed scheme is provably secure and highly efficient.

关键词： Data confidentiality Public auditability Privacy preserving cloud storage User accountability