scholarly journals Privacy-Preserving Distributed Analytics in Fog-Enabled IoT Systems

Sensors ◽  
2020 ◽  
Vol 20 (21) ◽  
pp. 6153
Author(s):  
Liang Zhao
Keyword(s):  
Private Information ◽  
Data Analytics ◽  
Seismic Imaging ◽  
Security Analysis ◽  
Optimal Solution ◽  
Privacy Preserving ◽  
Raw Data ◽  
Data Movement ◽  
Secure Protocol ◽  
Distributed Analytics

The Internet of Things (IoT) has evolved significantly with advances in gathering data that can be extracted to provide knowledge and facilitate decision-making processes. Currently, IoT data analytics encountered challenges such as growing data volumes collected by IoT devices and fast response requirements for time-sensitive applications in which traditional Cloud-based solution is unable to meet due to bandwidth and high latency limitations. In this paper, we develop a distributed analytics framework for fog-enabled IoT systems aiming to avoid raw data movement and reduce latency. The distributed framework leverages the computational capacities of all the participants such as edge devices and fog nodes and allows them to obtain the global optimal solution locally. To further enhance the privacy of data holders in the system, a privacy-preserving protocol is proposed using cryptographic schemes. Security analysis was conducted and it verified that exact private information about any edge device’s raw data would not be inferred by an honest-but-curious neighbor in the proposed secure protocol. In addition, the accuracy of solution is unaffected in the secure protocol comparing to the proposed distributed algorithm without encryption. We further conducted experiments on three case studies: seismic imaging, diabetes progression prediction, and Enron email classification. On seismic imaging problem, the proposed algorithm can be up to one order of magnitude faster than the benchmarks in reaching the optimal solution. The evaluation results validate the effectiveness of the proposed methodology and demonstrate its potential to be a promising solution for data analytics in fog-enabled IoT systems.

scholarly journals PPDM-TAN: A Privacy-Preserving Multi-Party Classifier

Computation ◽  
2021 ◽  
Vol 9 (1) ◽  
pp. 6
Author(s):  
Maria Eleni Skarkala ◽  
Manolis Maragoudakis ◽  
Stefanos Gritzalis ◽  
Lilian Mitrou
Keyword(s):  
Data Mining ◽  
Private Information ◽  
Security Analysis ◽  
Privacy Preserving ◽  
Data Mining Algorithm ◽  
Bayes Classifier ◽  
Sensitive Data ◽  
Privacy Concerns ◽  
Information Privacy Concerns ◽  
Private Data

Distributed medical, financial, or social databases are analyzed daily for the discovery of patterns and useful information. Privacy concerns have emerged as some database segments contain sensitive data. Data mining techniques are used to parse, process, and manage enormous amounts of data while ensuring the preservation of private information. Cryptography, as shown by previous research, is the most accurate approach to acquiring knowledge while maintaining privacy. In this paper, we present an extension of a privacy-preserving data mining algorithm, thoroughly designed and developed for both horizontally and vertically partitioned databases, which contain either nominal or numeric attribute values. The proposed algorithm exploits the multi-candidate election schema to construct a privacy-preserving tree-augmented naive Bayesian classifier, a more robust variation of the classical naive Bayes classifier. The exploitation of the Paillier cryptosystem and the distinctive homomorphic primitive shows in the security analysis that privacy is ensured and the proposed algorithm provides strong defences against common attacks. Experiments deriving the benefits of real world databases demonstrate the preservation of private data while mining processes occur and the efficient handling of both database partition types.

scholarly journals A Search Efficient Privacy-Preserving Location-Sharing Scheme in Mobile Online Social Networks

2020 ◽  
Vol 10 (23) ◽  
pp. 8402
Author(s):  
Guangcan Yang ◽  
Shoushan Luo ◽  
Yang Xin ◽  
Hongliang Zhu ◽  
Jingkai Wang ◽  
...  
Keyword(s):  
Social Networks ◽  
Private Information ◽  
Online Social Networks ◽  
Security Analysis ◽  
Control Policy ◽  
Privacy Preserving ◽  
Handheld Devices ◽  
Location Sharing ◽  
Trade Offs ◽  
And Performance

With the advent of intelligent handheld devices, location sharing becomes one of the most popular services in mobile online social networks (mOSNs). In location-sharing services, users can enjoy a better social experience by updating their real-time location information. However, the leakage of private information may hinder the further development of location-sharing services. Although many solutions have been proposed to protect users’ privacy, the privacy-utility trade-offs must be considered. Therefore, we propose a new scheme called search efficient privacy-preserving location-sharing (SELS) system. In our scheme, we create a new approach named associated grids to improve the efficiency of location-sharing systems while maintaining users’ privacy. In addition, by setting the user-defined access control policy proposed in our scheme, users’ flexible privacy-preserving requirements can be satisfied. Detailed complexity and security analysis show that the proposed scheme is a practical and efficient privacy-preserving solution. Extensive simulations are performed to validate the effectiveness and performance of our scheme.

scholarly journals Privacy-Preserving Fingerprint Authentication Using D-H Key Exchange and Secret Sharing

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Huiyong Wang ◽  
Mingjun Luo ◽  
Yong Ding
Keyword(s):  
Secret Sharing ◽  
Private Information ◽  
Data Privacy ◽  
Security Analysis ◽  
Privacy Preserving ◽  
Key Exchange ◽  
Security And Privacy ◽  
Sensitive Information ◽  
Biometric Data ◽  
Diffie Hellman

Biometric based remote authentication has been widely deployed. However, there exist security and privacy issues to be addressed since biometric data includes sensitive information. To alleviate these concerns, we design a privacy-preserving fingerprint authentication technique based on Diffie-Hellman (D-H) key exchange and secret sharing. We employ secret sharing scheme to securely distribute fragments of critical private information around a distributed network or group, which softens the burden of the template storage center (TSC) and the users. To ensure the security of template data, the user’s original fingerprint template is stored in ciphertext format in TSC. Furthermore, the D-H key exchange protocol allows TSC and the user to encrypt the fingerprint template in each query using a random one-time key, so as to protect the user’s data privacy. Security analysis indicates that our scheme enjoys indistinguishability against chosen-plaintext attacks and user anonymity. Through experimental analysis, we demonstrate that our scheme can provide secure and accurate remote fingerprint authentication.

scholarly journals Efficient Secure Multiparty Computation Protocol for Sequencing Problem over Insecure Channel

2013 ◽  
Vol 2013 ◽  
pp. 1-5 ◽  
Author(s):  
Yi Sun ◽  
Qiaoyan Wen ◽  
Yudong Zhang ◽  
Hua Zhang ◽  
Zhengping Jin
Keyword(s):  
Homomorphic Encryption ◽  
Privacy Preserving ◽  
Secure Multiparty Computation ◽  
Online Auction ◽  
Multiparty Computation ◽  
Sequencing Problem ◽  
The Core ◽  
Secure Protocol ◽  
Core Issue

As a powerful tool in solving privacy preserving cooperative problems, secure multiparty computation is more and more popular in electronic bidding, anonymous voting, and online auction. Privacy preserving sequencing problem which is an essential link is regarded as the core issue in these applications. However, due to the difficulties of solving multiparty privacy preserving sequencing problem, related secure protocol is extremely rare. In order to break this deadlock, this paper first presents an efficient secure multiparty computation protocol for the general privacy-preserving sequencing problem based on symmetric homomorphic encryption. The result is of value not only in theory, but also in practice.

Privacy-preserving raw data collection without a trusted authority for IoT

2019 ◽  
Vol 148 ◽  
pp. 340-348 ◽  
Author(s):  
Yi-Ning Liu ◽  
Yan-Ping Wang ◽  
Xiao-Fen Wang ◽  
Zhe Xia ◽  
Jing-Fang Xu
Keyword(s):  
Data Collection ◽  
Privacy Preserving ◽  
Raw Data

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 Study of privacy-preserving framework for cloud storage

2011 ◽  
Vol 8 (3) ◽  
pp. 801-819 ◽  
Author(s):  
Huang Ruwei ◽  
Gui Xiaolin ◽  
Yu Si ◽  
Zhuang Wei
Keyword(s):  
Data Storage ◽  
Cloud Storage ◽  
Security Analysis ◽  
Bloom Filter ◽  
Data Access ◽  
Data Retrieval ◽  
Privacy Preserving ◽  
Index Structure ◽  
Structure Generation ◽  
Access Right

In order to implement privacy-preserving, efficient and secure data storage and access environment of cloud storage, the following problems must be considered: data index structure, generation and management of keys, data retrieval, treatments of change of users? access right and dynamic operations on data, and interactions among participants. To solve those problems, the interactive protocol among participants is introduced, an extirpation-based key derivation algorithm (EKDA) is designed to manage the keys, a double hashed and weighted Bloom Filter (DWBF) is proposed to retrieve the encrypted keywords, which are combined with lazy revocation, multi-tree structure, asymmetric and symmetric encryptions, which form a privacypreserving, efficient and secure framework for cloud storage. The experiment and security analysis show that EKDA can reduce the communication and storage overheads efficiently, DWBF supports ciphertext retrieval and can reduce communication, storage and computation overhead as well, and the proposed framework is privacy preserving while supporting data access efficiently.

scholarly journals An Efficient and Privacy-Preserving Biometric Identification Scheme Based on the FITing-Tree

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Xiaopeng Yang ◽  
Hui Zhu ◽  
Songnian Zhang ◽  
Rongxing Lu ◽  
Xuesong Gao
Keyword(s):  
Homomorphic Encryption ◽  
Security Analysis ◽  
Privacy Preserving ◽  
Biometric Identification ◽  
Large Dataset ◽  
Biometric Data ◽  
Communication Costs ◽  
Identification Scheme ◽  
Biometric Template ◽  
Cloud Servers

Biometric identification services have been applied to almost all aspects of life. However, how to securely and efficiently identify an individual in a huge biometric dataset is still very challenging. For one thing, biometric data is very sensitive and should be kept secure during the process of biometric identification. On the other hand, searching a biometric template in a large dataset can be very time-consuming, especially when some privacy-preserving measures are adopted. To address this problem, we propose an efficient and privacy-preserving biometric identification scheme based on the FITing-tree, iDistance, and a symmetric homomorphic encryption (SHE) scheme with two cloud servers. With our proposed scheme, the privacy of the user’s identification request and service provider’s dataset is guaranteed, while the computational costs of the cloud servers in searching the biometric dataset can be kept at an acceptable level. Detailed security analysis shows that the privacy of both the biometric dataset and biometric identification request is well protected during the identification service. In addition, we implement our proposed scheme and compare it to a previously reported M-Tree based privacy-preserving identification scheme in terms of computational and communication costs. Experimental results demonstrate that our proposed scheme is indeed efficient in terms of computational and communication costs while identifying a biometric template in a large dataset.

Toward Responsible AI: An Overview of Federated Learning for User-centered Privacy-preserving Computing

2021 ◽  
Vol 11 (3-4) ◽  
pp. 1-22
Author(s):  
Qiang Yang
Keyword(s):  
Private Information ◽  
High Performance ◽  
Privacy Preserving ◽  
Security And Privacy ◽  
Brute Force ◽  
New Paradigm ◽  
User Privacy ◽  
Data Governance ◽  
Incentive Mechanisms ◽  
Rule Out

With the rapid advances of Artificial Intelligence (AI) technologies and applications, an increasing concern is on the development and application of responsible AI technologies. Building AI technologies or machine-learning models often requires massive amounts of data, which may include sensitive, user private information to be collected from different sites or countries. Privacy, security, and data governance constraints rule out a brute force process in the acquisition and integration of these data. It is thus a serious challenge to protect user privacy while achieving high-performance models. This article reviews recent progress of federated learning in addressing this challenge in the context of privacy-preserving computing. Federated learning allows global AI models to be trained and used among multiple decentralized data sources with high security and privacy guarantees, as well as sound incentive mechanisms. This article presents the background, motivations, definitions, architectures, and applications of federated learning as a new paradigm for building privacy-preserving, responsible AI ecosystems.

Sign in / Sign up

Export Citation Format

Share Document