OWL2中的粘接策略:用固定点和传递闭包扩展PL

P. Bonatti, L. Sauro
{"title":"OWL2中的粘接策略:用固定点和传递闭包扩展PL","authors":"P. Bonatti, L. Sauro","doi":"10.24963/kr.2022/8","DOIUrl":null,"url":null,"abstract":"PL is a low-complexity profile of OWL2, expressly designed to encode data usage policies and personal data protection regulations - such as the GDPR - in a machine understandable way. With PL, the compliance of privacy policies with the GDPR and with the data subjects' consent to processing can be checked automatically and in real time. In this paper, we extend PL to support \"sticky policies\". They are a sort of license that applies to data transfers, and specifies how the recipient can use the data. Sticky policies may be \"recursive\", i.e. they may apply not only to the first data transfer, but also to all subsequent transfer operations that the (direct or indirect) recipients may execute in the future. Such recursive sticky policies may be encoded with fixpoints or transitive role closure. In this paper we prove that such extensions make compliance checking intractable. Since the scalability of compliance checking is a major requirement in this area, these results justify a specialized, low complexity approach to encoding sticky policies.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sticky Policies in OWL2: Extending PL with Fixpoints and Transitive Closure\",\"authors\":\"P. Bonatti, L. Sauro\",\"doi\":\"10.24963/kr.2022/8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"PL is a low-complexity profile of OWL2, expressly designed to encode data usage policies and personal data protection regulations - such as the GDPR - in a machine understandable way. With PL, the compliance of privacy policies with the GDPR and with the data subjects' consent to processing can be checked automatically and in real time. In this paper, we extend PL to support \\\"sticky policies\\\". They are a sort of license that applies to data transfers, and specifies how the recipient can use the data. Sticky policies may be \\\"recursive\\\", i.e. they may apply not only to the first data transfer, but also to all subsequent transfer operations that the (direct or indirect) recipients may execute in the future. Such recursive sticky policies may be encoded with fixpoints or transitive role closure. In this paper we prove that such extensions make compliance checking intractable. Since the scalability of compliance checking is a major requirement in this area, these results justify a specialized, low complexity approach to encoding sticky policies.\",\"PeriodicalId\":351970,\"journal\":{\"name\":\"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24963/kr.2022/8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24963/kr.2022/8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

PL是OWL2的低复杂度配置文件,专门设计用于以机器可理解的方式对数据使用策略和个人数据保护法规(如GDPR)进行编码。使用PL,可以自动实时地检查隐私政策是否符合GDPR和数据主体对处理的同意。在本文中,我们扩展了PL以支持“粘性策略”。它们是一种适用于数据传输的许可,并指定接收方如何使用数据。粘性策略可能是“递归的”,即它们可能不仅适用于第一次数据传输,还适用于(直接或间接)接收方将来可能执行的所有后续传输操作。这种递归粘性策略可以用固定点或传递角色闭包进行编码。本文证明了这种扩展使得遵从性检验变得难以处理。由于遵从性检查的可伸缩性是该领域的主要需求,因此这些结果证明了一种专门的、低复杂性的方法来编码粘性策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sticky Policies in OWL2: Extending PL with Fixpoints and Transitive Closure
PL is a low-complexity profile of OWL2, expressly designed to encode data usage policies and personal data protection regulations - such as the GDPR - in a machine understandable way. With PL, the compliance of privacy policies with the GDPR and with the data subjects' consent to processing can be checked automatically and in real time. In this paper, we extend PL to support "sticky policies". They are a sort of license that applies to data transfers, and specifies how the recipient can use the data. Sticky policies may be "recursive", i.e. they may apply not only to the first data transfer, but also to all subsequent transfer operations that the (direct or indirect) recipients may execute in the future. Such recursive sticky policies may be encoded with fixpoints or transitive role closure. In this paper we prove that such extensions make compliance checking intractable. Since the scalability of compliance checking is a major requirement in this area, these results justify a specialized, low complexity approach to encoding sticky policies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信