Targeted homomorphic attribute-based encryption

DOI10.1007/978-3-662-53644-5_13MaRDI QIDQ3181032zbMATH OpenOpenAlexFDO

Authors Zvika Brakerski, David Cash, Rotem Tsabary, Hoeteck Wee

Publication date 22 December 2016

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-53644-5_13

Mathematics Subject Classification ID

Cryptography (94A60)

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

• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• (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 Fully Homomorphic Encryption with a Bounded Number of Inputs
• Attribute-based encryption for circuits
• 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 without Modulus Switching from Classical GapSVP
• Fully homomorphic encryption using ideal lattices
• 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
• 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

(23)

• Compact (targeted homomorphic) inner product encryption from LWE
• Homomorphic encryption with access policies: characterization and new constructions
• Homomorphic-policy attribute-based key encapsulation mechanisms
• Unbounded ABE for circuits from LWE, revisited
• Algebraic attacks against several weak variants of GVW'13 ABE
• Dynamic multi target homomorphic attribute-based encryption
• Attribute-based fully homomorphic encryption with a bounded number of inputs
• Chosen-Ciphertext Secure Fully Homomorphic Encryption
• Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security
• Watermarking cryptographic functionalities from standard lattice assumptions
• Private puncturable PRFs from standard lattice assumptions
• How to sample a discrete Gaussian (and more) from a random oracle
• Multi-authority ABE from lattices without random oracles
• Bootstrappable fully homomorphic attribute-based encryption with unbounded circuit depth
• Attribute-Based Fully Homomorphic Encryption with a Bounded Number of Inputs
• Attribute-based proxy re-encryption from standard lattices
• Attribute-based fully homomorphic encryption scheme from lattices with short ciphertext
• A survey of lattice based expressive attribute based encryption
• Chosen-Ciphertext Secure Multi-identity and Multi-attribute Pure FHE
• Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
• Targeted malleability: homomorphic encryption for restricted computations
• Attribute-based keyed fully homomorphic encryption
• Keyed-fully homomorphic encryption without indistinguishability obfuscation

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)