Targeted Homomorphic Attribute-Based Encryption (Q3181032)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Targeted Homomorphic Attribute-Based Encryption	scientific article

Statements

scholarly article

0 references

Targeted Homomorphic Attribute-Based Encryption (English)

0 references

Zvika Brakerski

0 references

0 references

0 references

0 references

Theory of Cryptography

0 references

publication date

22 December 2016

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-662-53644-5_13

0 references

Efficient Lattice (H)IBE in the Standard Model

0 references

Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE

0 references

0 references

Faster Bootstrapping with Polynomial Error

0 references

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

0 references

Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

0 references

(Leveled) fully homomorphic encryption without bootstrapping

0 references

Classical hardness of learning with errors

0 references

Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts

0 references

Efficient Fully Homomorphic Encryption from (Standard) LWE

0 references

Lattice-based FHE as secure as PKE

0 references

Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security

0 references

Bonsai trees, or how to delegate a lattice basis

0 references

Bootstrappable Identity-Based Fully Homomorphic Encryption

0 references

Multi-identity and Multi-key Leveled FHE from Learning with Errors

0 references

Attribute-Based Fully Homomorphic Encryption with a Bounded Number of Inputs

0 references

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

0 references

Advances in cryptology -- CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16--20, 2015. Proceedings. Part II

0 references

Fully homomorphic encryption using ideal lattices

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

0 references

Attribute-based encryption for circuits

0 references

Leveled Fully Homomorphic Signatures from Standard Lattices

0 references

Semi-adaptive Security and Bundling Functionalities Made Generic and Easy

0 references

On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

0 references

Simple Lattice Trapdoor Sampling from a Broad Class of Distributions

0 references

Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Two Round Multiparty Computation via Multi-key FHE

0 references

Public-key cryptosystems from the worst-case shortest vector problem

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

Fuzzy Identity-Based Encryption

0 references

A hierarchy of polynomial time lattice basis reduction algorithms

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-53644-5_13

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3181032

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3181032&oldid=36297162"