{"type":"ScholarlyArticle","title":"A Privacy Preserving Collusion Secure DCOP Algorithm","authors":[{"name":"Tamir Tassa","slug":"tamir-tassa","given":"Tamir","family":"Tassa","affiliation":"The Open University , Ra'anana , Israel"},{"name":"Tal Grinshpoun","slug":"tal-grinshpoun","given":"Tal","family":"Grinshpoun","affiliation":"Ariel University , Ariel , Israel"},{"name":"Avishai Yanay","slug":"avishai-yanay","given":"Avishai","family":"Yanay","affiliation":"Bar-Ilan University , Ramat Gan , Israel"}],"abstract":"In recent years, several studies proposed privacy-preserving algorithms for solving Distributed Constraint Optimization Problems (DCOPs). All of those studies assumed that agents do not collude. In this study we propose the first privacy-preserving DCOP algorithm that is immune against coalitions, under the assumption of honest majority. Our algorithm -- PC-SyncBB -- is based on the classical Branch and Bound DCOP algorithm. It offers constraint, topology and decision privacy. We evaluate its performance on different benchmarks, problem sizes, and constraint densities. We show that achieving security against coalitions is feasible. As all existing privacy-preserving DCOP algorithms base their security on assuming solitary conduct of the agents, we view this study as an essential first step towards lifting this potentially harmful assumption in all those algorithms.","doi":"10.24963/ijcai.2019/663","url":"https://ijcai.org/proceedings/2019/663","pdf":"https://ijcai.org/proceedings/2019/0663.pdf","markdown":"https://ijcai.org/proceedings/2019/663.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/663","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Multidisciplinary Topics and Applications","track":"Main track","number":663,"pages":{"first":4774,"last":4780},"keywords":["Constraints and SAT: Distributed Constraints","Multidisciplinary Topics and Applications: Security and Privacy"],"videos":[],"references":[{"position":1,"raw":"[Barabási and Albert, 1999] Albert-László Barabási and Réka Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, 1999.","title":"Emergence of scaling in random networks","authors":"Albert-László Barabási, Réka Albert","year":"1999","venue":"Science","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Ben-Efraim and Omri, 2017] A. Ben-Efraim and E. Omri. Concrete efficiency improvements for multiparty garbling with an honest majority. In LATINCRYPT, 2017.","title":"Concrete efficiency improvements for multiparty garbling with an honest majority","authors":"A Ben-Efraim, E Omri","year":"2017","venue":"LATINCRYPT","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Ben-Or et al., 1988] Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non- cryptographic fault-tolerant distributed computation. In STOC, pages 1-10, 1988.","title":"Completeness theorems for noncryptographic fault-tolerant distributed computation","authors":"Michael Ben-Or, Shafi Goldwasser, Avi Wigderson","year":"1988","venue":"STOC","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Farinelli et al., 2008] A. Farinelli, A. Rogers, A. Petcu, and N.R. Jennings. Decentralised coordination of low-power embedded devices using the max-sum algorithm. In AA- MAS, pages 639-646, 2008.","title":"Decentralised coordination of low-power embedded devices using the max-sum algorithm","authors":"A Farinelli, A Rogers, A Petcu, N R Jennings","year":"2008","venue":"AA-MAS","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Gershman et al., 2009] A. Gershman, A. Meisels, and R. Zivan. Asynchronous forward bounding for distributed COPs. Journal of Artificial Intelligence Research, 34:61- 88, 2009.","title":"Asynchronous forward bounding for distributed COPs","authors":"A Gershman, A Meisels, R Zivan","year":"2009","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Goldwasser and Micali, 1982] S. Goldwasser and S. Micali. Probabilistic encryption and how to play mental poker keeping secret all partial information. In STOC, pages 365-377, 1982.","title":"Probabilistic encryption and how to play mental poker keeping secret all partial information","authors":"S Goldwasser, S Micali","year":"1982","venue":"STOC","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Greenstadt et al., 2007] R. Greenstadt, B. Grosz, and M.D. Smith. SSDPOP: improving the privacy of DCOP with secret sharing. In AAMAS, pages 171:1-171:3, 2007.","title":"SSDPOP: improving the privacy of DCOP with secret sharing","authors":"R Greenstadt, B Grosz, M D Smith","year":"2007","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Grinshpoun and Tassa, 2014] T. Grinshpoun and T. Tassa. A privacy-preserving algorithm for distributed constraint optimization. In AAMAS, pages 909-916, 2014.","title":"A privacy-preserving algorithm for distributed constraint optimization","authors":"T Grinshpoun, T Tassa","year":"2014","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Grinshpoun and Tassa, 2016] T. Grinshpoun and T. Tassa. P-SyncBB: A privacy preserving branch and bound DCOP algorithm. Journal of Artificial Intelligence Research, 57:621-660, 2016.","title":"P-SyncBB: A privacy preserving branch and bound DCOP algorithm","authors":"T Grinshpoun, T Tassa","year":"2016","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Grinshpoun et al., 2019] Tal Grinshpoun, Tamir Tassa, Vadim Levit, and Roie Zivan. Privacy preserving re- gion optimal algorithms for symmetric and asymmetric DCOPs. Artificial Intelligence, 266:27-50, 2019.","title":"Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs","authors":"Tamir Tal Grinshpoun, Vadim Tassa, Roie Levit, Zivan","year":"2019","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Hirayama and Yokoo, 1997] K. Hirayama and M. Yokoo. Distributed partial constraint satisfaction problem. In CP, pages 222-236, 1997.","title":"Distributed partial constraint satisfaction problem","authors":"K Hirayama, M Yokoo","year":"1997","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Katagishi and Pearce, 2007] H. Katagishi and J.P. Pearce. Kopt: Distributed DCOP algorithm for arbitrary k-optima with monotonically increasing utility. In DCR, 2007.","title":"Kopt: Distributed DCOP algorithm for arbitrary k-optima with monotonically increasing utility","authors":"H Katagishi, J P Pearce","year":"2007","venue":"DCR","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Léauté and Faltings, 2013] Thomas Léauté and Boi Falt- ings. Protecting privacy through distributed computation in multi-agent decision making. Journal of Artificial Intel- ligence Research, 47:649-695, 2013.","title":"Thomas Léauté and Boi Faltings. Protecting privacy through distributed computation in multi-agent decision making","authors":"Faltings Léauté","year":"2013","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Lezama et al., 2017] F. Lezama, J. Palominos, A.Y. Rodríguez-González, A. Farinelli, and E. Munoz de Cote. Agent-based microgrid scheduling: An ICT perspective. Mobile Networks and Applications, 2017.","title":"Agent-based microgrid scheduling: An ICT perspective","authors":"F Lezama, J Palominos, A Y Rodríguez-González, A Farinelli, E Munoz De Cote","year":"2017","venue":"Mobile Networks and Applications","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Lutati et al., 2014] Benny Lutati, Inna Gontmakher, Michael Lando, Arnon Netzer, Amnon Meisels, and Alon Grubshtein. Agentzero: A framework for simulating and evaluating multi-agent algorithms. In Agent-Oriented Software Engineering, pages 309-327. Springer, 2014.","title":"Agentzero: A framework for simulating and evaluating multi-agent algorithms","authors":"Lutati","year":"2014","venue":"Agent-Oriented Software Engineering","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Maheswaran et al., 2004] R.T. Maheswaran, M. Tambe, E. Bowring, J.P. Pearce, and P. Varakantham. Taking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling. In AAMAS, pages 310- 317, 2004.","title":"Taking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling","authors":"R T Maheswaran, M Tambe, E Bowring, J P Pearce, P Varakantham","year":"2004","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Mailler and Lesser, 2004] R. Mailler and V.R. Lesser. Solv- ing distributed constraint optimization problems using co- operative mediation. In AAMAS, pages 438-445, 2004.","title":"Solving distributed constraint optimization problems using cooperative mediation","authors":"R Mailler, V R Lesser","year":"2004","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Meseguer and Larrosa, 1995] P. Meseguer and J. Larrosa. Constraint satisfaction as global optimization. In IJCAI, pages 579-584, 1995.","title":"Constraint satisfaction as global optimization","authors":"P Meseguer, J Larrosa","year":"1995","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/1995/76"},{"position":19,"raw":"[Modi et al., 2005] P.J. Modi, W.M. Shen, M. Tambe, and M. Yokoo. ADOPT: asynchronous distributed constraint optimization with quality guarantees. Artificial Intelli- gence, 161:149-180, 2005.","title":"ADOPT: asynchronous distributed constraint optimization with quality guarantees","authors":"P J Modi, W M Shen, M Tambe, M Yokoo","year":"2005","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Ottens et al., 2017] B. Ottens, C. Dimitrakakis, and B. Falt- ings. Duct: An upper confidence bound approach to dis- tributed constraint optimization problems. ACM Trans- actions on Intelligent Systems and Technology (TIST), 8(5):69, 2017.","title":"Duct: An upper confidence bound approach to distributed constraint optimization problems","authors":"B Ottens, C Dimitrakakis, B Faltings","year":"2017","venue":"ACM Transactions on Intelligent Systems and Technology (TIST)","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Paillier, 1999] P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Eurocrypt, pages 223-238, 1999.","title":"Public-key cryptosystems based on composite degree residuosity classes","authors":"P Paillier","year":"1999","venue":"Eurocrypt","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Petcu and Faltings, 2005] A. Petcu and B. Faltings. A scal- able method for multiagent constraint optimization. In IJ- CAI, pages 266-271, 2005.","title":"A scalable method for multiagent constraint optimization","authors":"A Petcu, B Faltings","year":"2005","venue":"IJ-CAI","doi":null,"url":null,"internal_url":"/proceedings/2005/21"},{"position":23,"raw":"[Silaghi and Mitra, 2004] M.C. Silaghi and D. Mitra. Dis- tributed constraint satisfaction and optimization with pri- vacy enforcement. In IAT, pages 531-535, 2004.","title":"Distributed constraint satisfaction and optimization with privacy enforcement","authors":"M C Silaghi, D Mitra","year":"2004","venue":"IAT","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Sultanik et al., 2008] E. Sultanik, R. N. Lass, and W. C. Regli. DCOPolis: a framework for simulating and deploy- ing distributed constraint reasoning algorithms. In AAMAS (demos), pages 1667-1668, 2008.","title":"DCOPolis: a framework for simulating and deploying distributed constraint reasoning algorithms","authors":"E Sultanik, R N Lass, W C Regli","year":"2008","venue":"AAMAS (demos)","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Tassa et al., 2017] T. Tassa, T. Grinshpoun, and R. Zivan. Privacy preserving implementation of the Max-Sum algo- rithm and its variants. Journal of Artificial Intelligence Research, 59:311-349, 2017.","title":"Privacy preserving implementation of the Max-Sum algorithm and its variants","authors":"T Tassa, T Grinshpoun, R Zivan","year":"2017","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Yao, 1982] A.C. Yao. Protocols for secure computation. In FOCS, pages 160-164, 1982.","title":"Protocols for secure computation","authors":"A C Yao","year":"1982","venue":"FOCS","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Yeoh et al., 2010] W. Yeoh, A. Felner, and S. Koenig. BnB- ADOPT: An asynchronous branch-and-bound DCOP al- gorithm. Journal of Artificial Intelligence Research, 38:85-133, 2010.","title":"BnB-ADOPT: An asynchronous branch-and-bound DCOP algorithm","authors":"W Yeoh, A Felner, S Koenig","year":"2010","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Zhang et al., 2005] W. Zhang, G. Wang, Z. Xing, and L. Wittenburg. Distributed stochastic search and dis- tributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks. Artificial Intelligence, 161(1-2):55-87, 2005.","title":"Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks","authors":"W Zhang, G Wang, Z Xing, L Wittenburg","year":"2005","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}