Max-Sum Goes Private
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 425-430.
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.
@inproceedings{ijcai2015p66,
title = {Max-Sum Goes Private},
author = {Tassa, Tamir and Zivan, Roie and Grinshpoun, Tal},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-15}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Qiang Yang and Michael Wooldridge},
pages = {425--430},
year = {2015},
month = {7},
note = {Main Track},
url = {https://ijcai.org/proceedings/2015/66},
}
TY - CPAPER TI - Max-Sum Goes Private AU - Tassa, Tamir AU - Zivan, Roie AU - Grinshpoun, Tal T2 - Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15 PB - International Joint Conferences on Artificial Intelligence PY - 2015 SP - 425 EP - 430 UR - https://ijcai.org/proceedings/2015/66 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: