A Comprehensive Comparison of Multiparty Secure Additions with Differential Privacy.

Differential privacy is often used in location privacy protection because of its strict reasoning and proof privacy guarantee. When users make continuous location query, it will cause noise superposition, which leads to the decline of query accuracy. At present, although differential privacy based on rule tree structure can reduce the query error, it will generate a lot of invalid zero nodes. The data structure is too large, and more improvement in the query accuracy can be further investigated. In this paper, we proposed a differential privacy location privacy protection method based on generative adversary network. Firstly, the definition of location data privacy protection under differential privacy mechanism is given, and then resume density aware network under differential privacy mechanism. Based on density aware network, the privacy protection problem of location data can be transformed into the distribution of fitting trajectory length. Finally, we use Markov chain to generate a new trajectory, and introduce the generative adversarial network to construct a set differential privacy protection method. Compared with other methods to improve the accuracy of differential privacy query, this method can effectively reduce the problem of query accuracy decline caused by noise superposition in continuous query, and can adapt to lbs location query service in different density environments.KeywordsGenerative adversarial networkLocation differencePrivacy protectionMarkov chainDensity aware network

Differential privacy mechanisms have been proposed to guarantee the privacy of individuals in various types of statistical information. When constructing a probabilistic mechanism to satisfy differential privacy, it is necessary to consider the impact of an arbitrary record on its statistics, i.e., sensitivity, but there are situations where sensitivity is difficult to derive. In this paper, we first summarize the situations in which it is difficult to derive sensitivity in general, and then propose a definition equivalent to the conventional definition of differential privacy to deal with them. This definition considers neighboring datasets as in the conventional definition. Therefore, known differential privacy mechanisms can be applied. Next, as an example of the difficulty in deriving sensitivity, we focus on the t-test, a basic tool in statistical analysis, and show that a concrete differential privacy mechanism can be constructed in practice. Our proposed definition can be treated in the same way as the conventional differential privacy definition, and can be applied to cases where it is difficult to derive sensitivity.

Artificial Intelligence (AI) has attracted a large amount of attention in recent years. However, several new problems, such as privacy violations, security issues, or effectiveness, have been emerging. Differential privacy has several attractive properties that make it quite valuable for AI, such as privacy preservation, security, randomization, composition, and stability. Therefore, this paper presents differential privacy mechanisms for multi-agent systems, reinforcement learning, and knowledge transfer based on those properties, which proves that current AI can benefit from differential privacy mechanisms. In addition, the previous usage of differential privacy mechanisms in private machine learning, distributed machine learning, and fairness in models is discussed, bringing several possible avenues to use differential privacy mechanisms in AI. The purpose of this paper is to deliver the initial idea of how to integrate AI with differential privacy mechanisms and to explore more possibilities to improve AIs performance.

The increasing complexity and dynamic nature of cyber threats in zero-trust architectures necessitates a more adaptive approach to differential privacy mechanisms. Current static privacy solutions fail to adequately address evolving threat landscapes, leading to potential vulnerabilities and reduced system efficiency. This research presents a novel adaptive differential privacy framework that dynamically adjusts privacy parameters based on real-time threat assessment within zero-trust environments. Our solution introduces an intelligent privacy budget optimization algorithm that continuously evaluates threat levels and automatically recalibrates privacy mechanisms to maintain optimal protection while minimizing performance overhead. Through extensive experimental evaluation using real-world datasets and simulated attack scenarios, we demonstrate that our adaptive approach achieves a 47% improvement in privacy preservation compared to static mechanisms, while maintaining system performance within acceptable thresholds. The framework successfully detects and responds to 94% of emerging threats within milliseconds, dynamically adjusting privacy parameters to counter identified risks. Our results show that the proposed solution effectively balances privacy protection, system performance, and threat responsiveness in zero-trust architectures. Additionally, we provide comprehensive implementation guidelines and identified key challenges for deploying adaptive differential privacy mechanisms in production environments. This research contributes to the advancement of privacy-preserving systems by introducing a practical, scalable solution for managing differential privacy in dynamic threat landscapes.

New generation head-mounted displays, such as VR and AR glasses, are coming into the market with already integrated eye tracking and are expected to enable novel ways of human-computer interaction in numerous applications. However, since eye movement properties contain biometric information, privacy concerns have to be handled properly. Privacy-preservation techniques such as differential privacy mechanisms have recently been applied to eye movement data obtained from such displays. Standard differential privacy mechanisms; however, are vulnerable due to temporal correlations between the eye movement observations. In this work, we propose a novel transform-coding based differential privacy mechanism to further adapt it to the statistics of eye movement feature data and compare various low-complexity methods. We extend the Fourier perturbation algorithm, which is a differential privacy mechanism, and correct a scaling mistake in its proof. Furthermore, we illustrate significant reductions in sample correlations in addition to query sensitivities, which provide the best utility-privacy trade-off in the eye tracking literature. Our results provide significantly high privacy without any essential loss in classification accuracies while hiding personal identifiers.

OPTDP: Towards optimal personalized trajectory differential privacy for trajectory data publishing

Sentence embeddings represent the meaning of a given sentence using a fixed dimensional vector. Different approaches have been proposed in the Natural Language Processing (NLP) community for learning encoders that can produce accurate sentence embeddings that perform well for diverse downstream tasks requiring sentence representations. Despite prior work focusing mainly on creating accurate sentence embeddings, how to keep private the sensitive information contained in the sentences remains an unexplored research problem. In this article, we propose Covering Metric Analytic Gaussian (CMAG), a covering metric Differential Privacy (DP) mechanism for sentence embeddings such that minimal random noise is added to a set of sentence embeddings produced by an encoder to protect the private information expressed in those sentences. Given a sentence embedding s , CMAG considers the Mahalanobis distance between s and the other sentence embeddings s ’ in the local neighbourhood of s to determine the minimal amount of random noise that must be added to s to obtain provable metric DP guarantees. Experimental results show that the proposed DP mechanism protects private information better than previously proposed DP mechanisms while reporting good performance in a broad range of downstream NLP tasks.

As machine learning systems become increasingly prevalent in privacy-sensitive domains, the need for training high-performance models while preserving individual privacy has become paramount. This paper presents a comprehensive analysis of federated learning combined with differential privacy mechanisms, addressing the fundamental tension between model utility and privacy protection. We propose an adaptive noise calibration framework that dynamically adjusts privacy parameters based on model convergence patterns and client heterogeneity. Through extensive experiments on benchmark datasets, we demonstrate that our approach achieves superior privacy-utility trade-offs compared to existing methods, maintaining competitive model accuracy while providing strong theoretical privacy guarantees. Our results show that careful calibration of differential privacy parameters can reduce the performance degradation typically associated with privacy-preserving federated learning from 15-20% to 5-8% across various machine learning tasks.

The logistic model is a very elementary and important model in the field of machine learning. In this article, an efficient differential privacy logistic classification mechanism is proposed. The proposed mechanism is better than object function perturbation mechanism in terms of running time and accuracy. Regarding accuracy, the proposed mechanism's accuracy is almost the same as the no differential privacy (non-dp) mechanism, and the proposed mechanism is better than that of the object function perturbation mechanism in both the test accuracy and the train accuracy. As for the running time of the training model, the proposed mechanism is better than the object function mechanism and is the same as the non-dp mechanism.

The primary motivation is to address difficulties in data interpretation or a reduction in model accuracy. Although differential privacy can provide data privacy guarantees, it also creates problems. Thus, we need to consider the noise setting for differential privacy is currently inconclusive. This paper’s main contribution is finding a balance between privacy and accuracy. The training data of deep learning models may contain private or sensitive corporate information. These may be dangerous to attacks, leading to privacy data leakage for data sharing. Many strategies are for privacy protection, and differential privacy is the most widely applied one. Google proposed a federated learning technology to solve the problem of data silos in 2016. The technology can share information without exchanging original data and has made significant progress in the medical field. However, there is still the risk of data leakage in federated learning; thus, many models are now used with differential privacy mechanisms to minimize the risk. The data in the financial field are similar to medical data, which contains a substantial amount of personal data. The leakage may cause uncontrollable consequences, making data exchange and sharing difficult. Let us suppose that differential privacy applies to the financial field. Financial institutions can provide customers with higher value and personalized services and automate credit scoring and risk management. Unfortunately, the economic area rarely applies differential privacy and attains no consensus on parameter settings. This study compares data security with non-private and differential privacy financial visual models. The paper finds a balance between privacy protection with model accuracy. The results show that when the privacy loss parameter ϵ is between 12.62 and 5.41, the privacy models can protect training data, and the accuracy does not decrease too much.

The essential issues of data silos and user privacy leakage could be relaxed substantially by the development of the federated learning (FL) architecture. In a collaborative multi-user modeling situation, malicious attackers could still use user gradient information to infer the danger of user privacy. To mitigate the issue of privacy leakage, differential privacy (DP) mechanism is integrated into the federated learning framework to assess privacy loss and introduce noise to the local model parameters of users. In addition, in order to minimize information leakage and provide better noise rejection, Rényi differential privacy (RDP) is introduced as a privacy metric, which improves the balance between model privacy and utility. Owing to the unknown target model and limited communication cost resources, a client-based adaptive learning algorithm is developed in which each local model parameter is adaptively updated during local iterations to accelerate model convergence and avoid model overfitting. The experimental results reveal that the client-based adaptive federation learning model in this paper outperforms the classic model at a fixed communication cost, is more robust to noise resistance and variable hyperparameter settings, and provides more accurate privacy protection during transmission.

By taking advantage of Deep Learning (DL), Received signal strength (RSS) fingerprint-based indoor localization has attracted more attention. Training DL models require an immense amount of RSS samples, and crowdsourcing has been another way to collect data by users. Recently, some researchers apply Federated Learning (FL) in indoor localization instead of crowdsourcing for privacy protection. However, more practical issues are still not considered.For further guaranteeing privacy and deploying systems in real time, this paper proposes OPFL, a privacy-preserved online personalized federated learning framework for fingerprint-based indoor localization. In OPFL, users update model parameters and collect new labeled samples meanwhile. By adding artificial noise based on the Differential Privacy (DP) mechanism, it is harder for attackers to infer information. Besides, the deterioration of models results from DP is mitigating by applying the personalized algorithm. The experimental results show that under the noise perturbing, the performance of OPFL testing on the local test set is far better than the conventional federated averaging algorithm (FedAvg), and is even close to the centralized training.

A verifiable scheme for differential privacy based on zero-knowledge proofs

Location data is frequently collected from populations and shared in aggregate form to guide policy and decision making. However, the prevalence of aggregated data also raises the privacy concern of membership inference attacks (MIAs). MIAs infer whether an individual's data contributed to the aggregate release. Although effective MIAs have been developed for aggregate location data, these require access to an extensive auxiliary dataset of individual traces over the same locations, which are collected from a similar population. This assumption is often impractical given common privacy practices surrounding location data. To measure the risk of an MIA performed by a realistic adversary, we develop the first Zero Auxiliary Knowledge (ZK) MIA on aggregate location data, which eliminates the need for an auxiliary dataset of real individual traces. Instead, we develop a novel synthetic approach, such that suitable synthetic traces are generated from the released aggregate. We also develop methods to correct for bias and noise, to show that our synthetic-based attack is still applicable when privacy mechanisms are applied prior to release. Using two large-scale location datasets, we demonstrate that our ZK MIA matches the state-of-the-art Knock-Knock (KK) MIA across a wide range of settings, including popular implementations of differential privacy (DP) and suppression of small counts. Furthermore, we show that ZK MIA remains highly effective even when the adversary only knows a small fraction (10%) of their target's location history. This demonstrates that effective MIAs can be performed by realistic adversaries, highlighting the need for strong DP protection.

Motivated by traffic analysis attacks based on the packet sizes and timing information in the Internet of Things (IoT) networks, we establish a rigorous event-level differential privacy (DP) model on infinite packet streams. We propose a traffic shaper satisfying a first-come-first-served queuing discipline that outputs traffic dependent on the input using a DP mechanism. We show that in special cases the proposed mechanism recovers existing shapers which standardize the output independently from the input. To find the optimal shapers for given levels of privacy and transmission efficiency, we formulate the constrained problem of minimizing the expected delay per packet and propose using the expected queue size across time as a proxy. We further show that the constrained minimization is a convex program. We demonstrate the effect of shapers on both synthetic data and packet traces from actual IoT devices. The experimental results reveal inherent privacy-overhead tradeoffs: more shaping overhead provides better privacy protection. Under the same privacy level, there is a tradeoff between dummy traffic and delay. When shaping heavier or less bursty traffic, all shapers become more overhead-efficient. We also show that increased traffic from more IoT devices makes guaranteeing event-level privacy easier. The DP shaper offers tunable privacy that is invariant with the change in the input traffic distribution and has an advantage in handling burstiness over traffic-independent shapers. This approach accommodates heterogeneous network conditions and user demands in privacy and overhead.