Decentralized Multi-Authority Attribute-Based Inner-Product Functional Encryption: Noisy and Evasive Constructions from Lattices

• URL: http://arxiv.org/abs/2505.11744v1
• Date: Fri, 16 May 2025 23:03:23 GMT
• Title: Decentralized Multi-Authority Attribute-Based Inner-Product Functional Encryption: Noisy and Evasive Constructions from Lattices
• Authors: Jiaqi Liu, Yan Wang, Fang-Wei Fu,
• Abstract summary: We study multi-authority attribute-based functional encryption for noisy inner-product functionality.<n>We propose two new primitives: (1) multi-authority attribute-based (noisy) inner-product functional encryption (MA-AB(N)IPFE), and (2) multi-authority attribute-based evasive inner-product functional encryption (MA-evIPFE)<n>Our schemes are proven to be statically secure in the random oracle model under the standard LWE assumption and the newly introduced assumptions.
• Score: 26.8852774949828
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study multi-authority attribute-based functional encryption for noisy inner-product functionality, and propose two new primitives: (1) multi-authority attribute-based (noisy) inner-product functional encryption (MA-AB(N)IPFE), which generalizes existing multi-authority attribute-based IPFE schemes by Agrawal et al. (TCC'21), by enabling approximate inner-product computation; and (2) multi-authority attribute-based evasive inner-product functional encryption (MA-evIPFE), a relaxed variant inspired by the evasive IPFE framework by Hsieh et al. (EUROCRYPT'24), shifting focus from ciphertext indistinguishability to a more relaxed pseudorandomness-based security notion. To support the above notions, we introduce two variants of lattice-based computational assumptions: evasive IPFE assumption and indistinguishability-based evasive IPFE assumption (IND-evIPFE). We present lattice-based constructions of both primitives for subset policies, building upon the framework of Waters et al.( TCC'22). Our schemes are proven to be statically secure in the random oracle model under the standard LWE assumption and the newly introduced assumptions. Additionally, we show our MA-AB(N)IPFE scheme can be transformed via modulus switching into a noiseless MA-IPFE scheme that supports exact inner-product functionality. This yields the first lattice-based construction of such a primitive. All our schemes support arbitrary polynomial-size attribute policies and are secure in the random oracle model under lattice assumptions with a sub-exponential modulus-to-noise ratio, making them practical candidates for noise-tolerant, fine-grained access control in multi-authority settings.

Related papers

• Post-Quantum Secure Aggregation via Code-Based Homomorphic Encryption [19.264286608481296]
  We present a code-based alternative for secure aggregation based on key- and message-additive homomorphic encryption.<n>Our construction employs a committee-based decryptor realized via secret sharing.<n>We evaluate performance and identify regimes in which our approach outperforms information-theoretically secure aggregation protocols.
  arXiv  Detail & Related papers  (2026-01-19T13:14:01Z)
• Wrangling Entropy: Next-Generation Multi-Factor Key Derivation, Credential Hashing, and Credential Generation Functions [47.715495058757824]
  We present a novel cryptanalytic technique designed to reveal pernicious leaks of entropy across multiple invocations of a cryptographic key derivation or hash function.<n>We show that it can be used to correctly identify each of the known vulnerabilities in the original MFKDF construction.<n>We propose a new construction for MFKDF2,'' a next-generation multi-factor key derivation function that can be proven to be end-to-end secure.
  arXiv  Detail & Related papers  (2025-09-07T02:01:53Z)
• A Training Framework for Optimal and Stable Training of Polynomial Neural Networks [0.462761393623313]
  Polynomial Neural Networks (PNNs) are pivotal for applications such as privacy-preserving Encryption viaHE.<n>Low-degrees can limit model expressivity, while higher-degrees often suffer from numerical instability and gradient explosion.<n>We introduce a robust and versatile training framework featuring two innovations: 1) a novel Boundary Loss that exponentially penalizes inputs outside a predefined stable range, and 2) Selective Gradient Clipping that effectively tames gradient magnitudes while preserving essential Normalization statistics.
  arXiv  Detail & Related papers  (2025-05-16T18:00:02Z)
• Enhancing Noisy Functional Encryption for Privacy-Preserving Machine Learning [0.0]
  Functional encryption (FE) has attracted interest in privacy-preserving machine learning (PPML)<n>We extend the notion of noisy multi-input functional encryption (NMIFE) to (dynamic) noisy multi-client functional encryption ((Dy)NMCFE)
  arXiv  Detail & Related papers  (2025-05-09T07:33:09Z)
• A Unified Framework and Efficient Computation for Privacy Amplification via Shuffling [6.702635586444281]
  We present a unified perspective--termed the textitgeneral clone paradigm--that captures all decomposition-based analyses.<n>We identify the optimal decomposition within this framework and design a simple yet efficient algorithm based on the Fast Fourier Transform (FFT) to compute tight privacy amplification bounds.
  arXiv  Detail & Related papers  (2025-04-10T03:11:17Z)
• Exploiting Mixture-of-Experts Redundancy Unlocks Multimodal Generative Abilities [69.26544016976396]
  We exploit the redundancy within Mixture-of-Experts (MoEs) as a source of additional capacity for learning a new modality.<n>We preserve the original language generation capabilities by applying low-rank adaptation exclusively to the tokens of the new modality.
  arXiv  Detail & Related papers  (2025-03-28T15:21:24Z)
• Multi-Attribute Constraint Satisfaction via Language Model Rewriting [67.5778646504987]
  Multi-Attribute Constraint Satisfaction (MACS) is a method capable of finetuning language models to satisfy user-specified constraints on multiple external real-value attributes.<n>Our work opens new avenues for generalized and real-value multi-attribute control, with implications for diverse applications spanning NLP and bioinformatics.
  arXiv  Detail & Related papers  (2024-12-26T12:36:39Z)
• DR-Encoder: Encode Low-rank Gradients with Random Prior for Large Language Models Differentially Privately [16.883679810267342]
  We investigate three potential information leakage during a fine-tuning procedure for Large Language Model (LLM)<n>Based on the potential information leakage, we provide an end-to-end privacy guarantee solution for FedLLM by inserting two-stage randomness.<n>We show the efficiency and accuracy gains of our proposed method with several foundation models and two popular evaluation benchmarks.
  arXiv  Detail & Related papers  (2024-12-22T15:06:09Z)
• Multi-modal biometric authentication: Leveraging shared layer architectures for enhanced security [0.0]
  We introduce a novel multi-modal biometric authentication system that integrates facial, vocal, and signature data to enhance security measures. Our model architecture incorporates dual shared layers alongside modality-specific enhancements for comprehensive feature extraction. Our approach demonstrates significant improvements in authentication accuracy and robustness, paving the way for advanced secure identity verification solutions.
  arXiv  Detail & Related papers  (2024-11-04T14:27:10Z)
• Non-stationary Reinforcement Learning under General Function Approximation [60.430936031067006]
  We first propose a new complexity metric called dynamic Bellman Eluder (DBE) dimension for non-stationary MDPs. Based on the proposed complexity metric, we propose a novel confidence-set based model-free algorithm called SW-OPEA. We show that SW-OPEA is provably efficient as long as the variation budget is not significantly large.
  arXiv  Detail & Related papers  (2023-06-01T16:19:37Z)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00:20Z)
• Interpreting Primal-Dual Algorithms for Constrained Multiagent Reinforcement Learning [4.67306371596399]
  Most C-MARL algorithms use a primal-dual approach to enforce constraints through a penalty function added to the reward. We show that the standard practice of using the constraint function as the penalty leads to a weak notion of safety. We propose a constrained multiagent advantage actor critic (C-MAA2C) algorithm.
  arXiv  Detail & Related papers  (2022-11-29T10:23:26Z)
• Benefits of Monotonicity in Safe Exploration with Gaussian Processes [50.71125084216603]
  We consider the problem of sequentially maximising an unknown function over a set of actions. We show that textscsffamily M-SafeUCB enjoys theoretical guarantees in terms of safety, a suitably-defined regret notion, and approximately finding the entire safe boundary.
  arXiv  Detail & Related papers  (2022-11-03T02:52:30Z)
• A^2-FPN: Attention Aggregation based Feature Pyramid Network for Instance Segmentation [68.10621089649486]
  We propose Attention Aggregation based Feature Pyramid Network (A2-FPN) to improve multi-scale feature learning. A2-FPN achieves an improvement of 2.0% and 1.4% mask AP when integrated into the strong baselines such as Cascade Mask R-CNN and Hybrid Task Cascade.
  arXiv  Detail & Related papers  (2021-05-07T11:51:08Z)
• Implicit Distributional Reinforcement Learning [61.166030238490634]
  implicit distributional actor-critic (IDAC) built on two deep generator networks (DGNs) Semi-implicit actor (SIA) powered by a flexible policy distribution. We observe IDAC outperforms state-of-the-art algorithms on representative OpenAI Gym environments.
  arXiv  Detail & Related papers  (2020-07-13T02:52:18Z)

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.