Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
From MaRDI portal
Publication:2829953
DOI10.1007/978-3-662-53015-3_13zbMath1400.94127OpenAlexW2506520897MaRDI 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
Related Items (37)
Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security ⋮ Targeted Homomorphic Attribute-Based Encryption ⋮ Semi-adaptive Security and Bundling Functionalities Made Generic and Easy ⋮ Lattice-based HRA-secure attribute-based proxy re-encryption in standard model ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ Puncturable identity-based and attribute-based encryption from lattices ⋮ Attribute-based proxy re-encryption from standard lattices ⋮ Attribute based encryption for deterministic finite automata from DLIN ⋮ A survey of lattice based expressive attribute based encryption ⋮ Efficient and fully secure lattice-based IBE with equality test ⋮ Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ Candidate witness encryption from lattice techniques ⋮ Multi-input attribute based encryption and predicate encryption ⋮ A survey on functional encryption ⋮ A generic construction of CCA-secure attribute-based encryption with equality test ⋮ Spatial encryption revisited: from delegatable multiple inner product encryption and more ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Adaptively secure inner product encryption from LWE ⋮ Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Flexible attribute-based proxy re-encryption for efficient data sharing ⋮ 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 ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Algebraic Attacks Against Several Weak Variants of GVW’13 ABE ⋮ Revocable attribute-based proxy re-encryption ⋮ Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}} ⋮ New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts ⋮ A new Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Functional encryption for attribute-weighted sums from \(k\)-Lin
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
This page was built for publication: Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
