Protecting privacy through distributed computation in multi-agent decision making

DOI10.1613/JAIR.3983zbMATH Open1270.68273arXiv1402.0589OpenAlexW3102199432WikidataQ129489520 ScholiaQ129489520MaRDI QIDQ2846567FDOQ2846567

Authors: Thomas Léauté, Boi Faltings 

Publication date: 6 September 2013

Published in: The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1402.0589

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Agent technology and artificial intelligence (68T42) Distributed algorithms (68W15)

Cited In (12)

• Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
• Privacy Preserving Collaborative Computing: Heterogeneous Privacy Guarantee and Efficient Incentive Mechanism
• Privacy in Networks of Interacting Agents
• Privacy preserving solution of DCOPs by mediation
• PC-SyncBB: a privacy preserving collusion secure DCOP algorithm
• On privacy vs. cooperation in multi-agent systems
• Secure distributed constraint satisfaction: reaching agreement without revealing private information
• A distributed protocol for privacy preserving aggregation with non-permanent participants
• Scheduling of Earth observing satellites using distributed constraint optimization
• Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts
• Privacy stochastic games in distributed constraint reasoning
• Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs

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)