A Prospective Analysis of Security Vulnerabilities within Link Traversal-Based Query Processing
The societal and economic consequences surrounding Big Data-driven platforms have increased the call for decentralized solutions. However, retrieving and querying data in more decentralized environments requires fundamentally different approaches, whose properties are not yet well understood. Link-Traversal-based Query Processing (LTQP) is a technique for querying over decentralized data networks, in which a client-side query engine discovers data by traversing links between documents. Since decentralized environments are potentially unsafe due to their non-centrally controlled nature, there is a need for client-side LTQP query engines to be resistant against security threats aimed at the query engine’s host machine or the query initiator’s personal data. As such, we have performed an analysis of potential security vulnerabilities of LTQP. This article provides an overview of security threats in related domains, which are used as inspiration for the identification of 10 LTQP security threats. This list of security threats forms a basis for future work in which mitigations for each of these threats need to be developed and tested for their effectiveness. With this work, we start filling the unknowns for enabling query execution over decentralized environments. Aside from future work on security, wider research will be needed to uncover missing building blocks for enabling true data decentralization.
full text BibTeX other citation formats
Published in 2022 in Proceedings of the 6th Workshop on Storing, Querying and Benchmarking Knowledge Graphs.
- decentralization
- personal data
- Big Data
- research
Read this article online
- Read the full text online.
- Request a digital copy of this article.
- Comment on this article.
Cite this article in your work
Cite this article easily using its BibTeX entry:
@inproceedings{taelman_quweda_2022,
author = {Taelman, Ruben and Verborgh, Ruben},
title = {A Prospective Analysis of Security Vulnerabilities within Link Traversal-Based Query Processing},
booktitle = {Proceedings of the 6th Workshop on Storing, Querying and Benchmarking Knowledge Graphs},
editor = {Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille},
year = 2022,
month = oct,
series = {CEUR Workshop Proceedings},
volume = 3279,
issn = {1613-0073},
pages = {65--80},
url = {https://rubensworks.github.io/article-ldtraversal-security-short/},
}
Alternatively, pick a reference of your choice below:
- ACM
- Ruben Taelman and Ruben Verborgh. 2022. A Prospective Analysis of Security Vulnerabilities within Link Traversal-Based Query Processing. In Proceedings of the 6th Workshop on Storing, Querying and Benchmarking Knowledge Graphs (CEUR Workshop Proceedings), 65–80.
- APA
- Taelman, R., & Verborgh, R. (2022). A Prospective Analysis of Security Vulnerabilities within Link Traversal-Based Query Processing. In M. Saleem & A.-C. Ngonga Ngomo (Eds.), Proceedings of the 6th Workshop on Storing, Querying and Benchmarking Knowledge Graphs (Vol. 3279, pp. 65–80).
- IEEE
- R. Taelman and R. Verborgh, “A Prospective Analysis of Security Vulnerabilities within Link Traversal-Based Query Processing,” in Proceedings of the 6th Workshop on Storing, Querying and Benchmarking Knowledge Graphs, 2022, vol. 3279, pp. 65–80.
- LNCS
- Taelman, R., Verborgh, R.: A Prospective Analysis of Security Vulnerabilities within Link Traversal-Based Query Processing. In: Saleem, M. and Ngonga Ngomo, A.-C. (eds.) Proceedings of the 6th Workshop on Storing, Querying and Benchmarking Knowledge Graphs. pp. 65–80 (2022).
- MLA
- Taelman, Ruben, and Ruben Verborgh. “A Prospective Analysis of Security Vulnerabilities within Link Traversal-Based Query Processing.” Proceedings of the 6th Workshop on Storing, Querying and Benchmarking Knowledge Graphs, edited by Muhammad Saleem and Axel-Cyrille Ngonga Ngomo, vol. 3279, 2022, pp. 65–80.
Discuss this article
- Discover all publications by Ruben Verborgh.
- Find related articles on Google Scholar.
- Post your questions or comments below.