Targeted Homomorphic Attribute-Based Encryption

DOI10.1007/978-3-662-53644-5_13zbMath1394.94928OpenAlexW2537419609MaRDI QIDQ3181032

Zvika Brakerski, Rotem Tsabary, David Cash, 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)

Related Items

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 ⋮ Multi-authority ABE from lattices without random oracles ⋮ How to sample a discrete Gaussian (and more) from a random oracle ⋮ Compact (Targeted Homomorphic) Inner Product Encryption from LWE ⋮ Chosen-Ciphertext Secure Fully Homomorphic Encryption ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Algebraic Attacks Against Several Weak Variants of GVW’13 ABE ⋮ Keyed-fully homomorphic encryption without indistinguishability obfuscation

Cites Work

• Unnamed Item
• 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
• 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
• Attribute-Based Fully Homomorphic Encryption with a Bounded Number of Inputs
• (Leveled) fully homomorphic encryption without bootstrapping
• Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
• Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Faster Bootstrapping with Polynomial Error
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
• Leveled Fully Homomorphic Signatures from Standard Lattices
• Lattice-based FHE as secure as PKE
• Semi-adaptive Security and Bundling Functionalities Made Generic and Easy
• Multi-identity and Multi-key Leveled FHE from Learning with Errors
• 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
• Fully homomorphic encryption using ideal lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
• Fuzzy Identity-Based Encryption
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Attribute-based encryption for circuits
• Classical hardness of learning with errors
• Bootstrappable Identity-Based Fully Homomorphic Encryption
• Two Round Multiparty Computation via Multi-key FHE
• On lattices, learning with errors, random linear codes, and cryptography