Securely Solving the Distributed Graph Coloring Problem

Combinatorial optimization is a fundamental problem found in many fields. In many real life situations, the constraints and the objective function forming the optimization problem are naturally distributed amongst different sites in some fashion. A typical approach for solving such problem is to collect all of this information together and centrally solve the problem. However, this requires all parties to completely share their information, which may lead to serious privacy issues. Thus, it is desirable to propose a privacy preserving technique that can securely solve specific combinatorial optimization problems. A further complicating factor is that combinatorial optimization problems are typically NP-hard, requiring approximation algorithms or heuristics to provide a practical solution. In this paper, we focus on a very well-known hard problem -- the distributed graph coloring problem, which has been utilized to model many real world problems in scheduling and resource allocation. We propose efficient protocols to securely solve such fundamental problem. We analyze the security of our approach and experimentally demonstrate the effectiveness of our approach.

[1]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[2]  Dániel Marx,et al.  RAPH COLORING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING , 2022 .

[3]  Fei Wang,et al.  Overlapping Clustering with Sparseness Constraints , 2012, 2012 IEEE 12th International Conference on Data Mining Workshops.

[4]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[5]  Ravindra K. Ahuja,et al.  Inverse Optimization , 2001, Oper. Res..

[6]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[7]  Yuan Hong,et al.  A distance matrix based algorithm for solving the traveling salesman problem , 2020, Oper. Res..

[8]  Sanjay Goel,et al.  Discovering energy communities for microgrids on the power grid , 2017, 2017 IEEE International Conference on Smart Grid Communications (SmartGridComm).

[9]  Lingyu Wang,et al.  Privacy Preserving Smart Meter Streaming Against Information Leakage of Appliance Status , 2017, IEEE Transactions on Information Forensics and Security.

[10]  Jaideep Vaidya,et al.  Accurate and efficient query clustering via top ranked search results , 2016, Web Intell..

[11]  Shigenobu Kobayashi,et al.  A genetic algorithm for privacy preserving combinatorial optimization , 2007, GECCO '07.

[12]  Vijayalakshmi Atluri,et al.  Constraint-Aware Role Mining via Extended Boolean Matrix Decomposition , 2012, IEEE Transactions on Dependable and Secure Computing.

[13]  Shengbin Wang,et al.  Integrated post-disaster medical assistance team scheduling and relief supply distribution , 2018, The International Journal of Logistics Management.

[14]  Yuan Hong,et al.  Efficient Energy Consumption Scheduling: Towards Effective Load Leveling , 2017 .

[15]  Jaideep Vaidya,et al.  A Survey of Privacy-Aware Supply Chain Collaboration: From Theory to Applications , 2014, J. Inf. Syst..

[16]  Yunghsiang Sam Han,et al.  Privacy-Preserving Multivariate Statistical Analysis: Linear Regression and Classification , 2004, SDM.

[17]  Haibing Lu,et al.  Search Engine Query Clustering Using Top-k Search Results , 2011, 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology.

[18]  Jaideep Vaidya.  A Secure Revised Simplex Algorithm for Privacy-Preserving Linear Programming , 2009, 2009 International Conference on Advanced Information Networking and Applications.

[19]  Benny Pinkas,et al.  FairplayMP: a system for secure multi-party computation , 2008, CCS.

[20]  Jaideep Vaidya,et al.  Differentially private search log sanitization with optimal output utility , 2011, EDBT '12.

[21]  Jaideep Vaidya,et al.  Secure and efficient distributed linear programming , 2012, J. Comput. Secur..

[22]  Sanjay Goel,et al.  Collaborative Search Log Sanitization: Toward Differential Privacy and Boosted Utility , 2015, IEEE Transactions on Dependable and Secure Computing.

[23]  Marius-Calin Silaghi,et al.  The effect of policies for selecting the solution of a DisCSP on privacy loss , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[24]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[25]  Ananth Grama,et al.  An efficient protocol for Yao's millionaires' problem , 2003, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the.

[26]  Basit Shafiq,et al.  Privacy-Preserving Tabu Search for Distributed Graph Coloring , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.

[27]  Jaideep Vaidya,et al.  Privacy-preserving linear programming , 2009, SAC '09.

[28]  Jaideep Vaidya,et al.  Collaboratively Solving the Traveling Salesman Problem with Limited Disclosure , 2014, DBSec.

[29]  Xiaohang Yue,et al.  On the Robust and Stable Flowshop Scheduling Under Stochastic and Dynamic Disruptions , 2017, IEEE Transactions on Engineering Management.

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

[31]  Vijayalakshmi Atluri,et al.  Effective anonymization of query logs , 2009, CIKM.

[32]  Hicham G. Elmongui,et al.  Secure supply-chain protocols , 2003, EEE International Conference on E-Commerce, 2003. CEC 2003..

[33]  Sanjay Goel,et al.  An efficient and privacy‐preserving scheme for P2P energy exchange among smart microgrids , 2016 .

[34]  Sanjay Goel,et al.  Smart Grid Security , 2015, SpringerBriefs in Cybersecurity.

[35]  Jaideep Vaidya,et al.  An inference–proof approach to privacy-preserving horizontally partitioned linear programs , 2014, Optim. Lett..

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

[37]  Privacy-preserving collaborative optimization , 2013 .

[38]  A. Yao,et al.  Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.

[39]  Makoto Yokoo,et al.  Secure Generalized Vickrey Auction Using Homomorphic Encryption , 2003, Financial Cryptography.

[40]  Yanjiang Yang,et al.  Towards user-oriented RBAC model , 2013, J. Comput. Secur..

[41]  Han Wang,et al.  Privacy Preserving and Collusion Resistant Energy Sharing , 2018, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[42]  Vijayalakshmi Atluri,et al.  Extended Boolean Matrix Decomposition , 2009, 2009 Ninth IEEE International Conference on Data Mining.

[43]  Jaideep Vaidya,et al.  Efficient Distributed Linear Programming with Limited Disclosure , 2011, DBSec.