Functional encryption for regular languages
From MaRDI portal
Recommendations
- Functional encryption for cascade automata
- Functional encryption for cascade automata (extended abstract)
- Reusable garbled deterministic finite automata from learning with errors
- Towards Symmetric Functional Encryption for Regular Languages with Predicate Privacy
- Functional encryption: definitions and challenges
Cited in
(58)- Functional encryption for computational hiding in prime order groups via pair encodings
- Predicate signatures from pair encodings via dual system proof technique
- Functional encryption for cascade automata
- 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
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Generic negation of pair encodings
- Efficient fully CCA-secure predicate encryptions from pair encodings
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- Generic constructions for fully secure revocable attribute-based encryption
- Attribute based encryption for deterministic finite automata from DLIN
- A multi-authority approach to various predicate encryption types
- Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation
- On the power of rewinding simulators in functional encryption
- Extended dual system group and shorter unbounded hierarchical identity based encryption
- Blind key-generation attribute-based encryption for general predicates
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH
- ABE for DFA from LWE against bounded collusions, revisited
- Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings
- Functional Encryption for Turing Machines
- Leakage-resilient functional encryption via pair encodings
- Turing machines with shortcuts: efficient attribute-based encryption for bounded functions
- Fully secure functional encryption for inner products, from standard assumptions
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Dual system encryption framework in prime-order groups via computational pair encodings
- Ciphertext-policy attribute based encryption supporting access policy update
- Achieving IND-CCA Security for Functional Encryption for Inner Products
- Generalized closest substring encryption
- Semi-adaptive security and bundling functionalities made generic and easy
- Fully collusion-resistant traceable key-policy attribute-based encryption with sub-linear size ciphertexts
- On the semantic security of functional encryption schemes
- A New Functional Encryption for Multidimensional Range Query (Short Paper)
- Reusable garbled deterministic finite automata from learning with errors
- Algebraic attacks against several weak variants of GVW'13 ABE
- Functional encryption for cascade automata (extended abstract)
- Towards Symmetric Functional Encryption for Regular Languages with Predicate Privacy
- Dual system framework in multilinear settings and applications to fully secure (compact) ABE for unbounded-size circuits
- Simplifying design and analysis of complex predicate encryption schemes
- Bounded Collusion ABE for TMs from IBE
- Multi-key and multi-input predicate encryption from learning with errors
- Multi-input attribute based encryption and predicate encryption
- Attribute-based multi-input FE (and more) for attribute-weighted sums
- Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
- A general framework for lattice-based ABE using evasive inner-product functional encryption
- A modular approach to registered ABE for unbounded predicates
- Attribute based encryption for Turing machines from lattices
- Verifiability-based conversion from CPA to CCA-secure predicate encryption
- FE for inner products and its application to multi-authority ABE
- Attribute-based encryption using sum-product decomposition of Boolean functions
- Faster ABE for Turing machines from circular evasive LWE
- Non-committing identity based encryption: constructions and applications
- Registered FE beyond predicates: (attribute-based) linear functions and more
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- A general framework for registered functional encryption via user-specific pre-constraining
- Fully adaptive decentralized MA-ABE: simplified, optimized, ASP supported
- Pseudorandom FE, iO and applications
This page was built for publication: Functional encryption for regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914262)
