Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded
From MaRDI portal
Publication:6091135
DOI10.1007/978-3-031-31368-4_21zbMath1527.94031OpenAlexW4367663737MaRDI QIDQ6091135
Publication date: 24 November 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-31368-4_21
Cites Work
- Unnamed Item
- Unnamed Item
- Unbounded ABE via bilinear entropy expansion, revisited
- Decentralized multi-client functional encryption for inner product
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
- Multi-input quadratic functional encryption from pairings
- Attribute-based access control for inner product functional encryption from LWE
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- From single-input to multi-client inner-product functional encryption
- Decentralizing inner-product functional encryption
- Unbounded inner-product functional encryption with succinct keys
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Inner-product functional encryption with fine-grained access control
- Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH
- Multi-party functional encryption
- Functional Encryption for Inner Product with Full Function Privacy
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
- Simple Functional Encryption Schemes for Inner Products
- Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption
- Functional Encryption: Definitions and Challenges
- Decentralizing Attribute-Based Encryption
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
- Efficient Lattice (H)IBE in the Standard Model
- The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions
- A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Fuzzy Identity-Based Encryption
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Indistinguishability obfuscation from well-founded assumptions
- Multi-authority ABE from lattices without random oracles
- Multi-client functional encryption with fine-grained access control
This page was built for publication: Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded
