Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
From MaRDI portal
Publication:2829953
DOI10.1007/978-3-662-53015-3_13zbMATH Open1400.94127OpenAlexW2506520897MaRDI QIDQ2829953FDOQ2829953
Authors: Zvika Brakerski, Vinod Vaikuntanathan 
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
Recommendations
- ABE for circuits with constant-size secret keys and adaptive security
- CP-ABE for circuits (and More) in the symmetric key setting
- Fully secure attribute-based encryption for \(t\)-CNF from LWE
- Attribute-based encryption for circuits from multilinear maps
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- General circuit realizing compact revocable attribute-based encryption from multilinear maps
- Attribute-based encryption for circuits
- Attribute-based encryption for circuits
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
Cites Work
- A hierarchy of polynomial time lattice basis reduction algorithms
- Public-key cryptosystems from the worst-case shortest vector problem
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient lattice (H)IBE in the standard model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Title not available (Why is that?)
- Fuzzy Identity-Based Encryption
- Title not available (Why is that?)
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Attribute-based encryption for circuits from multilinear maps
- Functional encryption for regular languages
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Fully secure functional encryption with general relations from the decisional linear assumption
- Attribute-based encryption for circuits
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- New proof methods for attribute-based encryption: achieving full security through selective techniques
- Identity-Based Encryption Gone Wild
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Functional Encryption for Turing Machines
- Unbounded HIBE and Attribute-Based Encryption
- Fully secure unbounded inner-product and attribute-based encryption
- Attribute-based encryption with fast decryption
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Bonsai trees, or how to delegate a lattice basis
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- From Selective to Adaptive Security in Functional Encryption
- Semi-adaptive Attribute-Based Encryption and Improved Delegation for Boolean Formula
- Predicate Encryption for Circuits from LWE
- Attribute-based functional encryption on lattices
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Advances in cryptology -- CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16--20, 2015. Proceedings. Part II
Cited In (42)
- Private Puncturable PRFs from Standard Lattice Assumptions
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- 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
- Targeted Homomorphic Attribute-Based Encryption
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security
- Watermarking cryptographic functionalities from standard lattice assumptions
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- A generic construction of CCA-secure attribute-based encryption with equality test
- A survey on functional encryption
- Unbounded inner product functional encryption from bilinear maps
- Unbounded inner product functional encryption from bilinear maps
- Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits
- Puncturable Identity-Based Encryption from Lattices
- Unbounded predicate inner product functional encryption from pairings
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Unbounded ABE via bilinear entropy expansion, revisited
- Lattice-based HRA-secure attribute-based proxy re-encryption in standard model
- Candidate witness encryption from lattice techniques
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Attribute based encryption for deterministic finite automata from DLIN
- Attribute-based proxy re-encryption from standard lattices
- Revocable attribute-based proxy re-encryption
- Puncturable identity-based and attribute-based encryption from lattices
- A survey of lattice based expressive attribute based encryption
- Flexible attribute-based proxy re-encryption for efficient data sharing
- 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
- Hardness of (M)LWE with semi-uniform seeds
- Multi-input attribute based encryption and predicate encryption
- Adaptively secure inner product encryption from LWE
- Algebraic Attacks Against Several Weak Variants of GVW’13 ABE
- Efficient and fully secure lattice-based IBE with equality test
- Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
- ABE for DFA from LWE against bounded collusions, revisited
- Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH
- Semi-adaptive Security and Bundling Functionalities Made Generic and Easy
- Spatial encryption revisited: from delegatable multiple inner product encryption and more
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
- Ciphertext policy attribute-based encryption for circuits from LWE assumption
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography
- Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities
This page was built for publication: Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829953)
