Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
From MaRDI portal
Publication:2829953
DOI10.1007/978-3-662-53015-3_13zbMath1400.94127MaRDI QIDQ2829953
Vinod Vaikuntanathan, Zvika Brakerski
Publication date: 9 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/111070
94A60: Cryptography
Related Items
Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits, Private Puncturable PRFs from Standard Lattice Assumptions, Unbounded inner product functional encryption from bilinear maps, Faster Gaussian sampling for trapdoor lattices with arbitrary modulus, Unbounded ABE via bilinear entropy expansion, revisited, A new Gaussian sampling for trapdoor lattices with arbitrary modulus, Towards Tightly Secure Lattice Short Signature and Id-Based Encryption, Targeted Homomorphic Attribute-Based Encryption, Semi-adaptive Security and Bundling Functionalities Made Generic and Easy
Cites Work
- Unnamed Item
- Unnamed Item
- A hierarchy of polynomial time lattice basis reduction algorithms
- Bonsai trees, or how to delegate a lattice basis
- Advances in cryptology -- CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16--20, 2015. Proceedings. Part II
- Functional Encryption for Turing Machines
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Attribute-Based Encryption for Circuits from Multilinear Maps
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- 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
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Unbounded HIBE and Attribute-Based Encryption
- Predicate Encryption for Circuits from LWE
- From Selective to Adaptive Security in Functional Encryption
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Trapdoors for hard lattices and new cryptographic constructions
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Efficient Lattice (H)IBE in the Standard Model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Identity-Based Encryption Gone Wild
- Attribute-Based Functional Encryption on Lattices
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Attribute-Based Encryption with Fast Decryption
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Fuzzy Identity-Based Encryption
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Attribute-based encryption for circuits
- On lattices, learning with errors, random linear codes, and cryptography
