Turing Machines with Shortcuts: Efficient Attribute-Based Encryption for Bounded Functions

DOI10.1007/978-3-319-39555-5_15zbMath1346.68086OpenAlexW2495547639MaRDI QIDQ2822675

Qinyi Li, Xavier Boyen

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient selective identity-based encryption without random oracles
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• How to Run Turing Machines on Encrypted Data
• Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Functional Encryption for Regular Languages
• Unbounded HIBE and Attribute-Based Encryption
• Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
• Predicate Encryption for Circuits from LWE
• Attribute-Based Encryption for Finite Automata from LWE
• Trapdoors for hard lattices and new cryptographic constructions
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• Attribute-Based Functional Encryption on Lattices
• Attribute-Based Encryption with Fast Decryption
• Public-key cryptosystems from the worst-case shortest vector problem
• 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
• Attribute-based encryption for circuits
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Turing Machines with Shortcuts: Efficient Attribute-Based Encryption for Bounded Functions