Turing machines with shortcuts: efficient attribute-based encryption for bounded functions

DOI10.1007/978-3-319-39555-5_15MaRDI QIDQ2822675zbMATH OpenOpenAlexFDO

Authors Xavier Boyen, Qinyi Li

Publication date 4 October 2016

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-39555-5_15

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Formal languages and automata (68Q45)

Recommendations

• Attribute-based encryption for finite automata from LWE
• Attribute based encryption for deterministic finite automata from DLIN
• Attribute-based encryption (and more) for nondeterministic finite automata from LWE
• Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
• Bounded Collusion ABE for TMs from IBE

Cites work

• Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
• Attribute-based encryption for circuits
• Attribute-based encryption for finite automata from LWE
• Attribute-based encryption with fast decryption
• Attribute-based functional encryption on lattices
• Bonsai trees, or how to delegate a lattice basis
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
• Classical hardness of learning with errors
• Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more
• Efficient lattice (H)IBE in the standard model
• Efficient selective identity-based encryption without random oracles
• Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
• Functional encryption for regular languages
• Fuzzy Identity-Based Encryption
• How to run Turing machines on encrypted data
• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 67483 (Why is no real title available?)
• On lattices, learning with errors, random linear codes, and cryptography
• Predicate encryption for circuits from LWE
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Public-key cryptosystems from the worst-case shortest vector problem
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Unbounded HIBE and Attribute-Based Encryption

Cited in

(4)

• Attribute-based encryption for finite automata from LWE
• Bounded Collusion ABE for TMs from IBE
• Attribute based encryption for Turing machines from lattices
• FE for inner products and its application to multi-authority ABE

This page was built for publication: Turing machines with shortcuts: efficient attribute-based encryption for bounded functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822675)