Photo by dtopkin1 from unsplash
In this article, we study the problem of summation evaluation of secrets. The secrets are distributed over a network of nodes that form a ring graph. Privacy-preserving iterative protocols for… Click to show full abstract
In this article, we study the problem of summation evaluation of secrets. The secrets are distributed over a network of nodes that form a ring graph. Privacy-preserving iterative protocols for computing the sum of the secrets are proposed, which are resilient against dynamic node join and leave situations. Theoretic bounds are derived regarding the utility and accuracy, and the proposed protocols are shown to comply with differential privacy requirements. Based on utility, accuracy, and privacy, we also provide guidance on appropriate selections of random noise parameters. Additionally, a few numerical examples that demonstrate their effectiveness and superiority are provided.
Journal Title: IEEE Intelligent Systems
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!