Algorithms for Constructing Anonymizing Arrays
Algorithms for Constructing Anonymizing Arrays
复制标题
用于构建匿名数组的算法
DOI：
10.1007/978-3-030-48966-3_29
复制
发表时间：
2020-04-30
期刊：
影响因子：
--
通讯作者：
Colbourn CJ
中科院分区：
文献类型：
--
作者：
Lanus E;Colbourn CJ
基于属性的方法本质上是无标识的，因为授权决策是根据主体拥有的属性而不是身份做出的。然而，当属性分布允许组合很少主体能够满足的策略时，就不能保证对系统的匿名性。匿名数组确保对数组中出现的t个属性的任何赋值至少出现r次。当注册到系统的主体使用匿名数组，且策略包含最多t个属性的连词时，系统无法以大于概率的方式识别使用该策略的主体以获得授权。匿名数组类似于覆盖具有更高覆盖率和约束的数组，但由于它们的应用领域，它们具有额外的期望属性，即同质性。在本文中，我们开发了匿名数组的结构，并提出了一种后优化机制来减少同质性。
Attribute-based methods are inherently identity-less as authorization decisions are made in terms of attributes possessed by the subject rather than identity. However, anonymity against the system is not guaranteed when attribute distribution allows for the composition of a policy that few subjects can satisfy. An anonymizing array ensures that any assignment of values to t attributes that appears in the array appears at least r times. When an anonymizing array is used for subjects registered to a system and policies contain conjunctions of at most t attributes, the system cannot identify the subject using the policy to to gain authorization with greater than probability. Anonymizing arrays are similar to covering arrays with higher coverage and constraints, but have an additional desired property, homogeneity, due to their application domain. In this paper, we develop constructions for anonymizing arrays and propose a post-optimization mechanism to reduce homogeneity.
登录
查看更多内容
影响因子：
2.5
作者：
Moser, Robin A.;Tardos, Gabor
通讯作者：
Tardos, Gabor
影响因子：
1.5
作者：
Bryce, Renee C.;Colbourn, Charles J.
通讯作者：
Colbourn, Charles J.
影响因子：
3.9
作者：
Bryce, Renee C.;Colbourn, Charles J.
通讯作者：
Colbourn, Charles J.
影响因子：
1.6
作者：
Colbourn, Charles J.;Lanus, Erin;Sarkar, Kaushik
通讯作者：
Sarkar, Kaushik