A privacy-preserving algorithm for distributed constraint optimization
Tal Grinshpoun, Tamir Tassa · Adaptive Agents and Multi-Agents Systems · 2014
Distributed constraint optimization problems enable the representation of many combinatorial problems that are distributed by nature. An important motivation for such problems is to preserve the privacy of the participating agents during the solving process. The present paper introduces a novel privacy-preserving algorithm for this purpose. The proposed algorithm requires a secure solution of several multiparty computation problems. Consequently, appropriate novel secure protocols are devised and analyzed.