Attribute based encryption for deterministic finite automata from DLIN
From MaRDI portal
Publication:2175933
Recommendations
- ABE for DFA from k-lin
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Attribute-based encryption for finite automata from LWE
- Adaptively secure ABE for DFA from \(k\)-Lin and more
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
Cites work
- A study of pair encodings: predicate encryption in prime order groups
- ABE for DFA from k-lin
- Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Attribute based encryption for deterministic finite automata from DLIN
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Attribute-based encryption for circuits
- Attribute-based encryption for finite automata from LWE
- Bilinear entropy expansion from the decisional linear assumption
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate Multilinear Maps from Ideal Lattices
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Conversions among several classes of predicate encryption and applications to ABE with various compactness tradeoffs
- Cryptanalysis of GGH map
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
- Cryptanalysis of the multilinear map over the integers
- Cryptanalysis of the new CLT multilinear map over the integers
- Dual system encryption framework in prime-order groups via computational pair encodings
- Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more
- Dual System Encryption via Predicate Encodings
- Efficient statically-secure large-universe multi-authority attribute-based encryption
- FE and iO for Turing machines from minimal assumptions
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully secure functional encryption with general relations from the decisional linear assumption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Fully secure unbounded inner-product and attribute-based encryption
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- Functional encryption for inner product predicates from learning with errors
- Functional encryption for regular languages
- Functional Encryption for Turing Machines
- Fuzzy Identity-Based Encryption
- Generalized Identity Based and Broadcast Encryption Schemes
- How to run Turing machines on encrypted data
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Improved dual system ABE in prime-order groups via predicate encodings
- New proof methods for attribute-based encryption: achieving full security through selective techniques
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Predicate encryption for circuits from LWE
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Reusable garbled circuits and succinct functional encryption
- Reusable garbled deterministic finite automata from learning with errors
- Riding on asymmetry: efficient ABE for branching programs
- Semi-adaptive attribute-based encryption and improved delegation for Boolean formula
- Semi-adaptive security and bundling functionalities made generic and easy
- Tools for simulating features of composite order bilinear groups in the prime order setting
- Unbounded ABE via bilinear entropy expansion, revisited
- Unbounded HIBE and Attribute-Based Encryption
- Witness encryption and its applications
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
Cited in
(21)- 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
- Attribute based encryption for deterministic finite automata from DLIN
- ABE for DFA from k-lin
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- ABE for DFA from LWE against bounded collusions, revisited
- Turing machines with shortcuts: efficient attribute-based encryption for bounded functions
- Attribute-based encryption for finite automata from LWE
- Functional encryption for cascade automata (extended abstract)
- Bounded Collusion ABE for TMs from IBE
- A generic construction of CCA-secure attribute-based encryption with equality test
- Registered functional encryptions from pairings
- Attribute based encryption for Turing machines from lattices
- Faster ABE for Turing machines from circular evasive LWE
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- A general framework for registered functional encryption via user-specific pre-constraining
- Pseudorandom FE, iO and applications
This page was built for publication: Attribute based encryption for deterministic finite automata from DLIN
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175933)
