Inner-product functional encryption with fine-grained access control
From MaRDI portal
Publication:2691594
DOI10.1007/978-3-030-64840-4_16OpenAlexW3029445927MaRDI QIDQ2691594
Dario Catalano, Romain Gay, Bogdan Ursu, Michel Abdalla
Publication date: 29 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64840-4_16
Related Items (19)
Unbounded quadratic functional encryption and more from pairings ⋮ Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys from \(k\)-Lin ⋮ Multi-authority ABE for non-monotonic access structures ⋮ Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities ⋮ Multi-client functional encryption with fine-grained access control ⋮ (Inner-product) functional encryption with updatable ciphertexts ⋮ Attribute-based multi-input FE (and more) for attribute-weighted sums ⋮ Multi-party functional encryption ⋮ Verifiable functional encryption using Intel SGX ⋮ Registered ABE via predicate encodings ⋮ Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions ⋮ Improved unbounded inner-product functional encryption ⋮ Registered attribute-based signature ⋮ Lower bounds for lattice-based compact functional encryption ⋮ New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts ⋮ Functional encryption for attribute-weighted sums from \(k\)-Lin
Cites Work
- Unnamed Item
- Protecting data privacy in private information retrieval schemes
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Generic transformations of predicate encodings: constructions and applications
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Conditional disclosure of secrets via non-linear reconstruction
- Attribute-hiding predicate encryption in bilinear groups, revisited
- Improved inner-product encryption with adaptive security and full attribute-hiding
- Decentralized multi-client functional encryption for inner product
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
- Function-hiding inner product encryption is practical
- Multi-client functional encryption for linear functions in the standard model from LWE
- From single-input to multi-client inner-product functional encryption
- FE for inner products and its application to decentralized ABE
- Decentralizing inner-product functional encryption
- Efficient function-hiding functional encryption: from inner-products to orthogonality
- 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}\)
- Functional Encryption for Inner Product with Full Function Privacy
- A Study of Pair Encodings: Predicate Encryption in Prime Order Groups
- Function-Hiding Inner Product Encryption
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Simple Functional Encryption Schemes for Inner Products
- Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
- Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings
- Identity-Based Cryptosystems and Signature Schemes
- Functional Encryption: Definitions and Challenges
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
- Predicate Encryption for Circuits from LWE
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient Lattice (H)IBE in the Standard Model
- A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials
- Fuzzy Identity-Based Encryption
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Attribute-based encryption for circuits
- CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- Multi-input Inner-Product Functional Encryption from Pairings
- Simplifying Design and Analysis of Complex Predicate Encryption Schemes
- Dual System Encryption via Predicate Encodings
- Unbounded inner product functional encryption from bilinear maps
This page was built for publication: Inner-product functional encryption with fine-grained access control
