Targeted homomorphic attribute-based encryption
From MaRDI portal
Recommendations
- Dynamic multi target homomorphic attribute-based encryption
- Homomorphic-policy attribute-based key encapsulation mechanisms
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fast, compact, and expressive attribute-based encryption
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A hierarchy of polynomial time lattice basis reduction algorithms
- Advances in cryptology -- CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16--20, 2015. Proceedings. Part II
- Advances in cryptology -- EUROCRYPT 2016. 35th annual international conference on the theory and applications of cryptographic techniques, Vienna, Austria, May 8--12, 2016. Proceedings. Part I
- Attribute-based encryption for circuits
- Attribute-Based Fully Homomorphic Encryption with a Bounded Number of Inputs
- Bonsai trees, or how to delegate a lattice basis
- Bootstrappable identity-based fully homomorphic encryption
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Classical hardness of learning with errors
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient lattice (H)IBE in the standard model
- Faster Bootstrapping with Polynomial Error
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fuzzy Identity-Based Encryption
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Lattice-based FHE as secure as PKE
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- Leveled fully homomorphic signatures from standard lattices
- Multi-identity and multi-key leveled FHE from learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Public-key cryptosystems from the worst-case shortest vector problem
- Semi-adaptive security and bundling functionalities made generic and easy
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Two round multiparty computation via multi-key FHE
Cited in
(24)- Attribute-based fully homomorphic encryption with a bounded number of inputs
- Dynamic multi target homomorphic attribute-based encryption
- Keyed-fully homomorphic encryption without indistinguishability obfuscation
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security
- Attribute-based proxy re-encryption from standard lattices
- A survey of lattice based expressive attribute based encryption
- Attribute-Based Fully Homomorphic Encryption with a Bounded Number of Inputs
- Targeted malleability: homomorphic encryption for restricted computations
- Compact (targeted homomorphic) inner product encryption from LWE
- Homomorphic encryption with access policies: characterization and new constructions
- Homomorphic-policy attribute-based key encapsulation mechanisms
- Algebraic attacks against several weak variants of GVW'13 ABE
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Chosen-Ciphertext Secure Fully Homomorphic Encryption
- Private puncturable PRFs from standard lattice assumptions
- Watermarking cryptographic functionalities from standard lattice assumptions
- Multi-authority ABE from lattices without random oracles
- How to sample a discrete Gaussian (and more) from a random oracle
- Attribute-based fully homomorphic encryption scheme from lattices with short ciphertext
- Chosen-Ciphertext Secure Multi-identity and Multi-attribute Pure FHE
- Attribute-based keyed fully homomorphic encryption
- Unbounded ABE for circuits from LWE, revisited
- Bootstrappable fully homomorphic attribute-based encryption with unbounded circuit depth
- ABE for circuits with \(\mathsf{poly}(\lambda)\)-sized keys from LWE
This page was built for publication: Targeted homomorphic attribute-based encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3181032)