A Privacy-preserving and Energy-efficient Offloading Algorithm based on Lyapunov Optimization
نویسندگان
چکیده
منابع مشابه
Privacy-preserving Decentralized Optimization Based on ADMM
In this paper, we address the problem of privacypreservation in decentralized optimization, where N agents cooperatively minimize an objective function that is the sum of N strongly convex functions private to these individual agents. In most existing decentralized optimization approaches, participating agents exchange and disclose estimates explicitly, which may not be desirable when the estim...
متن کاملAn algorithm for efficient privacy-preserving item-based collaborative filtering
Collaborative filtering (CF) methods are widely adopted by existing recommender systems, which can analyze and predict user ‘‘ratings’’ or ‘‘preferences’’ of newly generated items based on user historical behaviors. However, privacy issue arises in this process as sensitive user private data are collected by the recommender server. Recently proposed privacy-preserving collaborative filtering (P...
متن کاملA privacy-preserving algorithm for distributed constraint optimization
Distributed constraint optimization problems enable the representation of many combinatorial problems that are distributed by nature. An important motivation for such problems is to preserve the privacy of the participating agents during the solving process. The present paper introduces a novel privacy-preserving algorithm for this purpose. The proposed algorithm requires a secure solution of s...
متن کاملPrivacy - Preserving Collaborative Optimization
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ii PREFACE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv ACKNOWLEDGEMENTS. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v LIST OF TABLES. . . . . . . . . . . . . ....
متن کاملEfficient Privacy Preserving Distributed Clustering Based on Secret Sharing
In this paper, we propose a privacy preserving distributed clustering protocol for horizontally partitioned data based on a very efficient homomorphic additive secret sharing scheme. The model we use for the protocol is novel in the sense that it utilizes two non-colluding third parties. We provide a brief security analysis of our protocol from information theoretic point of view, which is a st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ksii Transactions on Internet and Information Systems
سال: 2022
ISSN: ['1976-7277', '2288-1468']
DOI: https://doi.org/10.3837/tiis.2022.08.002