Private computation of polynomials over networks
From MaRDI portal
Abstract: This study concentrates on preserving privacy in a network of agents where each agent seeks to evaluate a general polynomial function over the private values of her immediate neighbors. We provide an algorithm for the exact evaluation of such functions while preserving privacy of the involved agents. The solution is based on a reformulation of polynomials and adoption of two cryptographic primitives: Paillier as a Partially Homomorphic Encryption scheme and multiplicative-additive secret sharing. The provided algorithm is fully distributed, lightweight in communication, robust to dropout of agents, and can accommodate a wide class of functions. Moreover, system theoretic and secure multi-party conditions guaranteeing the privacy preservation of an agent's private values against a set of colluding agents are established. The theoretical developments are complemented by numerical investigations illustrating the accuracy of the algorithm and the resulting computational cost.
Recommendations
- Verifiable private polynomial evaluation
- Computationally private randomizing polynomials and their applications
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme
- Multi-Party Secure Computation of Multi-Variable Polynomials
- Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
- Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
- Private Computations over the Integers
- Symmetric Private Polynomial Computation From Lagrange Encoding
- Privacy-preserving verifiable delegation of polynomial and matrix functions
Cites work
- A Differential Game Approach to Multi-agent Collision Avoidance
- A system-theoretic framework for privacy preservation in continuous-time multiagent dynamics
- An operator splitting approach for distributed generalized Nash equilibria computation
- Cloud-Based Quadratic Optimization With Partially Homomorphic Encryption
- Design of Privacy-Preserving Dynamic Controllers
- Differentially private average consensus: obstructions, trade-offs, and optimal algorithm design
- Differentially Private Distributed Convex Optimization via Functional Perturbation
- Differentially Private Filtering
- Distributed algorithms for reaching consensus on general functions
- Encrypted Control for Networked Systems: An Illustrative Introduction and Current Challenges
- Encrypted polynomial control based on tailored two‐party computation
- Gather-and-broadcast frequency control in power systems
- Homomorphic encryption for arithmetic of approximate numbers
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- Introduction to modern cryptography
- Modular control under privacy protection: fundamental trade-offs
- Privacy Preserving Average Consensus
- Privacy preserving distributed optimization using homomorphic encryption
- Privacy-Preserving Distributed Averaging via Homomorphically Encrypted Ratio Consensus
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Secure and privacy preserving consensus for second-order systems based on Paillier encryption
- Secure and Privacy-Preserving Consensus
- Secure and Private Implementation of Dynamic Controllers Using Semihomomorphic Encryption
- Symmetries and Isomorphisms for Privacy in Control Over the Cloud
- Theory of uniform approximation of functions by polynomials. Transl. from the Russian by Dimitry Malyshev, Peter V. Malyshev and Vladimir V. Gorunovich
- Tutorials on the foundations of cryptography. Dedicated to Oded Goldreich
Cited in
(9)- Private multiplication over finite fields
- Privacy preserving distributed optimization using homomorphic encryption
- Privacy-preserving polynomial interpolation and its applications on predictive analysis
- scientific article; zbMATH DE number 1962807 (Why is no real title available?)
- Private Computations over the Integers
- Encrypted polynomial control based on tailored two‐party computation
- Privacy-preserving set-based estimation using partially homomorphic encryption
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme
- Private computation: k-connected versus 1-connected networks
This page was built for publication: Private computation of polynomials over networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169792)
