Attribute-based keyed fully homomorphic encryption
From MaRDI portal
Recommendations
- Keyed-fully homomorphic encryption without indistinguishability obfuscation
- Targeted homomorphic attribute-based encryption
- CCA-secure keyed-fully homomorphic encryption
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Advances in Cryptology - EUROCRYPT 2004
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Authenticated encryption: relations among notions and analysis of the generic composition paradigm
- CCA-secure keyed-fully homomorphic encryption
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
- Chosen ciphertext secure keyed-homomorphic public-key encryption
- Chosen-Ciphertext Secure Fully Homomorphic Encryption
- Dual-system simulation-soundness with applications to UC-PAKE and more
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient lattice (H)IBE in the standard model
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- 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
- Generic constructions for chosen-ciphertext secure attribute based encryption
- Generic Transformation to Strongly Unforgeable Signatures
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- Keyed-fully homomorphic encryption without indistinguishability obfuscation
- Lattice-based FHE as secure as PKE
- Multi-identity and multi-key leveled FHE from learning with errors
- Multi-key FHE from LWE, revisited
- Multi-key fully-homomorphic encryption in the plain model
- Non-malleability from malleability: simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Quadratic span programs and succinct NIZKs without PCPs
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Succinct arguments in the quantum random oracle model
- Targeted homomorphic attribute-based encryption
- The hunting of the SNARK
- Two round multiparty computation via multi-key FHE
This page was built for publication: Attribute-based keyed fully homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660543)