论文标题

扩展具有隐私功能的表达性访问政策

Extending Expressive Access Policies with Privacy Features

论文作者

More, Stefan, Ramacher, Sebastian, Alber, Lukas, Herzl, Marco

论文摘要

身份验证,授权和信任验证是访问控制系统的中心部分。在访问政策中收集了此类系统中授予访问的条件。由于访问条件通常是复杂的,因此使用专用语言(策略语言)用于定义政策。 但是,当前的策略语言无法表达具有用户隐私的条件。借助隐私保护技术,用户可以在不透露访问系统的情况下向访问系统证明信息。 在这项工作中,我们提出了一种通用设计,用于支持政策语言中的隐私技术。我们的设计阻止了不必要的敏感信息披露,同时仍允许制定表达性的访问控制规则。为此,我们利用零知识证明(NIZK)。我们在使用Snarks时将其应用于TPL政策语言来演示我们的设计。此外,我们评估了所得的ZK-TPL语言及其相关的工具链。我们的评估表明,对于常规尺寸的凭证通信和验证开销是可以忽略的。

Authentication, authorization, and trust verification are central parts of an access control system. The conditions for granting access in such a system are collected in access policies. Since access conditions are often complex, dedicated languages -- policy languages -- for defining policies are in use. However, current policy languages are unable to express such conditions having privacy of users in mind. With privacy-preserving technologies, users are enabled to prove information to the access system without revealing it. In this work, we present a generic design for supporting privacy-preserving technologies in policy languages. Our design prevents unnecessary disclosure of sensitive information while still allowing the formulation of expressive rules for access control. For that we make use of zero-knowledge proofs (NIZKs). We demonstrate our design by applying it to the TPL policy language, while using SNARKs. Also, we evaluate the resulting ZK-TPL language and its associated toolchain. Our evaluation shows that for regular-sized credentials communication and verification overhead is negligible.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源