TY - GEN
T1 - Algorithms for Constructing Anonymizing Arrays
AU - Lanus, Erin
AU - Colbourn, Charles J.
N1 - Funding Information:
Research of EL was supported by a National Physical Science Consortium Fellowship. Research of CJC was supported in part by the National Science Foundation under Grant No. 1421058 and Grant No. 1813729.
Publisher Copyright:
© Springer Nature Switzerland AG 2020.
PY - 2020
Y1 - 2020
N2 - 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 than1 probability. Anonymizing arrays r 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.
AB - 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 than1 probability. Anonymizing arrays r 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.
KW - Anonymous authorization
KW - Attribute-based methods
KW - Combinatorial array
KW - Construction algorithms
UR - http://www.scopus.com/inward/record.url?scp=85086260158&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85086260158&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-48966-3_29
DO - 10.1007/978-3-030-48966-3_29
M3 - Conference contribution
AN - SCOPUS:85086260158
SN - 9783030489656
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 382
EP - 394
BT - Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Proceedings
A2 - Gasieniec, Leszek
A2 - Gasieniec, Leszek
A2 - Klasing, Ralf
A2 - Radzik, Tomasz
PB - Springer
T2 - 31st International Workshop on Combinatorial Algorithms, IWOCA 2020
Y2 - 8 June 2020 through 10 June 2020
ER -