Attribute based encryption for deterministic finite automata from DLIN
From MaRDI portal
Publication:2175933
DOI10.1007/978-3-030-36033-7_4zbMath1455.94102OpenAlexW2990824261MaRDI QIDQ2175933
Shweta Agrawal, Monosij Maitra, Shota Yamada
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36033-7_4
Related Items (10)
Attribute based encryption for deterministic finite automata from DLIN ⋮ Bounded Collusion ABE for TMs from IBE ⋮ A generic construction of CCA-secure attribute-based encryption with equality test ⋮ Unbounded dynamic predicate compositions in ABE from standard assumptions ⋮ ABE for DFA from LWE against bounded collusions, revisited ⋮ Tag-based ABE in prime-order groups via pair encoding ⋮ Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) ⋮ Adaptively secure ABE for DFA from \(k\)-Lin and more ⋮ Functional encryption for attribute-weighted sums from \(k\)-Lin ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
Cites Work
- Unnamed Item
- FE and iO for Turing machines from minimal assumptions
- Unbounded ABE via bilinear entropy expansion, revisited
- Attribute based encryption for deterministic finite automata from DLIN
- 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
- Functional Encryption for Turing Machines
- A Study of Pair Encodings: Predicate Encryption in Prime Order Groups
- Riding on Asymmetry: Efficient ABE for Branching Programs
- Conversions Among Several Classes of Predicate Encryption and Applications to ABE with Various Compactness Tradeoffs
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Cryptanalysis of the New CLT Multilinear Map over the Integers
- Cryptanalysis of GGH Map
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- How to Run Turing Machines on Encrypted Data
- Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
- Functional Encryption for Regular Languages
- Semi-adaptive Attribute-Based Encryption and Improved Delegation for Boolean Formula
- Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption
- Cryptanalysis of the Multilinear Map over the Integers
- Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
- Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Unbounded HIBE and Attribute-Based Encryption
- Functional Encryption for Inner Product Predicates from Learning with Errors
- Semi-adaptive Security and Bundling Functionalities Made Generic and Easy
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Predicate Encryption for Circuits from LWE
- Bilinear Entropy Expansion from the Decisional Linear Assumption
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- 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
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Generalized Identity Based and Broadcast Encryption Schemes
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Candidate Multilinear Maps from Ideal Lattices
- Reusable Garbled Deterministic Finite Automata from Learning With Errors
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
- 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
- Witness encryption and its applications
- Attribute-based encryption for circuits
- Reusable garbled circuits and succinct functional encryption
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- Dual System Encryption via Predicate Encodings
This page was built for publication: Attribute based encryption for deterministic finite automata from DLIN
