The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Cloud-Based Approximate Constrained Shortest Distance Queries Over Encrypted Graphs With Privacy Protection
Abstract
Constrained shortest distance (CSD) querying is one of the fundamental graph query primitives, which finds the shortest distance from an origin to a destination in a graph with a constraint that the total cost does not exceed a given threshold. CSD querying has a wide range of applications, such as routing in telecommunications and transportation. With an increasing prevalence of cloud computing paradigm, graph owners desire to outsource their graphs to cloud servers. In order to protect sensitive information, these graphs are usually encrypted before being outsourced to the cloud. This, however, imposes a great challenge to CSD querying over encrypted graphs. Since performing constraint filtering is an intractable task, existing work mainly focuses on unconstrained shortest distance queries. CSD querying over encrypted graphs remains an open research problem. In this paper, we propose Connor, a novel graph encryption scheme that enables approximate CSD querying. Connor is built based on an efficient, tree-based ciphertext comparison protocol, and makes use of symmetric-key primitives and the somewhat homomorphic encryption, making it computationally efficient. Using Connor, a graph owner can first encrypt privacy-sensitive graphs and then outsource them to the cloud server, achieving the necessary privacy without losing the ability of querying. Extensive experiments with real-world data sets demonstrate the effectiveness and efficiency of the proposed graph encryption scheme.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reachability and Distance Queries via 2-Hop Labels
Cohen, E., Halperin, E., Kaplan, H., & Zwick, U. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403098 · Cited by 518
Cited by
Shen, M., Tang, X., Zhu, L., Du, X., & Guizani, M. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2901840 · Cited by 443
Self-citationBlockchain-Assisted Secure Device Authentication for Cross-Domain Industrial IoT
Shen, M., Liu, H., Zhu, L., Xu, K., Yu, H., Du, X., & Guizani, M. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.2980916 · Cited by 411
Self-citationShafiq, M., Tian, Z., Sun, Y., Du, X., & Guizani, M. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.02.017 · Cited by 384
Self-citationA Distributed Deep Learning System for Web Attack Detection on Edge Devices
Tian, Z., Luo, C., Qiu, J., Du, X., & Guizani, M. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2938778 · Cited by 367
Self-citationBlockchain-based data preservation system for medical data
Li, H., Zhu, L., Shen, M., Gao, F., Tao, X., & Liu, S. (2018) · Journal of Medical Systems · doi:10.1007/s10916-018-0997-3 · Cited by 347
Self-citation
Metadata
- Authors
- Shen, M., Ma, B., Zhu, L., Mijumbi, R., Du, X., & Hu, J.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2018-04
- Volume
- 13
- Issue
- 4
- Pages
- 940-953
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W2770638201
- Cited by
- 188
- References
- 1
- FWCI
- 15.58
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.