Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
From MaRDI portal
Publication:2055654
DOI10.1007/978-3-030-45727-3_9zbMath1479.94217OpenAlexW3021450032MaRDI QIDQ2055654
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45727-3_9
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Classical models of computation (Turing machines, etc.) (68Q04)
Related Items (15)
Functional encryption for Turing machines with dynamic bounded collusion from LWE ⋮ (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin ⋮ Fully adaptive decentralized multi-authority \textsf{ABE} ⋮ Unbounded quadratic functional encryption and more from pairings ⋮ Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ Compact FE for unbounded attribute-weighted sums for logspace from SXDH ⋮ Attribute-based multi-input FE (and more) for attribute-weighted sums ⋮ Hierarchical and non-monotonic key-policy attribute-based encryption and its application ⋮ Unbounded dynamic predicate compositions in ABE from standard assumptions ⋮ Succinct and adaptively secure ABE for ABP from \(k\)-Lin ⋮ Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH ⋮ Simple and efficient FE for quadratic functions ⋮ Fully secure ABE with outsourced decryption against chosen ciphertext attack ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
Cites Work
- FE and iO for Turing machines from minimal assumptions
- Unbounded ABE via bilinear entropy expansion, revisited
- Be adaptive, avoid overcommitting
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Attribute-hiding predicate encryption in bilinear groups, revisited
- Improved inner-product encryption with adaptive security and full attribute-hiding
- Mitigating the one-use restriction in attribute-based encryption
- Function-hiding inner product encryption is practical
- Efficient functional encryption for inner-product values with full-hiding security
- Attribute based encryption for deterministic finite automata from DLIN
- Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more
- Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin
- Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously
- ABE for DFA from \(k\)-lin
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- Functional Encryption for Turing Machines
- Functional Encryption for Inner Product with Full Function Privacy
- Function-Hiding Inner Product Encryption
- Riding on Asymmetry: Efficient ABE for Branching Programs
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- An Algebraic Framework for Diffie-Hellman Assumptions
- How to Run Turing Machines on Encrypted Data
- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
- Functional Encryption for Regular Languages
- Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
- Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings
- Unbounded HIBE and Attribute-Based Encryption
- Delegating RAM Computations with Adaptive Soundness and Privacy
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Attribute-Based Encryption for Finite Automata from LWE
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Predicate Privacy in Encryption Systems
- Hierarchical Predicate Encryption for Inner-Products
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Partial Garbling Schemes and Their Applications
- 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
- How to Garble Arithmetic Circuits
- Attribute-based encryption for circuits
- Reusable garbled circuits and succinct functional encryption
- Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- Simplifying Design and Analysis of Complex Predicate Encryption Schemes
- Dual System Encryption via Predicate Encodings
- Unnamed Item
- Unnamed Item
This page was built for publication: Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
