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.


Published in:
Proceedings of the 2009 IEEE International Conference on PrivAcy, Security, riSk and Trust (PASSAT'09)
Presented at:
2009 IEEE International Conference on PrivAcy, Security, riSk and Trust (PASSAT'09), Vancouver, British Columbia, August 29-31, 2009
Year:
2009
Publisher:
IEEE Computer Society Press
Keywords:
Laboratories:




 Record created 2010-02-17, last modified 2018-09-13

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)