In recent years we have seen significant advances in the technology used to both publish and consume Linked Data. However, in order to support the next generation of ebusiness applications on top of interlinked machine readable data suitable forms of access control need to be put in place. Although a number of access control models and frameworks have been put forward, very little research has been conducted into the security implications associated with granting access to partial data or the correctness of the proposed access control mechanisms. Therefore the contributions of this paper are two fold: we propose a query rewriting algorithm which can be used to partially restrict access to SPARQL 1.1 queries and updates; and we demonstrate how a set of criteria, which was originally used to verify that an access control policy holds over different database states, can be adapted to verify the correctness of access control via query rewriting.

中文翻译：

---

链接数据的基于查询的访问控制

近年来，我们看到用于发布和使用关联数据的技术取得了重大进展。然而，为了支持基于互连机器可读数据的下一代电子商务应用程序，需要采用适当形式的访问控制。尽管已经提出了许多访问控制模型和框架，但对与授予对部分数据的访问权限或所提议的访问控制机制的正确性相关的安全影响进行了很少的研究。因此，本文的贡献有两个方面：我们提出了一种查询重写算法，可用于部分限制对 SPARQL 1.1 查询和更新的访问；我们展示了一组标准如何，