{"type":"ScholarlyArticle","title":"Max-Sum Goes Private","authors":[{"name":"Tamir Tassa","slug":"tamir-tassa","given":"Tamir","family":"Tassa","affiliation":""},{"name":"Roie Zivan","slug":"roie-zivan","given":"Roie","family":"Zivan","affiliation":""},{"name":"Tal Grinshpoun","slug":"tal-grinshpoun","given":"Tal","family":"Grinshpoun","affiliation":""}],"abstract":"As part of the ongoing effort of designing secure DCOP algorithms, we propose P-Max-Sum, the first private algorithm that is based on Max-Sum. The proposed algorithm has multiple agents preforming the role of each node in the factor graph, on which the Max-Sum algorithm operates. P-Max-Sum preserves three types of privacy: topology privacy, constraint privacy, and assignment/decision privacy.By allowing a single call to a trusted coordinator, P-Max-Sum also preserves agent privacy. The two main cryptographic means that enable this privacy preservation are secret sharing and homomorphic encryption. Our experiments on structured and realistic problems show that the overhead of privacy preservation in terms of runtime is reasonable.","doi":null,"url":"https://ijcai.org/proceedings/2015/66","pdf":"https://ijcai.org/proceedings/2015/0066.pdf","markdown":"https://ijcai.org/proceedings/2015/66.md","bibtex":"https://ijcai.org/proceedings/2015/bibtex/66","volume":{"slug":"2015","title":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2015","url":"https://ijcai.org/proceedings/2015/","year":2015,"location":"Buenos Aires, Argentina","dates":"25–31 July 2015","editors":"Qiang Yang and Michael Wooldridge","isbn":"978-1-57735-738-4","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Distributed Search/CSP/Optimization","track":"Main Track","number":66,"pages":{"first":425,"last":430},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}