A privacy-preserving algorithm for distributed constraint optimization

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.

[1]  Josh Benaloh,et al.  Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing , 1986, CRYPTO.

[2]  Boi Faltings,et al.  Secure Combinatorial Optimization Simulating DFS Tree-Based Variable Elimination , 2006, AI&M.

[3]  Weixiong Zhang,et al.  Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks , 2005, Artif. Intell..

[4]  Amnon Meisels,et al.  Measuring Distributed Constraint Optimization algorithms , 2008 .

[5]  Makoto Yokoo,et al.  Distributed Private Constraint Optimization , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[6]  Amnon Meisels,et al.  Completeness and Performance Of The APO Algorithm , 2008, J. Artif. Intell. Res..

[7]  Makoto Yokoo,et al.  Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information , 2002, CP.

[8]  Makoto Yokoo,et al.  Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..

[9]  Michael D. Smith,et al.  SSDPOP: improving the privacy of DCOP with secret sharing , 2007, AAMAS '07.

[10]  Boi Faltings,et al.  A Scalable Method for Multiagent Constraint Optimization , 2005, IJCAI.

[11]  Sheng Zhong,et al.  Privacy-enhancing k-anonymization of customer data , 2005, PODS.

[12]  Amnon Meisels,et al.  Asymmetric Distributed Constraint Optimization Problems , 2013, J. Artif. Intell. Res..

[13]  Victor R. Lesser,et al.  Solving distributed constraint optimization problems using cooperative mediation , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[14]  Boi Faltings,et al.  Distributed Constraint Optimization Under Stochastic Uncertainty , 2011, AAAI.

[15]  Amnon Meisels,et al.  Message delay and DisCSP search algorithms , 2006, Annals of Mathematics and Artificial Intelligence.

[16]  Sven Koenig,et al.  BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm , 2008, AAMAS.

[17]  Marius-Calin Silaghi,et al.  Distributed constraint satisfaction and optimization with privacy enforcement , 2004 .

[18]  Amnon Meisels.  Asynchronous Forward-Bounding , 2008 .

[19]  Milind Tambe,et al.  Analysis of Privacy Loss in Distributed Constraint Optimization , 2006, AAAI.

[20]  Oded Goldreich,et al.  A randomized protocol for signing contracts , 1985, CACM.

[21]  Katia P. Sycara,et al.  No-commitment branch and bound search for distributed constraint optimization , 2006, AAMAS '06.

[22]  Chris Clifton,et al.  Privacy-preserving distributed mining of association rules on horizontally partitioned data , 2004, IEEE Transactions on Knowledge and Data Engineering.

[23]  Ehud Gudes,et al.  Secure distributed computation of anonymized views of shared databases , 2012, TODS.

[24]  Boi Faltings,et al.  Privacy Guarantees through Distributed Constraint Satisfaction , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[25]  Kobbi Nissim,et al.  Secure DisCSP Protocols – From Centralized Towards Distributed Solutions , 2005 .

[26]  Boi Faltings,et al.  Protecting Privacy through Distributed Computation in Multi-agent Decision Making , 2013, J. Artif. Intell. Res..

[27]  Milind Tambe,et al.  Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[28]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[29]  Amnon Meisels,et al.  Asynchronous Forward Bounding for Distributed COPs , 2014, J. Artif. Intell. Res..

[30]  Makoto Yokoo,et al.  Distributed Partial Constraint Satisfaction Problem , 1997, CP.

[31]  Tal Grinshpoun,et al.  When You Say (DCOP) Privacy, What do You Mean? - Categorization of DCOP Privacy and Insights on Internal Constraint Privacy , 2012, ICAART.

[32]  Milind Tambe,et al.  Privacy Loss in Distributed Constraint Reasoning: A Quantitative Framework for Analysis and its Applications , 2006, Autonomous Agents and Multi-Agent Systems.

[33]  Gu Si-yang,et al.  Privacy preserving association rule mining in vertically partitioned data , 2006 .