ABE for circuits with constant-size secret keys and adaptive security
From MaRDI portal
Publication:6114257
DOI10.1007/978-3-031-22318-1_24zbMath1519.94157OpenAlexW4312500318MaRDI QIDQ6114257
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22318-1_24
Related Items (3)
New ways to garble arithmetic circuits ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ ABE for circuits with constant-size secret keys and adaptive security
Cites Work
- On computing the determinant in small parallel time using a small number of processors
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- On the complexity of simulating auxiliary input
- Attribute-hiding predicate encryption in bilinear groups, revisited
- Private constrained PRFs (and more) from LWE
- Optimal broadcast encryption from pairings and LWE
- Optimal broadcast encryption from LWE and pairings in the standard model
- Fully secure attribute-based encryption for \(t\)-CNF from LWE
- Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin
- Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- Succinct and adaptively secure ABE for ABP from \(k\)-Lin
- Riding on Asymmetry: Efficient ABE for Branching Programs
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- How to Run Turing Machines on Encrypted Data
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Functional Encryption with Bounded Collusions via Multi-party Computation
- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
- Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption
- Simple Functional Encryption Schemes for Inner Products
- Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings
- Functional Encryption: Definitions and Challenges
- Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Structure and importance of logspace-MOD class
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Fuzzy Identity-Based Encryption
- A Framework and Compact Constructions for Non-monotonic Attribute-Based Encryption
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Witness encryption and its applications
- Attribute-based encryption for circuits
- How to Fake Auxiliary Input
- ABE for circuits with constant-size secret keys and adaptive security
This page was built for publication: ABE for circuits with constant-size secret keys and adaptive security
