Graph encryption for all‐path queries
- 29 May 2019
- journal article
- research article
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 32 (16) , e5362
Abstract
Summary: Since 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.Keywords
Funding Information
- National Natural Science Foundation of China (61472184, 61772127, 61872069)
- Fundamental Research Funds for the Central Universities (N151704002)
This publication has 19 references indexed in Scilit:
- Leakage-Abuse Attacks Against Searchable Encryption2015
- GRECS2015
- A sub-graph mapping-based algorithm for virtual network allocation over flexible grid networks2015
- Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud2014
- Practical Dynamic Searchable Encryption with Small Leakage2014
- Boolean symmetric searchable encryption2013
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries2013
- Graph clustering based provisioning algorithm for virtual network embedding2012
- Searchable symmetric encryption: Improved definitions and efficient constructionsJournal of Computer Security, 2011
- Virtual network embedding through topology-aware node rankingACM SIGCOMM Computer Communication Review, 2011