Protecting Privacy through Distributed Computation in Multi-agent Decision Making

02/04/2014
by   Thomas Leaute, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2019

Privacy of Existence of Secrets: Introducing Steganographic DCOPs and Revisiting DCOP Frameworks

Here we identify a type of privacy concern in Distributed Constraint Opt...
research
09/27/2011

Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems

Distributed Constraint Satisfaction (DCSP) has long been considered an i...
research
10/10/2019

AI for Explaining Decisions in Multi-Agent Environments

Explanation is necessary for humans to understand and accept decisions m...
research
03/13/2013

Possibilistic Constraint Satisfaction Problems or "How to handle soft constraints?"

Many AI synthesis problems such as planning or scheduling may be modeliz...
research
04/16/2018

Distributed, Private, and Derandomized Allocation Algorithm for EV Charging

Efficient resource allocation is challenging when privacy of users is im...
research
08/31/2020

CenterYou: A cloud-based Approach to Simplify Android Privacy Management

With mobile applications and associated services becoming increasingly p...
research
11/30/2022

Differentially Private ADMM-Based Distributed Discrete Optimal Transport for Resource Allocation

Optimal transport (OT) is a framework that can guide the design of effic...

Please sign up or login with your details

Forgot password? Click here to reset