Data Retrieval Scheme Research Articles

A practical vehicular‐fog‐based privacy‐preserving attribute‐based keyword search system using potential games

AbstractThe growth of fog computing drives Internet of Things users to outsource data for services like storage and sharing. To ensure secure and efficient data search, extensive research has been conducted on searchable encryption, specifically attribute‐based keyword search (ABKS). ABKS facilitates precise access control over encrypted data while maintaining search functionality. However, delegating complex search operations to fog nodes introduces challenges like latency limitations, compromised search results, and unauthorized occupation of server resources. In this manuscript, we propose a Time‐Efficient Data Retrieval (TEDR) scheme to address these challenges. Our scheme incorporates two access policies, allowing data owners (DOs) and data users (DUs) to control data access and search queries. TEDR enables fog nodes to verify search queries before decryption, avoiding unnecessary decryption for invalid queries. We introduce a decentralized query submitting framework to allocate search queries among fog nodes, addressing redundancy concerns and latency issues. We analyze the decentralized query submitting game and classify it as a potential game, making it suitable for decentralized decision‐making. We evaluate TEDR performance on real‐world datasets, demonstrating practicality and efficiency. Our scheme reduces computational and communication costs by approximately 30% compared to existing methods.

The Impact and Implementation of Distributed Ledger Technology (DLT) On Accounting Information Storage and Verification

In recent years, blockchain technology has received attention because of its decentralized, immutable and other characteristics, but it faces storage and retrieval challenges. To address these challenges, this paper introduces IOTA distributed ledger technology, which solves the scalability and cost problems of traditional blockchains. By analyzing and experimenting the Tangle, the underlying consensus structure of IOTA, this paper reveals the main factors affecting its development, and proposes a segmented adaptive cutting-edge transaction selection algorithm to optimize the system performance. At the same time, based on IOTA distributed ledger, this paper proposes a data encryption storage and retrieval scheme, which speeds up the data link and retrieval speed, and ensures the integrity and security of data. Finally, this paper discusses the application of blockchain in accounting informatization, and puts forward the scheme of building a new generation of accounting informatization platform, which is of great value to the construction of accounting informatization.

Privacy Protection Data Retrieval Scheme With Inverted Index for IoT Based on Blockchain

In the 6G era, Internet of things (IoT) devices can form a blockchain network, which also faces the problems of data sharing. And the data transmitted and stored through the network has the risk of privacy leaking. Encrypting the shared data can satisfy the need of the privacy, and retrieving the encrypted data can make the data used efficiently.However, to enable users to retrieve encrypted data and perform fine-grained authorization on their encrypted files is still a great challenge. Although attribute-based keyword search (ABKS) is a well-received solution to the challenge, there are still privacy and efficiency issues if the traditional ABKS schemes are directly used in blockchain data sharing. In order to solve the problems, this paper proposes privacy protection data retrieval scheme with an inverted index which is an application of attribute-based encryption. Firstly, our scheme is proved secure against the outside keyword guessing attack (KGA) and chosen keyword attack (CKA) under semi-trusted model. Secondly, the scheme returns a multi-keywords ranked result. Thirdly, we analyze the efficiency of our scheme, and verify it by simulation.The results show that our scheme has improvement in efficiency and can meet the data sharing needs of the blockchain network composed of IoT devices.

Designing attribute-based verifiable data storage and retrieval scheme in cloud computing environment

The cloud computing technology is a novel storage and computing paradigm that enables individuals and organizations to store data, share data with intended group of users and retrieve data when require. It greatly improves peoples’ data storage and sharing, and data retrieval capabilities by providing flexible, less expensive and quality services. For data security and privacy concerns, secure and authenticated data storage, fine-grained access control of encrypted data, secure search for the outsourced data and search results verification are of critical importance. However, achieving the aforementioned functionalities simultaneously is quite challenging. In this paper, for the first time, we propose a secure lightweight Attribute-Based verifiable Data Storage and data Retrieval Scheme (ABDSRS) for cloud environments that attains the following features: (i) lightweight design, (ii) provably secure, (iii) fine-grained data access control, (iv) data owner (DO) anonymity, (v) data and DO authenticity, (vi) keyword policy search over encrypted data, (vii) keyword privacy, and (viii) search results verification. ABDSRS employs attribute-based online-offline mechanism in which only authorized DOs can anonymously upload data to the cloud. And, a data user (DU) can search over encrypted data using keyword policy. ABDSRS enables a DU to verify the correctness of the search results (i.e., the correctness of the operations performed by the cloud) without interacting with any authority. ABDSRS is lightweight in the sense that the heavy computations are offloaded either to the cloud or to offline phase, while only lightweight operations are executed at the DU device. We formalize more general security definitions of ABDSRS by considering various possible adversarial capabilities and present rigorous security analysis. We also conduct experiments to evaluate ABDSRS’s performance.

Blockchain Data Scalability and Retrieval Scheme Based on On-Chain Storage Medium for Internet of Things Data

The combination of blockchain and internet of things (IoT) technology realizes reliable storage of IoT data. However, the data stored on the blockchain (on-chain) face the problem of poor scalability and inefficient retrieval. In this paper, the on-chain data scalability schemes based on transactions and smart contracts are first proposed. Subsequently, on the basis of the above on-chain data scalability scheme based on transactions, an on-chain data index based on skip lists is proposed to improve the retrieval efficiency. The experimental results show that both the on-chain data scalability schemes achieve on-chain data scalability while reducing storage overhead. Meanwhile, the on-chain data index based on skip lists has significantly improved dynamic range retrieval efficiency and reduced the time complexity of single data retrieval to O(log(n)).

Enabling privacy-preserving multi-server collaborative search in smart healthcare

With the advancement of smart healthcare, each medical institution stores huge amounts of users’ medical data in its cloud server for diagnosis and treatment. However, the traditional storage structure has obstacles to reasonable medical resources access and medical data circulation, such as data security, query privacy, and isolated data island problems. An intuitive solution is to store all the encrypted medical data in a central server. But this method absolutely depends on the central server, causing more performance disadvantages and privacy risks. Therefore, it is urgent to construct a secure and proper medical data retrieval scheme. Based on the existing data storage model, we build a multi-server search scheme to collaboratively perform diagnostic institution location, medical data search, and even cross-domain data search in this paper. The multi-server architecture solves problems of destructiveness and information over-centralization caused by the single server and enhances the reliability and practicality of the system. The utilization of hidden vector encryption, secret sharing, and secure multi-party computation realizes efficient search, identity privacy, search pattern security, and access pattern security. Security analysis demonstrates that identity privacy and query security are protected. Extensive experiments show that the scheme has better data search and data add efficiency through horizontal and vertical comparisons.

A CO2-independent cloud mask from Infrared Atmospheric Sounding Interferometer (IASI) radiances for climate applications

Abstract. With more than 15 years of continuous and consistent measurements, the Infrared Atmospheric Sounding Interferometer (IASI) radiance dataset is becoming a reference climate data record. To be exploited to its full potential, it requires a cloud filter that is accurate, unbiased over the full IASI life span and strict enough to be used in satellite data retrieval schemes. Here, we present a new cloud detection algorithm which combines (1) a high sensitivity, (2) a good consistency over the whole IASI time series and between the different copies of the instrument flying on board the suite of Metop satellites, and (3) simplicity in its parametrization. The method is based on a supervised neural network (NN) and relies, as input parameters, on the IASI radiance measurements only. The robustness of the cloud mask over time is ensured in particular by avoiding the IASI channels that are influenced by CO2, N2O, CH4, CFC-11 and CFC-12 absorption lines and those corresponding to the ν2 H2O absorption band. As a reference dataset for the training, version 6.5 of the operational IASI Level 2 (L2) cloud product is used. We provide different illustrations of the NN cloud product, including comparisons with other existing products. We find very good agreement overall with version 6.5 of the operational IASI L2 with an identical mean annual cloud amount and a pixel-by-pixel correspondence of about 87 %. The comparison with the other cloud products shows a good correspondence in the main cloud regimes but with sometimes large differences in the mean cloud amount (up to 10 %) due to the specificities of each of the different products. We also show the good capability of the NN product to differentiate clouds from dust plumes.

Encrypted Data Retrieval and Sharing Scheme in Space–Air–Ground-Integrated Vehicular Networks

As a smart transportation application of the Internet of Things, the Internet of Vehicles (IoV) depresses the chances of traffic accidents, while improving transportation efficiency and user driving experience. However, as the number of vehicles continues to grow, the original ground-based IoV system is difficult to meet the ever-increasing demand. To this end, space–air–ground-integrated network (SAGIN) incorporates satellite systems, aerial network and terrestrial communications. However, because SAGIN integrates multiple network services and communication modes, which makes SAGIN more vulnerable to various types of attacks and security threats. This article first presents the dominating security threats in data storage, transmission and sharing of space–air–ground integrated vehicular network (SAGIVN). Moreover, for guaranteeing the safety and effectiveness of the model, we advance a safe and effective encrypted data retrieval and sharing scheme in SAGIVN (ERDSS) for possible threats, the ERDSS can execute fuzzy retrieval over misspelling keywords and sort results by relevance scores to realize precise retrieval. We perform a comprehensive security discussion and execute experiments based on real-world data sets. The consequences demonstrate that the ERDSS is safe and efficient.

Towards reliable and efficient data retrieving in ICN-based satellite networks

Building a reliable and efficient network layer for large-volume content delivery over satellite is extremely challenging due to space circumstances of unreliable connectivity, long propagation delay and high dynamics. In this paper, we address those challenges in satellite networking and propose an information-centric data retrieval scheme to provide disruption-tolerant, low-delay and highly efficient content delivery. Our design, namely Coding-enabled Adaptive-Pull (CAP) scheme, is rooted in the concept of information-centric networking, transferring named contents rather than maintaining unreliable end-to-end connections in space. CAP retrieves data in one-to-many request-response model and adaptively adjusts the retrieval expectation according to network states. Meanwhile, the data retrieval scheme embeds with fountain-style erasure coding over its named packets for reliable transmission to reduce the needs of packet retransmission and utilizes in-network caching to tolerate possible link disruption. Evaluation results show that our scheme reduces delivery delay in most cases of unreliable links by nearly 82% and 75% compared with IP and NDN, respectively, and by 72% compared to delay-tolerant networking technique in a space-oriented scenario, with outstanding performance in tolerating delays and disruptions.

Privacy-Preserving Fine-Grained Data Retrieval Schemes for Mobile Social Networks

In this paper, we propose privacy-preserving fine-grained data retrieval schemes for mobile social networks (MSNs). The schemes enable users to retrieve data from other users who are interested in some topics related to a subject of interest. We define a subject to be a broad term that can cover many fine-grained topics, e.g., History can be a subject and World War I can be a topic. We consider centralized and decentralized network models. Our centralized scheme allows users to securely outsource data to a server such that the server matches the users who are interested in same topic(s) and have defined social attributes with privacy preservation. Searchable encryption scheme and a proposed cryptography construct are used to enable the server to match the topics and attributes without knowing any private information. By using the social attributes, users can prescribe the other users who can be connected to. We also propose a decentralized scheme that can be used when there is no connection to the server, i.e, shortage of Internet connectivity. The scheme leverages friends-of-friends relationship and transferable trust concept, where each user trusts his friends and the friends of friends. If a friend is not interested in the requested subject, he/she can link him/her to his/her friends without knowing the requested subject to preserve privacy. Our schemes use Bloom filters to store the topics of interest to reduce the storage and communication overhead. This is important because the number of fine-grained topics can be large. Different techniques to store the topics in the filter are proposed and investigated. Performance metrics are proposed and evaluated using real implementations. Our analysis and implementation results demonstrate that our schemes can preserve the privacy of the MSN users with high performance.

Research Analysis on Encryption Algorithms for Cloud Authentication in Hms

With the advancement of Internet of Things, mutual sharing of data turns out to be simple among different brilliant gadgets over the globe. In such a situation, a smart health care should be accelerated with a goal to provide a secure patient’s record situated globally. In any case, as the sensitive data about a patient passes through an open channel (i.e., the Internet), there are odds of abusing this data and intercepting message communication and possibility of passive attack. These attacks are undetected and unavoidable over open channels. Thus, there is a necessity for a solid crypto system for safely handling keen human services information. To ensure that the patients' right over their own information, it is a assuring technique to scramble the information's by the time it gets re-appropriated. We are presenting a secure data retrieval scheme by comparing various algorithms that manage their attributes independently. The proposed application mainly insist on current attribute based encryption mechanism and providing compared efficiency.

Lattice assumption based fuzzy information retrieval scheme support multi-user for secure multimedia cloud

Multimedia cloud is novel computation paradigm which could leverage cloud infrastructure to store large quantity of multimedia documents and respond on the requests from customers. With the development of multimedia cloud, an increasing attention is paid to its privacy and security issues. Searchable encryption (SE) technology could protect the sensitive information of cloud storage data and at the same time allow keyword search query. Most of the available SE schemes are constructed using the bilinear map. However, both discrete logarithms and factorization are proved to be solved by quantum computer in a polynomial time. Thus, those schemes are not secure in quantum age. Moreover, majority SE schemes are limited in exact or fuzzy keyword search. They can not support the semantically keyword equivalent judgement. In order to solve those problems, we suggest a novel data retrieval scheme for multiple users based on the lattice based mechanism. The contribution of this paper is summarized in three aspects: lattice assumption based scheme to resist quantum attack, semantically keyword search to enable synonym query and broadcast encryption based mechanism to support multiple user system without sharing secret key. This scheme is a candidate for secure multimedia cloud even in quantum-era since the LWE problem is secure against quantum attack.

Zero-knowledge GPS-free data replication and retrieval scheme in mobile ad hoc networks using double-ruling and landmark-labeling techniques

Using the double-ruling technique, many data replication and retrieval schemes achieve low data retrieval latency. However, these schemes require Global Positioning System (GPS) in mobile ad hoc networks (MANETs). In this paper, we propose a zero-knowledge double-ruling-based GPS-free data replication and retrieval scheme (MobiMark) in MANETs. Our primary idea is to label the landmarks with the grid-like structure in the network using the landmark-labeling, dynamically designate the node that is the nearest to a landmark as the landmark broker, and transmit the consumers’ interests (or producers’ data) to all horizontal (or vertical) landmark brokers using the double-ruling technique. Simulations show that MobiMark achieves good performance in terms of data retrieval rate and data retrieval latency. In addition, we also develop a theoretical analysis for MobiMark to obtain the upper bound of the hop distance between the consumer and the landmark broker with the consumer’s interest in a square region where the nodes are uniformly and densely distributed and have equal transmission ranges.

Privacy conserving low volume information retrieval from backbone services in VANETs

Mobile ad hoc networks are of high interest in research and practice, especially as realizations in the automotive domain. Wireless data exchange, safety critical use cases and privacy requirements impose tough challenges on applied security mechanisms. Well studied solutions are available for direct communication between nodes. However, also time critical data retrieval from backbone services is required for many use cases, like the delivery of pseudonym certificates. This topic has not been looked at in detail in prior work. We show that the approach proposed in standards bears significant drawbacks. High effort in the input message validation process causes a denial of service weakness of backbone services. Moreover, request messages contain removable data sets making them unnecessarily long, which leads to high bandwidth requirements for reliable communication between backbone and mobile node. Thus, we propose a new data retrieval scheme increasing robustness of the backbone to denial of service attacks and decreasing length of nodes' request messages. The conducted evaluation shows good usability of the approach.

ENGLISH

Intermittent network connectivity and node partitions are frequently occur in military environments like battlefields and some hostile regions. Disruption-tolerant network (DTN) technologies are allows wireless devices to communicate with each other and access the confidential information in military applications by exploiting external storage nodes. The secure data retrieval scheme using Revocable Multi authority CP-ABE for decentralized DTNs where multiple key authorities manage their attributes independently. Some of the most challenging issues in this scenario are the enforcement of authorization policies and the policies update for secure text and video retrieval. Cipher text-policy attribute-based encryption (CP-ABE) is a promising cryptographic solution to the access control issues The Multi authority CP-ABE and AES algorithm it provides secure retrieval of text and video respectively. The proposed system provides secure retrieval of text and video, using modified CP-ABE and AES algorithm for decentralized DTNs respectively. Also, demonstrating how to apply the proposed mechanism to securely and efficiently manage the confidential information distributed in the disruption-tolerant military network. It implemented using Network Simulator-2.

Distributed Data Storage in Wireless Sensor Networks

This paper studied the techniques of distributed data storage in wireless senor networks. Firstly, the challenge and the need for such techniques were summarized; Secondly, some representative distributed data storage and retrieval schemes were introduced in detail; finally, the future research directions and open issues were pointed out.

Secure Data Retrieval for Decentralized Military Networks

Portable nodes in military environments, for example, as in battlefield or an unfriendly area are prone to experience the under go of irregular system network and frequent partitions. Interruption tolerant network (ITN) innovations are getting to be fruitful results that permit remote device conveyed by officers to speak with one another and access the secret data or summon dependably by abusing outside capacity nodes. Possibly the most solid issues in this situation are the necessity of approval arrangements and the strategies redesign for secure information recovery. This paper considers an attribute-based secure data retrieval scheme using CP-ABE for ITNs where multiple key authorities manage their attributes independently. Immediate attribute repeal enhances backward/forward secrecy of confidential data by reducing the windows of vulnerability. Key escrow problem is resolved by an escrow-free key issuing protocol that utilizes the characteristic of the decentralized ITN architecture proposed a decentralized approach; their technique does not authenticate users. We demonstrate how to apply the proposed mechanism to securely and efficiently manage the confidential data distributed in the Interruption-tolerant military network.

Efficient data retrieval algorithms for multiple requests in MIMO wireless networks

SummaryGiven a set of multiple channels, a set of multiple requests, where each request contains multiple requested data items and a client equipped with multiple antennae, the multi‐antenna‐based multirequest data retrieval problem (DRMR‐MA) is to find a data retrieval sequence for downloading all data items of the requests allocated to each antenna, such that the maximum access latency of all antennae is minimized. Most existing approaches for the data retrieval problem focus on either single antenna or single request and are hence not directly applicable to DRMR‐MA for retrieving multiple requests. This paper proposes two data retrieval algorithms that adopt two different grouping schemes to solve DRMR‐MA so that the requests can be suitably allocated to each antenna. To find the data retrieval sequence of each request efficiently, we present a data retrieval scheme that converts a wireless data broadcast system to a special tree. Experimental results show that the proposed scheme is more efficient than other existing schemes. Copyright © 2014 John Wiley & Sons, Ltd.

Authentic Data Access Scheme for Variant Disruption-Tolerant Networks

Mobile nodes in military environments such as a battlefield or a hostile region are likely to suffer from intermittent network connectivity and frequent partitions. Disruption-tolerant network (DTN) technologies are becoming successful solutions that allow wireless devices carried by soldiers to communicate with each other and access the confidential information or command reliably by exploiting external storage nodes. However, the problem of applying CP-ABE in decentralized DTNs introduces several security and privacy challenges with regard to the attribute revocation, key escrow, and coordination of attributes issued from different authorities. In this paper, we propose a secure data retrieval scheme using CP-ABE for decentralized DTNs where multiple key authorities manage their attributes independently. We demonstrate how to apply the proposed mechanism to securely and efficiently manage the confidential data distributed in the disruption-tolerant military network. Since some users may change their associated attributes at some point (for example, moving their region), or some private keys might be compromised, key revocation (or update) for each attribute is necessary in order to make systems secure. This implies that revocation of any attribute or any single user in an attribute group would affect the other users in the group. It may result in bottleneck during rekeying procedure, or security degradation due to the windows of vulnerability if the previous attribute key is not updated immediately.

Adaptive Information Brokerage in Wireless Sensor Networks with Virtual Rings

We study the problem of information brokerage in wireless sensor networks, where each sensor node can be an information producer or an information consumer, or both an information consumer and information producer. Some sensor nodes in the sensor networks can be selected out as the storage nodes, where the producers can store their data and the consumers can retrieve the data they are interested in. Which node/nodes should be chosen as the storage node/nodes is a challenging problem, because many factors such as the data generating rates of the producers and the query frequencies of the consumer should be considered. In this paper, we proposed a novel data storage and retrieval scheme named SRVR (Storage and Retrieval with Virtual Rings). SRVR chooses the nodes in an optimal ring around the center of the sensor network field as the storage nodes, and achieves data storage and retrieval based on the ring. We show by simulation that SRVR achieves more balanced traffic load on sensor nodes and prolongs the lifetime of the senor networks.