On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
From MaRDI portal
Publication:6063529
DOI10.1007/978-3-031-30620-4_16zbMath1528.94060OpenAlexW4365807494MaRDI QIDQ6063529
Huijia Lin, J. Luo, Aayush Jain
Publication date: 12 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30620-4_16
Related Items (1)
Cites Work
- Adaptive garbled RAM from laconic oblivious transfer
- A simple construction of iO for Turing machines
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- FE and iO for Turing machines from minimal assumptions
- Adaptively secure garbling with near optimal online complexity
- Indistinguishability obfuscation for Turing machines: constant overhead and amortization
- Can we access a database both locally and privately?
- Towards doubly efficient private information retrieval
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Incompressible cryptography
- Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- 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
- Functional Encryption for Turing Machines
- Fully Succinct Garbled RAM
- Cryptography for Parallel RAM from Indistinguishability Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Adaptively Secure Garbled Circuits from One-Way Functions
- On the Achievability of Simulation-Based Security for Functional Encryption
- How to Run Turing Machines on Encrypted Data
- Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- 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
- Delegating RAM Computations with Adaptive Soundness and Privacy
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database
- Single-Key to Multi-Key Functional Encryption with Polynomial Loss
- Compactness vs Collusion Resistance in Functional Encryption
- Predicate Encryption for Circuits from LWE
- Bloom Filters in Adversarial Environments
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- Function-Private Functional Encryption in the Private-Key Setting
- 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
- Attribute-based encryption for circuits
- Simple and generic constructions of succinct functional encryption
- Indistinguishability obfuscation from well-founded assumptions
- ABE for circuits with constant-size secret keys and adaptive security
- Collusion-resistant functional encryption for RAMs
This page was built for publication: On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
