Search
Search Results
-
Explainable machine learning models with privacy
The importance of explainable machine learning models is increasing because users want to understand the reasons behind decisions in data-driven...
-
User Personalized Location k Anonymity Privacy Protection Scheme with Controllable Service Quality
The existing location privacy protection methods only provide the privacy protection parameter k for users to choose to achieve their personalized...
-
THC-DFECC-based privacy preserved smart contract creation for cloud data security
Currently, cloud services have become a novel business model for information services owing to the rapid development of Cloud Computing (CC)...
-
Dimension-aware under spatiotemporal constraints: an efficient privacy-preserving framework with peak density clustering
Location-based service (LBS) is one of the most popular applications in 5G environment. Users can enjoy plenty of intelligent services, but serious...
-
On the Vulnerability and Generality of K–Anonymity Location Privacy Under Continuous LBS Requests
With the development of personal communication devices, location-based services have been widely used. However, the risk of location information...
-
DPPS: A novel dual privacy-preserving scheme for enhancing query privacy in continuous location-based services
Since smartphones embedded with positioning systems and digital maps are widely used, location-based services (LBSs) are rapidly growing in...
-
An efficient federated learning based intrusion detection system using LS2DNN with PBKA based lightweight privacy preservation in cloud server
To execute seamless computing along with information sharing, Cloud Computing (CC) plays an important role in measurable resource sharing. But, owing...
-
Efficient approximation and privacy preservation algorithms for real time online evolving data streams
Because of the processing of continuous unstructured large streams of data, mining real-time streaming data is a more challenging research issue than...
-
HAkAu: hybrid algorithm for effective k-automorphism anonymization of social networks
Online social network datasets contain a large amount of various information about their users. Preserving users’ privacy while publishing or sharing...
-
Anonymous location sharing in urban area mobility
This work studies the location-privacy preserving location update in the context of data-centric people mobility applications. The mobility model...
-
Protection of data privacy from vulnerability using two-fish technique with Apriori algorithm in data mining
The confidential data is mainly managed by creating passwords, tokens, and unique identifiers in an authorized manner. These records must be kept in...
-
Mirrored Commitment: Fixing “Randomized Partial Checking” and Applications
Randomized Partial Checking (RPC) [16] was proposed by Jakobsson, Juels, and Rivest and attracted attention as an efficient method of verifying the...
-
Set-Based Adaptive Distributed Differential Evolution for Anonymity-Driven Database Fragmentation
By breaking sensitive associations between attributes, database fragmentation can protect the privacy of outsourced data storage. Database...
-
Improving Time Complexity and Utility of k-anonymous Microaggregation
For research in medicine, economics and social sciences specific data of individuals is needed. Thus it should be publicly available, but this should...
-
Anonymous Public Key Encryption Under Corruptions
Anonymity of public key encryption (PKE) requires that, in a multi-user scenario, the PKE ciphertexts do not leak information about which public keys...
-
Towards Quantifying the Privacy of Redacted Text
In this paper we propose use of a k-anonymity-like approach for evaluating the privacy of redacted text. Given a piece of redacted text we use a...
-
Face De-identification: Safeguarding Identities in the Digital Era
This book provides state-of-the-art Face De-Identification techniques and privacy protection methods, while highlighting the challenges faced in...
-
Variants of Euclidean k-Center Clusterings
Fix two constant integers k and r. Given a set P of n points on a plane, the Euclidean k-center r-gather clustering problem is the problem to compute...
-
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms
This article addresses election in fully anonymous systems made up of n asynchronous processes that communicate through atomic read-write registers...
-
Algorithmic Protection Study Based on a Virtual Location
With the development of big data technology and wireless communication technology, Internet-of-Vehicles (IOV) has been widely used. In order to...