How to Securely Outsource Finding the Min-Cut of Undirected Edge-Weighted Graphs

Finding min-cut is a fundamental operation in graph theory. It has been widely used in many applications such as image segmentation and network partition. However, solving the min-cut problem is time-consuming for resource-constrained devices, especially when the graph is large and dense. In this paper, we explore how to securely solve the min-cut problem in the cloud environment, and propose two secure outsourcing schemes for the min-cut of undirected edge-weighted graphs. The first scheme is based on two non-colluded untrusted cloud servers, and the second one is under the single untrusted cloud server model. In the designed schemes, we develop a new technique that contains merging vertices and edges, inserting fake vertices and edges, shuffling vertices and randomizing weights of edges to protect the privacy of graphs. In order to realize the checkability of result from a single untrusted cloud server, we design a novel verification mechanism by outsourcing the min-cut of two related graphs. Besides, we also provide security analysis and the experimental evaluation. To the best of our knowledge, it is the first research on secure outsourcing of graph algorithm.

[1]  Chengliang Tian,et al.  How to securely outsource the inversion modulo a large composite number , 2017, J. Syst. Softw..

[2]  Balakrishnan Krishnamurthy,et al.  An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.

[3]  Vinod Vaikuntanathan,et al.  Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages , 2011, CRYPTO.

[4]  Jiankun Hu,et al.  Cloud-Based Approximate Constrained Shortest Distance Queries Over Encrypted Graphs With Privacy Protection , 2018, IEEE Transactions on Information Forensics and Security.

[5]  Melissa Chase,et al.  Structured Encryption and Controlled Disclosure , 2010, IACR Cryptol. ePrint Arch..

[6]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[7]  Karen S. Phillips,et al.  Enabling Cloud Storage Auditing With Verifiable Outsourcing of Key Updates , 2018 .

[8]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[9]  Changhui Hu,et al.  Efficient and Secure Outsourcing of Large-Scale Linear System of Equations , 2018, IEEE Transactions on Cloud Computing.

[10]  Marina Blanton,et al.  Data-oblivious graph algorithms for secure computation and outsourcing , 2013, ASIA CCS '13.

[11]  Lawrence B. Holder,et al.  Approaches to Parallel Graph-Based Knowledge Discovery , 2001, J. Parallel Distributed Comput..

[12]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[13]  Yin Yang,et al.  Generating Synthetic Decentralized Social Graphs with Local Differential Privacy , 2017, CCS.

[14]  Sreenivas Gollapudi,et al.  A sketch-based distance oracle for web-scale graphs , 2010, WSDM '10.

[15]  Mechthild Stoer,et al.  A simple min-cut algorithm , 1997, JACM.

[16]  Alexandre X. Falcão,et al.  Links Between Image Segmentation Based on Optimum-Path Forest and Minimum Cut in Graph , 2009, Journal of Mathematical Imaging and Vision.

[17]  Mathieu Van Vyve,et al.  Securely Solving Simple Combinatorial Graph Problems , 2013, Financial Cryptography.

[18]  George Kollios,et al.  GRECS: Graph Encryption for Approximate Shortest Distance Queries , 2015, IACR Cryptol. ePrint Arch..

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

[20]  Dan Boneh,et al.  Evaluating 2-DNF Formulas on Ciphertexts , 2005, TCC.

[21]  J. Siskind,et al.  Image segmentation with minimum mean cut , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[22]  Ronald L. Rivest,et al.  ON DATA BANKS AND PRIVACY HOMOMORPHISMS , 1978 .

[23]  Edith Cohen,et al.  Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths , 2013, COSN '13.

[24]  Aziz Mohaisen,et al.  SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates , 2017, Financial Cryptography.

[25]  Kartik Nayak,et al.  Oblivious Data Structures , 2014, IACR Cryptol. ePrint Arch..

[26]  Ke Xiao,et al.  Secure and Verifiable Outsourcing of Large-Scale Matrix Inversion without Precondition in Cloud Computing , 2018, 2018 IEEE International Conference on Communications (ICC).

[27]  Anna Lysyanskaya,et al.  How to Securely Outsource Cryptographic Computations , 2005, TCC.

[28]  Cynthia A. Phillips,et al.  Computer-attack graph generation tool , 2001, Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01.

[29]  Fangguo Zhang,et al.  Secure Bilinear Pairing Outsourcing Made More Efficient and Flexible , 2015, AsiaCCS.