Guaranteeing Anonymity in Attribute-Based Authorization

• URL: http://arxiv.org/abs/2310.04896v1
• Date: Sat, 7 Oct 2023 19:09:17 GMT
• Title: Guaranteeing Anonymity in Attribute-Based Authorization
• Abstract summary: Attribute-based methods make decisions based on attributes possessed by a subject rather than the subject's identity. While this allows for anonymous authorization, it does not guarantee anonymity. Other approaches to achieving anonymity in attribute-based authorization do not address this attribute distribution problem.
• Score: 3.2697504912958633
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Attribute-based methods, such as attribute-based access control and attribute-based encryption, make decisions based on attributes possessed by a subject rather than the subject's identity. While this allows for anonymous authorization -- determining that a subject is authorized without knowing the identity of the subject -- it does not guarantee anonymity. If a policy can be composed such that few subjects possess attributes satisfying the policy, then when the policy is used for access control, in addition to making a grant or deny decision, the system can also guess with high probability the identity of the subject making the request. Other approaches to achieving anonymity in attribute-based authorization do not address this attribute distribution problem. Suppose polices contain conjunctions of at most $t$ attributes and the system must not be able to guess with probability greater than $\frac{1}{r}$ the identity of a subject using a policy for authorization. We say the anonymity guarantee is $r$ for maximum credential size $t$. An anonymizing array is a combinatorial array proposed as an abstraction to address the underlying attribute distribution problem by ensuring that any assignment of values to $t$ attributes appearing in the array appears at least $r$ times. Anonymizing arrays are related to covering arrays with higher coverage, but have an additional desired property, homogeneity, due to their application domain. In this work, we discuss the application of anonymizing arrays to guarantee anonymous authorization in attribute-based methods. Additionally, we develop metrics, local and global homogeneity, to compare anonymizing arrays with the same parameters.

Related papers

• Verification of $K$- and Infinite-Step Strong/Weak Anonymity Using Concurrent Compositions [38.32370955322664]
  In this paper, we lucubrate $K$- and infinite-step anonymity for partially-observed discrete-event systems modeled by non-deterministic finite-state automata.<n>First, we define two strong types and two weak types of $K$- and infinite-step anonymity that are fundamentally different from the existing notions of $K$- and infinite-step anonymity due to the consideration of strong and weak anonymous projections.
  arXiv  Detail & Related papers  (2026-09-01T13:03:52Z)
• Towards Context-Aware Image Anonymization with Multi-Agent Reasoning [0.0]
  We present an agentic framework CAIAMAR for context-aware PII segmentation with diffusion-based anonymization.<n>Three specialized agents coordinate via round-robin speaker selection in a Plan-Do-Check-Act cycle.<n>For image quality preservation on CityScapes, we achieve KID: $0.001$, and FID: $9.1$, significantly outperforming existing anonymization.
  arXiv  Detail & Related papers  (2026-03-29T19:06:43Z)
• Stop Tracking Me! Proactive Defense Against Attribute Inference Attack in LLMs [61.15237978606501]
  Large language models can infer private user attributes from user-generated text.<n>Existing anonymization-based defenses are coarse-grained, lacking word-level precision in anonymizing privacy-leaking elements.<n>We propose a unified defense framework that combines fine-grained anonymization (TRACE) with inference-preventing optimization (RPS)
  arXiv  Detail & Related papers  (2026-02-12T03:37:50Z)
• Beyond Inference Intervention: Identity-Decoupled Diffusion for Face Anonymization [55.29071072675132]
  Face anonymization aims to conceal identity information while preserving non-identity attributes.<n>We propose textbfIDsuperscript2Face, a training-centric anonymization framework.<n>We show that IDtextsuperscript2Face outperforms existing methods in visual quality, identity suppression, and utility preservation.
  arXiv  Detail & Related papers  (2025-10-28T09:28:12Z)
• Lattice-Based Dynamic $k$-Times Anonymous Authentication [12.008179370101539]
  $k$-times anonymous authentication ($k$-TAA) scheme allows members of a group to be authenticated anonymously by application providers up to $k$ times.<n>Considering quantum computing attacks, lattice-based $k$-TAA was introduced.<n>First lattice-based dynamic $k$-TAA offers limited times anonymous authentication, dynamic member management, and post-quantum security.
  arXiv  Detail & Related papers  (2025-09-26T02:42:31Z)
• Anonymous Authentication using Attribute-based Encryption [0.0]
  Attribute-Based Encryption (ABE) has emerged as a promising approach to privacy-preserving data protection.<n>This paper proposes an anonymous authentication mechanism based on ABE, which allows users to authenticate without revealing their identity.
  arXiv  Detail & Related papers  (2025-06-17T14:24:28Z)
• iFADIT: Invertible Face Anonymization via Disentangled Identity Transform [51.123936665445356]
  Face anonymization aims to conceal the visual identity of a face to safeguard the individual's privacy. This paper proposes a novel framework named iFADIT, an acronym for Invertible Face Anonymization via Disentangled Identity Transform.
  arXiv  Detail & Related papers  (2025-01-08T10:08:09Z)
• AIDBench: A benchmark for evaluating the authorship identification capability of large language models [14.866356328321126]
  We focus on a specific privacy risk where large language models (LLMs) may help identify the authorship of anonymous texts. We present AIDBench, a new benchmark that incorporates several author identification datasets, including emails, blogs, reviews, articles, and research papers. Our experiments with AIDBench demonstrate that LLMs can correctly guess authorship at rates well above random chance, revealing new privacy risks posed by these powerful models.
  arXiv  Detail & Related papers  (2024-11-20T11:41:08Z)
• Robust Utility-Preserving Text Anonymization Based on Large Language Models [80.5266278002083]
  Text anonymization is crucial for sharing sensitive data while maintaining privacy. Existing techniques face the emerging challenges of re-identification attack ability of Large Language Models. This paper proposes a framework composed of three LLM-based components -- a privacy evaluator, a utility evaluator, and an optimization component.
  arXiv  Detail & Related papers  (2024-07-16T14:28:56Z)
• IncogniText: Privacy-enhancing Conditional Text Anonymization via LLM-based Private Attribute Randomization [8.483679748399037]
  We propose IncogniText, a technique that anonymizes the text to mislead a potential adversary into predicting a wrong private attribute value. Our empirical evaluation shows a reduction of private attribute leakage by more than 90%.
  arXiv  Detail & Related papers  (2024-07-03T09:49:03Z)
• HetDAPAC: Distributed Attribute-Based Private Access Control with Heterogeneous Attributes [35.16231062731263]
  We show that off-loading a subset of attributes to a central server for verification improves the achievable rate from $frac12K$ in Jafarpisheh et al. to $frac1K+1$ in this paper.
  arXiv  Detail & Related papers  (2024-01-24T18:48:28Z)
• Disentangle Before Anonymize: A Two-stage Framework for Attribute-preserved and Occlusion-robust De-identification [55.741525129613535]
  "Disentangle Before Anonymize" is a novel two-stage Framework(DBAF) This framework includes a Contrastive Identity Disentanglement (CID) module and a Key-authorized Reversible Identity Anonymization (KRIA) module. Extensive experiments demonstrate that our method outperforms state-of-the-art de-identification approaches.
  arXiv  Detail & Related papers  (2023-11-15T08:59:02Z)
• Unsupervised Text Deidentification [101.2219634341714]
  We propose an unsupervised deidentification method that masks words that leak personally-identifying information. Motivated by K-anonymity based privacy, we generate redactions that ensure a minimum reidentification rank.
  arXiv  Detail & Related papers  (2022-10-20T18:54:39Z)
• I still know it's you! On Challenges in Anonymizing Source Code [8.564130805577939]
  Code attribution poses a threat to developers of anti-censorship and privacy-enhancing technologies. We develop a framework for reasoning about code anonymization. We find that none of the techniques provides sufficient protection when the attacker is aware of the anonymization.
  arXiv  Detail & Related papers  (2022-08-26T10:07:27Z)
• Smooth Anonymity for Sparse Graphs [69.1048938123063]
  differential privacy has emerged as the gold standard of privacy, however, when it comes to sharing sparse datasets. In this work, we consider a variation of $k$-anonymity, which we call smooth-$k$-anonymity, and design simple large-scale algorithms that efficiently provide smooth-$k$-anonymity.
  arXiv  Detail & Related papers  (2022-07-13T17:09:25Z)
• Protecting Anonymous Speech: A Generative Adversarial Network Methodology for Removing Stylistic Indicators in Text [2.9005223064604078]
  We develop a new approach to authorship anonymization by constructing a generative adversarial network. Our fully automatic method achieves comparable results to other methods in terms of content preservation and fluency. Our approach is able to generalize well to an open-set context and anonymize sentences from authors it has not encountered before.
  arXiv  Detail & Related papers  (2021-10-18T17:45:56Z)
• rx-anon -- A Novel Approach on the De-Identification of Heterogeneous Data based on a Modified Mondrian Algorithm [3.077802365568915]
  rx-anon is an anonymization approach for heterogeneous semi-structured documents composed of relational and textual attributes. We map sensitive terms extracted from the text to the structured data. We introduce the concept of redundant sensitive information to consistently anonymize the data.
  arXiv  Detail & Related papers  (2021-05-18T21:50:12Z)
• Disentanglement-based Cross-Domain Feature Augmentation for Effective Unsupervised Domain Adaptive Person Re-identification [87.72851934197936]
  Unsupervised domain adaptive (UDA) person re-identification (ReID) aims to transfer the knowledge from the labeled source domain to the unlabeled target domain for person matching. One challenge is how to generate target domain samples with reliable labels for training. We propose a Disentanglement-based Cross-Domain Feature Augmentation strategy.
  arXiv  Detail & Related papers  (2021-03-25T15:28:41Z)
• Self-paced Contrastive Learning with Hybrid Memory for Domain Adaptive Object Re-ID [55.21702895051287]
  Domain adaptive object re-ID aims to transfer the learned knowledge from the labeled source domain to the unlabeled target domain. We propose a novel self-paced contrastive learning framework with hybrid memory. Our method outperforms state-of-the-arts on multiple domain adaptation tasks of object re-ID.
  arXiv  Detail & Related papers  (2020-06-04T09:12:44Z)
• Sparsely-Labeled Source Assisted Domain Adaptation [64.75698236688729]
  This paper proposes a novel Sparsely-Labeled Source Assisted Domain Adaptation (SLSA-DA) algorithm. Due to the label scarcity problem, the projected clustering is conducted on both the source and target domains.
  arXiv  Detail & Related papers  (2020-05-08T15:37:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.