Privacy-Preserving Multi-agent Constraint Satisfaction

12 years 10 months ago
Privacy-Preserving Multi-agent Constraint Satisfaction
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context involving multiple agents, and protecting privacy of information among them is often desirable. Secure multiparty computation (SMC) provides methods that in principle allow such computation without leaking any information. However, it does not consider the issue of keeping agents’ decisions private from one another. In this paper, we show an algorithm that uses SMC in distributed computation to satisfy this objective. Keywords-distributed constraint satisfaction; privacy; secure multiparty computation; homomorphic encryption.
Thomas Léauté, Boi Faltings
Added 20 May 2010
Updated 20 May 2010
Type Conference
Year 2009
Where CSE
Authors Thomas Léauté, Boi Faltings
Comments (0)