SSDPOP: Improving the Privacy of DCOP with Secret Sharing

DSpace/Manakin Repository

SSDPOP: Improving the Privacy of DCOP with Secret Sharing

Citable link to this page


Title: SSDPOP: Improving the Privacy of DCOP with Secret Sharing
Author: Greenstadt, Rachel; Smith, Michael; Grosz, Barbara

Note: Order does not necessarily reflect citation order of authors.

Citation: Smith, Michael, Barbara Grosz, and Rachel Greenstadt. 2007. SSDPOP: Improving the Privacy of DCOP with Secret Sharing. In Proceedings of the Sixth International Joint Conference on Autonomous Agents and Multiagent Systems 2007, AAMAS '07: May 14 - 18, 2007, Honolulu, Hawaii, ed. IFAAMAS, 1091-1093. Red Hook, NY: Curran.
Full Text & Related Files:
Abstract: 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.
Published Version:
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at
Citable link to this page:
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search