scholarly journals EPCT: An Efficient Privacy-Preserving and Collusion-Resisting Top- k Query Processing in WSNs

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Qian Zhou ◽  
Hua Dai ◽  
Jianguo Zhou ◽  
Rongqi Qi ◽  
Geng Yang ◽  
...  
Keyword(s):  
Query Processing ◽  
Data Privacy ◽  
Security Analysis ◽  
Privacy Preserving ◽  
Experimental Result ◽  
Communication Overhead ◽  
Symmetric Encryption ◽  
Sensory Data ◽  
Two Phases ◽  
Secure Query Processing

Data privacy threat arises during providing top- k query processing in the wireless sensor networks. This article presents an efficient privacy-preserving and collusion-resisting top- k (EPCT) query processing protocol. A minimized candidate encrypted dataset determination model is first designed, which is the foundation of EPCT. The model guides the idea of query processing and guarantees the correctness of the protocol. The symmetric encryption with different private key in each sensor is deployed to protect the privacy of sensory data even a few sensors in the networks have been colluding with adversaries. Based on the above model and security setting, two phases of interactions between the interested sensors and the sink are designed to implement the secure query processing protocol. The security analysis shows that the proposed protocol is capable of providing secure top- k queries in the manner of privacy protection and anticollusion, whereas the experimental result indicates that the protocol outperforms the existing works on communication overhead.

scholarly journals Energy-efficient and privacy-preserving spatial range aggregation query processing in wireless sensor networks

2019 ◽  
Vol 15 (7) ◽  
pp. 155014771986100 ◽  
Author(s):  
Liang Liu ◽  
Zhenhai Hu ◽  
Lisong Wang
Keyword(s):  
Sensor Networks ◽  
Query Processing ◽  
Energy Efficient ◽  
Privacy Protection ◽  
Data Privacy ◽  
Privacy Preserving ◽  
Sensitive Data ◽  
Sensory Data ◽  
Spatial Range ◽  
Query Algorithm

The existing privacy-preserving aggregation query processing methods in sensor networks rely on pre-established network topology and require all nodes in the network to participate in query processing. Maintaining the topology results in a large amount of energy overhead, and in many cases, the user is interested only in the aggregated query results of some areas in the network, and thus, the participation of the entire network node is not necessary. Aiming to solve this problem, this article proposes a spatial range aggregation query algorithm for a dynamic sensor network with privacy protection (energy-efficient privacy-preserving data aggregation). The algorithm does not rely on the pre-established topology but considers only the query area that the user is interested in, abandoning all nodes to participate in distributing the query messages while gathering the sensory data in the query range. To protect node data privacy, Shamir’s secret sharing technology is used to prevent internal attackers from stealing the sensitive data of the surrounding nodes. The analysis and experimental results show that the proposed algorithm outperforms the existing algorithms in terms of energy and privacy protection.

scholarly journals Privacy-Preserving Sorting Algorithms Based on Logistic Map for Clouds

2018 ◽  
Vol 2018 ◽  
pp. 1-10
Author(s):  
Hua Dai ◽  
Hui Ren ◽  
Zhiye Chen ◽  
Geng Yang ◽  
Xun Yi
Keyword(s):  
Data Privacy ◽  
Logistic Map ◽  
Security Analysis ◽  
Privacy Preserving ◽  
Service Recommendation ◽  
Sensitive Data ◽  
Encrypted Data ◽  
Sorting Algorithms ◽  
Common Operation ◽  
Cloud Servers

Outsourcing data in clouds is adopted by more and more companies and individuals due to the profits from data sharing and parallel, elastic, and on-demand computing. However, it forces data owners to lose control of their own data, which causes privacy-preserving problems on sensitive data. Sorting is a common operation in many areas, such as machine learning, service recommendation, and data query. It is a challenge to implement privacy-preserving sorting over encrypted data without leaking privacy of sensitive data. In this paper, we propose privacy-preserving sorting algorithms which are on the basis of the logistic map. Secure comparable codes are constructed by logistic map functions, which can be utilized to compare the corresponding encrypted data items even without knowing their plaintext values. Data owners firstly encrypt their data and generate the corresponding comparable codes and then outsource them to clouds. Cloud servers are capable of sorting the outsourced encrypted data in accordance with their corresponding comparable codes by the proposed privacy-preserving sorting algorithms. Security analysis and experimental results show that the proposed algorithms can protect data privacy, while providing efficient sorting on encrypted data.

scholarly journals Data Privacy Protection Algorithm Based on Redundant Slice Technology in Wireless Sensor Networks

2021 ◽  
Vol 15 (1) ◽  
pp. 1-23
Author(s):  
Peng Li ◽  
Chao Xu ◽  
He Xu
Keyword(s):  
Packet Loss ◽  
Data Transmission ◽  
Data Privacy ◽  
Original Data ◽  
Privacy Preserving ◽  
Communication Overhead ◽  
Hidden Information ◽  
Perturbation Data ◽  
Hidden Data ◽  
Routing Tree

In order to solve the problem that the privacy preserving algorithm based on slicing technology is incapable of dealing with packet loss, this paper presents the redundancy algorithm for privacy preserving. The algorithm guarantees privacy by combining disturbance data and ensures redundancy via carrying hidden data. It also selects the routing tree that is generated by the CTP protocol as the routing path for data transmission. Through division at the source node, the method adds hidden information and disturbance data. This algorithm uses hidden data and adds perturbation data to improve the privacy preserving. Nonetheless, it can restore the original data when data are partly lost. According to the simulation via TOSSIM (TinyOS simulator), in the case of partial packet loss, the algorithm can completely restore the original data. Furthermore, the authors compared accuracy of proposed algorithm, probability of data reduction, data fitting degree, communication overhead, and PLR. As a result, it improves the reliability and privacy of data transmission while ensuring data redundancy.

scholarly journals EPPDA: An Efficient and Privacy-Preserving Data Aggregation Scheme with Authentication and Authorization for IoT-Based Healthcare

2021 ◽  
Author(s):  
Faris. A. Almalki ◽  
Ben othman Soufiene
Keyword(s):  
Data Aggregation ◽  
Data Privacy ◽  
Homomorphic Encryption ◽  
Privacy Preserving ◽  
Security And Privacy ◽  
Communication Overhead ◽  
Range Data ◽  
Aggregation Techniques ◽  
Aggregation Scheme ◽  
Iot Devices

Abstract Internet of Things (IoT) connects various kinds of intelligent objects and devices using the internet to collect and exchange data. Nowadays, The IoT is used in diverse application domains, including the healthcare. In the healthcare domain, the IoT devices can collects patient data, and its forwards the data to the healthcare professionals can view it. The IoT devices are usually resource-constrained in terms of energy consumption, storage capacity, computational capability, and communication range, data aggregation techniques are used to reduce the communication overhead. However, in healthcare system using IoT, the heterogeneity of technologies, the large number of devices and systems, and the different types of users and roles create important challenges in terms of security. For that, the security and privacy aggregation of health data are very important aspects. In this paper, we propose a novel secure data aggregation scheme based on homomorphic primitives in IoT based healthcare systems, called “An Efficient and Privacy-Preserving Data Aggregation Scheme with authentication for IoT-Based Healthcare applications” (EPPDA). EPPDA is based the Verification and Authorization phase to verifying the legitimacy of the nodes wants to join the process of aggregation. EPPDA uses additive homomorphic encryption to protect data privacy and combines it with homomorphic MAC to check the data integrity. The security analysis and experimental results show that our proposed scheme guarantees data privacy, messages authenticity, and integrity, with lightweight communication overhead and computation.

scholarly journals Achieve Efficient and Privacy-Preserving Compound Substring Query over Cloud

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Fan Yin ◽  
Rongxing Lu ◽  
Yandong Zheng ◽  
Xiaohu Tang
Keyword(s):  
Data Privacy ◽  
Homomorphic Encryption ◽  
Security Analysis ◽  
Privacy Preserving ◽  
Computing Technique ◽  
Searchable Symmetric Encryption ◽  
Single Attribute ◽  
Multiple Attributes ◽  
Pseudorandom Function ◽  
Extensive Performance

The cloud computing technique, which was initially used to mitigate the explosive growth of data, has been required to take both data privacy and users’ query functionality into consideration. Searchable symmetric encryption (SSE) is a popular solution that can support efficient attribute queries over encrypted datasets in the cloud. In particular, some SSE schemes focus on the substring query, which deals with the situation that the user only remembers the substring of the queried attribute. However, all of them just consider substring queries on a single attribute, which cannot be used to achieve compound substring queries on multiple attributes. This paper aims to address this issue by proposing an efficient and privacy-preserving SSE scheme supporting compound substring queries. In specific, we first employ the position heap technique to design a novel tree-based index to support substring queries on a single attribute and employ pseudorandom function (PRF) and fully homomorphic encryption (FHE) techniques to protect its privacy. Then, based on the homomorphism of FHE, we design a filter algorithm to calculate the intersection of search results for different attributes, which can be used to support compound substring queries on multiple attributes. Detailed security analysis shows that our proposed scheme is privacy-preserving. In addition, extensive performance evaluations are also conducted, and the results demonstrate the efficiency of our proposed scheme.

scholarly journals Random Secure Comparator Selection Based Privacy-Preserving MAX/MIN Query Processing in Two-Tiered Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-13 ◽  
Author(s):  
Hua Dai ◽  
Tianyi Wei ◽  
Yue Huang ◽  
Jia Xu ◽  
Geng Yang
Keyword(s):  
Sensor Networks ◽  
Query Processing ◽  
Privacy Preserving ◽  
Base Station ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Experimental Result ◽  
Master Node ◽  
Minimal Set ◽  
Query Result

Privacy-preserving data queries for wireless sensor networks (WSNs) have drawn much attention recently. This paper proposes a privacy-preserving MAX/MIN query processing approach based on random secure comparator selection in two-tiered sensor network, which is denoted by RSCS-PMQ. The secret comparison model is built on the basis of the secure comparator which is defined by 0-1 encoding and HMAC. And the minimal set of highest secure comparators generating algorithm MaxRSC is proposed, which is the key to realize RSCS-PMQ. In the data collection procedures, the sensor node randomly selects a generated secure comparator of the maximum data into ciphertext which is submitted to the nearby master node. In the query processing procedures, the master node utilizes the MaxRSC algorithm to determine the corresponding minimal set of candidate ciphertexts containing the query results and returns it to the base station. And the base station obtains the plaintext query result through decryption. The theoretical analysis and experimental result indicate that RSCS-PMQ can preserve the privacy of sensor data and query result from master nodes even if they are compromised, and it has a better performance on the network communication cost than the existing approaches.

scholarly journals Query Privacy Preserving for Data Aggregation in Wireless Sensor Networks

2020 ◽  
Vol 2020 ◽  
pp. 1-10 ◽  
Author(s):  
X. Liu ◽  
X. Zhang ◽  
J. Yu ◽  
C. Fu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Data Privacy ◽  
Homomorphic Encryption ◽  
Privacy Preserving ◽  
Sensor Nodes ◽  
Experimental Simulation ◽  
Wireless Sensor ◽  
Communication Overhead

Wireless Sensor Networks (WSNs) are increasingly involved in many applications. However, communication overhead and energy efficiency of sensor nodes are the major concerns in WSNs. In addition, the broadcast communication mode of WSNs makes the network vulnerable to privacy disclosure when the sensor nodes are subject to malicious behaviours. Based on the abovementioned issues, we present a Queries Privacy Preserving mechanism for Data Aggregation (QPPDA) which may reduce energy consumption by allowing multiple queries to be aggregated into a single packet and preserve data privacy effectively by employing a privacy homomorphic encryption scheme. The performance evaluations obtained from the theoretical analysis and the experimental simulation show that our mechanism can reduce the communication overhead of the network and protect the private data from being compromised.

scholarly journals A Trajectory Privacy Preserving Scheme in the CANNQ Service for IoT

Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 2190 ◽  
Author(s):  
Lin Zhang ◽  
Chao Jin ◽  
Hai-ping Huang ◽  
Xiong Fu ◽  
Ru-chuan Wang
Keyword(s):  
Nearest Neighbor ◽  
Security Analysis ◽  
Response Speed ◽  
Privacy Preserving ◽  
Location Based Services ◽  
Continuous Queries ◽  
Communication Overhead ◽  
Nearest Neighbor Query ◽  
Aggregate Nearest Neighbor ◽  
Query Algorithm

Nowadays, anyone carrying a mobile device can enjoy the various location-based services provided by the Internet of Things (IoT). ‘Aggregate nearest neighbor query’ is a new type of location-based query which asks the question, ‘what is the best location for a given group of people to gather?’ There are numerous, promising applications for this type of query, but it needs to be done in a secure and private way. Therefore, a trajectory privacy-preserving scheme, based on a trusted anonymous server (TAS) is proposed. Specifically, in the snapshot queries, the TAS generates a group request that satisfies the spatial K-anonymity for the group of users—to prevent the location-based service provider (LSP) from an inference attack—and in continuous queries, the TAS determines whether the group request needs to be resent by detecting whether the users will leave their secure areas, so as to reduce the probability that the LSP reconstructs the users’ real trajectories. Furthermore, an aggregate nearest neighbor query algorithm based on strategy optimization, is adopted, to minimize the overhead of the LSP. The response speed of the results is improved by narrowing the search scope of the points of interest (POIs) and speeding up the prune of the non-nearest neighbors. The security analysis and simulation results demonstrated that our proposed scheme could protect the users’ location and trajectory privacy, and the response speed and communication overhead of the service, were superior to other peer algorithms, both in the snapshot and continuous queries.

scholarly journals Privacy-Preserving and Lightweight Selective Aggregation with Fault-Tolerance for Edge Computing-Enhanced IoT

Sensors ◽  
2021 ◽  
Vol 21 (16) ◽  
pp. 5369
Author(s):  
Qiannan Wang ◽  
Haibing Mu
Keyword(s):  
Fault Tolerance ◽  
Data Privacy ◽  
Privacy Preservation ◽  
Fault Tolerant ◽  
Homomorphic Encryption ◽  
Privacy Preserving ◽  
Edge Computing ◽  
Communication Overhead ◽  
Time Data ◽  
Selective Aggregation

Edge computing has been introduced to the Internet of Things (IoT) to meet the requirements of IoT applications. At the same time, data aggregation is widely used in data processing to reduce the communication overhead and energy consumption in IoT. Most existing schemes aggregate the overall data without filtering. In addition, aggregation schemes also face huge challenges, such as the privacy of the individual IoT device’s data or the fault-tolerant and lightweight requirements of the schemes. In this paper, we present a privacy-preserving and lightweight selective aggregation scheme with fault tolerance (PLSA-FT) for edge computing-enhanced IoT. In PLSA-FT, selective aggregation can be achieved by constructing Boolean responses and numerical responses according to specific query conditions of the cloud center. Furthermore, we modified the basic Paillier homomorphic encryption to guarantee data privacy and support fault tolerance of IoT devices’ malfunctions. An online/offline signature mechanism is utilized to reduce computation costs. The system characteristic analyses prove that the PLSA-FT scheme achieves confidentiality, privacy preservation, source authentication, integrity verification, fault tolerance, and dynamic membership management. Moreover, performance evaluation results show that PLSA-FT is lightweight with low computation costs and communication overheads.

Sign in / Sign up

Export Citation Format

Share Document