Graph encryption for all‐path queries

Abstract

SummarySince cloud computing and cloud storage have become a common practice in our daily life, people are paying more attention on protecting the privacy of their sensitive data. In this paper, we consider the problem of graph encryption in such a way that one can perform all‐path queries over an encrypted graph in a privacy‐preserving manner. A solution for such problem has many potential applications in network virtualization since graph data structures are commonly used to represent the topology of substrate and virtual networks. We propose a searchable symmetric encryption scheme for graph data that support all‐path queries. The scheme allows a client to encrypt a sensitive graph and outsource it to an untrusted server for storage. After that, the client can perform arbitrary all‐path queries between a source and a destination. For each query, the server computes and returns all the paths that satisfied the query. We prove that our scheme is secure against adaptive chosen‐query attacks in the semi‐honest setting.

Graph Crypto-Stego System for Securing Graph Data Using Association Schemes

“…The methods described in [10][11][12][13]24] mostly employ cryptographic techniques to render security. Liu et al [10] devel-oped a graph encryption strategy for an important graph query type known as top-k Nearest Keyword (kNK) searches by building a number of indexes to store the data needed to answer to queries.…”

“…By creating a number of indexes to store the data required to respond to queries, Liu et al [10] investigated a graph encryption approach for a crucial graph query type known as top-k Nearest Keyword (kNK) searches. For graph data that supports all-path searches, Xu et al [11] presented a searchable symmetric encryption system. Zhang et al [12] presented the Privacy-preserving Graph encryption for Accurate constrained Shortest distance queries (PGAS) that is capable of delivering accurate constrained shortest distance (CSD) queries and ensuring the privacy of the graph data.…”

Network vulnerability parameter and results on two surfaces

“…graph modelling, isolated toughness, (P ≥3 , m)-factor deleted graph, isolated toughness (P ≥3 , m) factor deleted surface during the stage of network designing. It always requires the network structure to satisfy certain parameter bounds to ensure the networks with higher stand-up and less vulnerability (for more recent results on cyber security and related analysis, see Xu et al, 2 Xing et al, 3 Li et al, 4 Samira et al, 5 and Jaco et al 6 ).…”