Protecting privacy through distributed computation in multi-agent decision making
From MaRDI portal
Publication:2846567
Abstract: As large-scale theft of data from corporate servers is becoming increasingly common, it becomes interesting to examine alternatives to the paradigm of centralizing sensitive data into large databases. Instead, one could use cryptography and distributed computation so that sensitive data can be supplied and processed in encrypted form, and only the final result is made known. In this paper, we examine how such a paradigm can be used to implement constraint satisfaction, a technique that can solve a broad class of AI problems such as resource allocation, planning, scheduling, and diagnosis. Most previous work on privacy in constraint satisfaction only attempted to protect specific types of information, in particular the feasibility of particular combinations of decisions. We formalize and extend these restricted notions of privacy by introducing four types of private information, including the feasibility of decisions and the final decisions made, but also the identities of the participants and the topology of the problem. We present distributed algorithms that allow computing solutions to constraint satisfaction problems while maintaining these four types of privacy. We formally prove the privacy properties of these algorithms, and show experiments that compare their respective performance on benchmark problems.
Recommendations
- Privacy in Networks of Interacting Agents
- Enabling Privacy-Preservation in Decentralized Optimization
- Quantifying privacy in multiagent planning
- Resilient consensus for multi-agent systems subject to differential privacy requirements
- On privacy vs. cooperation in multi-agent systems
- Data and Applications Security XIX
- Dynamics based privacy preservation in decentralized optimization
- A privacy-preserving method to optimize distributed resource allocation
Cited in
(12)- Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
- A distributed protocol for privacy preserving aggregation with non-permanent participants
- On privacy vs. cooperation in multi-agent systems
- Secure distributed constraint satisfaction: reaching agreement without revealing private information
- Scheduling of Earth observing satellites using distributed constraint optimization
- Privacy preserving solution of DCOPs by mediation
- Privacy Preserving Collaborative Computing: Heterogeneous Privacy Guarantee and Efficient Incentive Mechanism
- Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts
- PC-SyncBB: a privacy preserving collusion secure DCOP algorithm
- Privacy stochastic games in distributed constraint reasoning
- Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs
- Privacy in Networks of Interacting Agents
This page was built for publication: Protecting privacy through distributed computation in multi-agent decision making
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2846567)
