SSDPOP: improving the privacy of DCOP with secret sharing

Multi-agent systems designed to work collaboratively with groups of people typically require private information that people will entrust to them only if they have assurance that this information will be protected. Although Distributed Constraint Optimization (DCOP) has emerged as a prominent technique for multiagent coordination, existing algorithms for solving DCOP problems do not adeqately protect agents’ privacy. This paper analyzes privacy protection and loss in existing DCOP algorithms. It presents a new algorithm, SSDPOP, which augments a prominent DCOP algorithm (DPOP) with secret sharing techniques. This approach significantly reduces privacy loss, while preserving the structure of the DPOP algorithm and introducing only minimal computational overhead. Results show that SSDPOP reduces privacy loss by 29-88% on average over DPOP. Categories and Subject Descriptors I.2.11 [Artificial Intelligence]: Distributed Artificial Intelligence— Intelligent agents, Multiagent syste...

• Type: Conference
• Year: 2007
• Where: ATAL
• Authors: Rachel Greenstadt, Barbara J. Grosz, Michael D. Smith
• Keywords: ATAL 2007, DCOP, Dcop Algorithm, Prominent Dcop Algorithm