Privacy Guarantees through Distributed Constraint Satisfaction
Abstract. In Distributed Constraint Satisfaction Problems, agents often desire to ﬁnd a solution while revealing as little as possible about their variables and constraints. So far, most algorithms for DisCSP do not guarantee privacy of this information. This paper describes some simple obfuscation techniques that can be used with DisCSP algorithms such as DPOP, and provide sensible privacy guarantees based on the distributed solving process without sacriﬁcing its eﬃciency.