PP-LEM: Efficient and Privacy-Preserving Clearance Mechanism for Local Energy Markets

• URL: http://arxiv.org/abs/2411.17758v1
• Date: Tue, 26 Nov 2024 00:22:31 GMT
• Title: PP-LEM: Efficient and Privacy-Preserving Clearance Mechanism for Local Energy Markets
• Authors: Kamil Erdayandi, Mustafa Asan Mustafa,
• Abstract summary: PP-LEM incorporates a novel competitive game-theoretical clearance mechanism, modelled as a Stackelberg Game.<n>Based on this mechanism, a privacy-preserving market model is developed using a partially homomorphic cryptosystem.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we propose a novel Privacy-Preserving clearance mechanism for Local Energy Markets (PP-LEM), designed for computational efficiency and social welfare. PP-LEM incorporates a novel competitive game-theoretical clearance mechanism, modelled as a Stackelberg Game. Based on this mechanism, a privacy-preserving market model is developed using a partially homomorphic cryptosystem, allowing buyers' reaction function calculations to be executed over encrypted data without exposing sensitive information of both buyers and sellers. The comprehensive performance evaluation demonstrates that PP-LEM is highly effective in delivering an incentive clearance mechanism with computational efficiency, enabling it to clear the market for 200 users within the order of seconds while concurrently protecting user privacy. Compared to the state of the art, PP-LEM achieves improved computational efficiency without compromising social welfare while still providing user privacy protection.

Related papers

• A Failure-Free and Efficient Discrete Laplace Distribution for Differential Privacy in MPC [23.428579838658756]
  In MPC-protected distributed computation, sensitive information may still be inferred by MPC participants from the computation output. We propose a discrete and bounded Laplace-inspired perturbation mechanism along with a secure realization of this mechanism using MPC.
  arXiv  Detail & Related papers  (2025-03-10T08:35:16Z)
• Revisiting Locally Differentially Private Protocols: Towards Better Trade-offs in Privacy, Utility, and Attack Resistance [4.5282933786221395]
  Local Differential Privacy (LDP) offers strong privacy protection, especially in settings in which the server collecting the data is untrusted. We introduce a general multi-objective optimization framework for refining LDP protocols. Our framework enables modular and context-aware deployment of LDP mechanisms with tunable privacy-utility trade-offs.
  arXiv  Detail & Related papers  (2025-03-03T12:41:01Z)
• Communication-Efficient and Privacy-Adaptable Mechanism for Federated Learning [33.267664801299354]
  Training machine learning models on decentralized private data via federated learning (FL) poses two key challenges: communication efficiency and privacy protection. We introduce a novel approach called the Communication-Efficient and Privacy-Adaptable Mechanism (CEPAM), achieving both objectives simultaneously. We analyze the trade-offs among user privacy, global utility, and transmission rate of CEPAM by defining appropriate metrics for FL with differential privacy and compression.
  arXiv  Detail & Related papers  (2025-01-21T11:16:05Z)
• TinyML NLP Approach for Semantic Wireless Sentiment Classification [49.801175302937246]
  We introduce split learning (SL) as an energy-efficient alternative, privacy-preserving tiny machine learning (MLTiny) scheme. Our results show that SL reduces processing power and CO2 emissions while maintaining high accuracy, whereas FL offers a balanced compromise between efficiency and privacy.
  arXiv  Detail & Related papers  (2024-11-09T21:26:59Z)
• Privacy-Preserving Billing for Local Energy Markets [1.1823918493146686]
  We propose a privacy-preserving billing protocol for local energy markets (PBP-LEM) that takes into account market participants' energy volume deviations from their bids. PBP-LEM enables a group of market entities to jointly compute participants' bills in a decentralized and privacy-preserving manner without sacrificing correctness.
  arXiv  Detail & Related papers  (2024-04-24T14:12:56Z)
• A Learning-based Declarative Privacy-Preserving Framework for Federated Data Management [23.847568516724937]
  We introduce a new privacy-preserving technique that uses a deep learning model trained using Differentially-Private Descent (DP-SGD) algorithm. We then demonstrate a novel declarative privacy-preserving workflow that allows users to specify "what private information to protect" rather than "how to protect"
  arXiv  Detail & Related papers  (2024-01-22T22:50:59Z)
• Learning Payment-Free Resource Allocation Mechanisms [19.60309632660988]
  We consider the design of mechanisms that limited resources among self-interested agents using neural networks. We contribute a new end-to-end neural network architecture, ExS-Net, that accommodates the idea of "money-burning" for mechanism design without payments.
  arXiv  Detail & Related papers  (2023-11-18T01:21:54Z)
• Theoretically Principled Federated Learning for Balancing Privacy and Utility [61.03993520243198]
  We propose a general learning framework for the protection mechanisms that protects privacy via distorting model parameters. It can achieve personalized utility-privacy trade-off for each model parameter, on each client, at each communication round in federated learning.
  arXiv  Detail & Related papers  (2023-05-24T13:44:02Z)
• A Randomized Approach for Tight Privacy Accounting [63.67296945525791]
  We propose a new differential privacy paradigm called estimate-verify-release (EVR) EVR paradigm first estimates the privacy parameter of a mechanism, then verifies whether it meets this guarantee, and finally releases the query output. Our empirical evaluation shows the newly proposed EVR paradigm improves the utility-privacy tradeoff for privacy-preserving machine learning.
  arXiv  Detail & Related papers  (2023-04-17T00:38:01Z)
• Breaking the Communication-Privacy-Accuracy Tradeoff with $f$-Differential Privacy [51.11280118806893]
  We consider a federated data analytics problem in which a server coordinates the collaborative data analysis of multiple users with privacy concerns and limited communication capability. We study the local differential privacy guarantees of discrete-valued mechanisms with finite output space through the lens of $f$-differential privacy (DP) More specifically, we advance the existing literature by deriving tight $f$-DP guarantees for a variety of discrete-valued mechanisms.
  arXiv  Detail & Related papers  (2023-02-19T16:58:53Z)
• Decentralized Stochastic Optimization with Inherent Privacy Protection [103.62463469366557]
  Decentralized optimization is the basic building block of modern collaborative machine learning, distributed estimation and control, and large-scale sensing. Since involved data, privacy protection has become an increasingly pressing need in the implementation of decentralized optimization algorithms.
  arXiv  Detail & Related papers  (2022-05-08T14:38:23Z)
• MPCLeague: Robust MPC Platform for Privacy-Preserving Machine Learning [5.203329540700177]
  This thesis focuses on designing efficient MPC frameworks for 2, 3 and 4 parties, with at most one corruption and supports ring structures. We propose two variants for each of our frameworks, with one variant aiming to minimise the execution time while the other focuses on the monetary cost.
  arXiv  Detail & Related papers  (2021-12-26T09:25:32Z)
• Distributed Reinforcement Learning for Privacy-Preserving Dynamic Edge Caching [91.50631418179331]
  A privacy-preserving distributed deep policy gradient (P2D3PG) is proposed to maximize the cache hit rates of devices in the MEC networks. We convert the distributed optimizations into model-free Markov decision process problems and then introduce a privacy-preserving federated learning method for popularity prediction.
  arXiv  Detail & Related papers  (2021-10-20T02:48:27Z)
• Exploiting Submodular Value Functions For Scaling Up Active Perception [60.81276437097671]
  In active perception tasks, agent aims to select sensory actions that reduce uncertainty about one or more hidden variables. Partially observable Markov decision processes (POMDPs) provide a natural model for such problems. As the number of sensors available to the agent grows, the computational cost of POMDP planning grows exponentially.
  arXiv  Detail & Related papers  (2020-09-21T09:11:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.