Adaptively secure ABE for DFA from \(k\)-Lin and more
From MaRDI portal
Publication:2055655
DOI10.1007/978-3-030-45727-3_10zbMath1479.94179OpenAlexW3013406800MaRDI QIDQ2055655
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45727-3_10
Related Items (13)
Bounded Collusion ABE for TMs from IBE ⋮ Fully adaptive decentralized multi-authority \textsf{ABE} ⋮ Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys from \(k\)-Lin ⋮ A generic construction of CCA-secure attribute-based encryption with equality test ⋮ 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 ⋮ ABE for DFA from LWE against bounded collusions, revisited ⋮ Tag-based ABE in prime-order groups via pair encoding ⋮ Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}} ⋮ Fully secure ABE with outsourced decryption against chosen ciphertext attack ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
Cites Work
- Unbounded ABE via bilinear entropy expansion, revisited
- Be adaptive, avoid overcommitting
- Attribute based encryption for deterministic finite automata from DLIN
- Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin
- ABE for DFA from \(k\)-lin
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings
- An Algebraic Framework for Diffie-Hellman Assumptions
- Functional Encryption for Regular Languages
- Semi-adaptive Attribute-Based Encryption and Improved Delegation for Boolean Formula
- Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting
- 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
- 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
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Fuzzy Identity-Based Encryption
- Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
- Simplifying Design and Analysis of Complex Predicate Encryption Schemes
This page was built for publication: Adaptively secure ABE for DFA from \(k\)-Lin and more
