HetDAPAC: Distributed Attribute-Based Private Access Control with Heterogeneous Attributes

• URL: http://arxiv.org/abs/2401.13653v1
• Date: Wed, 24 Jan 2024 18:48:28 GMT
• Title: HetDAPAC: Distributed Attribute-Based Private Access Control with Heterogeneous Attributes
• Abstract summary: 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.
• Score: 35.16231062731263
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Verifying user attributes to provide fine-grained access control to databases is fundamental to an attribute-based authentication system. In such systems, either a single (central) authority verifies all attributes, or multiple independent authorities verify individual attributes distributedly to allow a user to access records stored on the servers. While a \emph{central} setup is more communication cost efficient, it causes privacy breach of \emph{all} user attributes to a central authority. Recently, Jafarpisheh et al. studied an information theoretic formulation of the \emph{distributed} multi-authority setup with $N$ non-colluding authorities, $N$ attributes and $K$ possible values for each attribute, called an $(N,K)$ distributed attribute-based private access control (DAPAC) system, where each server learns only one attribute value that it verifies, and remains oblivious to the remaining $N-1$ attributes. We show that off-loading a subset of attributes to a central server for verification improves the achievable rate from $\frac{1}{2K}$ in Jafarpisheh et al. to $\frac{1}{K+1}$ in this paper, thus \emph{almost doubling the rate} for relatively large $K$, while sacrificing the privacy of a few possibly non-sensitive attributes.

Related papers

• A Tight Expressivity Hierarchy for GNN-Based Entity Resolution in Master Data Management [2.4366811507669115]
  We prove a four-theorem separation theory on typed entity-attribute graphs.<n>For each predicate we prove tight bounds -- constructing graph pairs provably indistinguishable by every MPNN lacking the required adaptation.<n>Results yield a minimal-architecture principle: practitioners can select the cheapest sufficient adaptation set, with a guarantee that no simpler architecture works.
  arXiv  Detail & Related papers  (2026-03-28T06:38:03Z)
• TAPAS: Efficient Two-Server Asymmetric Private Aggregation Beyond Prio(+) [7.713377215066152]
  We present TAPAS, a two-server asymmetric private aggregation scheme.<n>A key design choice is intentional asymmetry: one server bears the $O(L)$ aggregation and verification work, while the other operates as a lightweight facilitator.<n>We are the first to establish privacy and correctness with identifiable abort in the two-server setting.
  arXiv  Detail & Related papers  (2026-03-20T13:52:09Z)
• HetDAPAC: Leveraging Attribute Heterogeneity in Distributed Attribute-Based Private Access Control [43.914623898157856]
  Heterogeneous (Het)DAPAC is a framework which off-loads verification of $N-D$ of the $N$ attributes to a central server.<n>We propose a second scheme achieving a balanced per-server download and a rate of $frac12K$.
  arXiv  Detail & Related papers  (2025-11-14T18:40:17Z)
• FLAME: Flexible and Lightweight Biometric Authentication Scheme in Malicious Environments [28.701804496120406]
  biometric underlineAuthentication scheme designed for a underlineMalicious underlineEnvironment.<n>A rigorous theoretical analysis validates the correctness, security, and efficiency of $sysname$.
  arXiv  Detail & Related papers  (2025-11-04T01:43:03Z)
• Information-Theoretic Decentralized Secure Aggregation with Collusion Resilience [98.31540557973179]
  We study the problem of decentralized secure aggregation (DSA) from an information-theoretic perspective.<n>We characterize the optimal rate region, which specifies the minimum achievable communication and secret key rates for DSA.<n>Our results establish the fundamental performance limits of DSA, providing insights for the design of provably secure and communication-efficient protocols.
  arXiv  Detail & Related papers  (2025-08-01T12:51:37Z)
• Frequency Estimation of Correlated Multi-attribute Data under Local Differential Privacy [5.258253745672122]
  Local Differential Privacy (LDP) is a powerful tool to protect user data privacy.<n>Existing LDP mechanisms either split the privacy budget across all attributes or treat each attribute independently.<n>We propose Correlated Randomized Response (Corr-RR), a novel LDP mechanism that leverages correlations among attributes to substantially improve utility.
  arXiv  Detail & Related papers  (2025-07-23T13:52:45Z)
• An Approach for Handling Missing Attribute Values in Attribute-Based Access Control Policy Mining [0.0]
  Attribute-Based Access Control (ABAC) enables highly expressive and flexible access decisions by considering a wide range of contextual attributes.<n>Algorithms that mine ABAC policies from legacy access control systems can significantly reduce the costs associated with migrating to ABAC.<n>This paper introduces an approach that enhances the policy mining process by predicting or inferring missing attribute values.
  arXiv  Detail & Related papers  (2025-05-03T17:34:46Z)
• The Distributed Multi-User Point Function [0.0]
  We study the problem of information-theoretic distributed multi-user point function, involving a trusted master node, $N in mathbbN$ server nodes, and $Kin mathbbN$ users. We propose a multi-user scheme that satisfies the correctness and information-theoretic privacy constraints, ensuring recovery for all point functions.
  arXiv  Detail & Related papers  (2025-01-17T15:34:45Z)
• Unified Breakdown Analysis for Byzantine Robust Gossip [15.69624587054777]
  In decentralized machine learning, different devices communicate in a peer-to-peer manner to collaboratively learn from each other's data. We introduce $mathrmFtext-rm RG$, a general framework for building robust decentralized algorithms. We show an upper bound on the number of adversaries that decentralized algorithms can tolerate.
  arXiv  Detail & Related papers  (2024-10-14T12:10:52Z)
• Differential Privacy of Cross-Attention with Provable Guarantee [18.331374727331077]
  We design a novel differential privacy (DP) data structure to address the privacy security of cross-attention with a theoretical guarantee. Our result is robust to adaptive queries in which users can intentionally attack the cross-attention system.
  arXiv  Detail & Related papers  (2024-07-20T01:02:27Z)
• Federated Combinatorial Multi-Agent Multi-Armed Bandits [79.1700188160944]
  This paper introduces a federated learning framework tailored for online optimization with bandit. In this setting, agents subsets of arms, observe noisy rewards for these subsets without accessing individual arm information, and can cooperate and share information at specific intervals.
  arXiv  Detail & Related papers  (2024-05-09T17:40:09Z)
• Guaranteeing Anonymity in Attribute-Based Authorization [3.2697504912958633]
  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.
  arXiv  Detail & Related papers  (2023-10-07T19:09:17Z)
• Group Pose: A Simple Baseline for End-to-End Multi-person Pose Estimation [102.02917299051757]
  We present a simple yet effective transformer approach, named Group Pose. We replace single self-attention over all the $Ntimes(K+1)$ queries with two subsequent group self-attentions. Experimental results on MS COCO and CrowdPose show that our approach without human box supervision is superior to previous methods.
  arXiv  Detail & Related papers  (2023-08-14T17:58:04Z)
• Generating $k$ EPR-pairs from an $n$-party resource state [5.617510227362658]
  We show that LOCC protocols can create EPR-pairs between any $k$ disjoint pairs of parties. We also prove some lower bounds, for example showing that if $k=n/2$ then the parties must have at least $Omega(loglog n)$ qubits each.
  arXiv  Detail & Related papers  (2022-11-11T22:18:27Z)
• MACSum: Controllable Summarization with Mixed Attributes [56.685735509260276]
  MACSum is the first human-annotated summarization dataset for controlling mixed attributes. We propose two simple and effective parameter-efficient approaches for the new task of mixed controllable summarization.
  arXiv  Detail & Related papers  (2022-11-09T17:17:37Z)
• AdaTag: Multi-Attribute Value Extraction from Product Profiles with Adaptive Decoding [55.89773725577615]
  We present AdaTag, which uses adaptive decoding to handle attribute extraction. Our experiments on a real-world e-Commerce dataset show marked improvements over previous methods.
  arXiv  Detail & Related papers  (2021-06-04T07:54:11Z)
• Exploring and Evaluating Attributes, Values, and Structures for Entity Alignment [100.19568734815732]
  Entity alignment (EA) aims at building a unified Knowledge Graph (KG) of rich content by linking the equivalent entities from various KGs. attribute triples can also provide crucial alignment signal but have not been well explored yet. We propose to utilize an attributed value encoder and partition the KG into subgraphs to model the various types of attribute triples efficiently.
  arXiv  Detail & Related papers  (2020-10-07T08:03:58Z)
• Differentially Private Set Union [23.001440922454407]
  We study the basic operation of set union in the global model of differential privacy. In this problem, we are given a universe $U$ of items, possibly of infinite size, and a database $D$ of users. We want an ($epsilon$,$delta$)-differentially private algorithm which outputs a subset $S subset cup_i W_i$ such that the size of $S$ is as large as possible.
  arXiv  Detail & Related papers  (2020-02-22T18:33:14Z)

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.