back to main page

Privacy-Preserving Multi-agent Constraint Satisfaction

Thomas Léauté, Boi Faltings

Published in Proceedings of the 2009 IEEE International Conference on PrivAcy, Security, riSk And Trust (PASSAT'09), 2009


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.

full text in PDF

    Address = {Vancouver, British Columbia},
    Author = {Thomas L{\'e}aut{\'e} and Boi Faltings},
    Booktitle = {Proceedings of the 2009 IEEE International Conference on {PrivAcy}, {Security}, {riSk} and {Trust} (PASSAT'09)},
    Month = {August~29--31},
    Publisher = {IEEE Computer Society Press},
    Title = {Privacy-Preserving Multi-agent Constraint Satisfaction},
    Url = {},
    Year = {2009}