HRA-secure homomorphic lattice-based proxy re-encryption with tight security
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Adaptively secure proxy re-encryption
- An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
- An improved RNS variant of the BFV homomorphic encryption scheme
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fine-grained proxy re-encryption: definitions and constructions from LWE
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption with polylog overhead
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Gaussian sampling over the integers: efficient, generic, constant-time
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic Encryption Standard
- Homomorphic evaluation of the AES circuit
- scientific article; zbMATH DE number 1303118 (Why is no real title available?)
- Improved proxy re-encryption schemes with applications to secure distributed storage
- Lattice-based HRA-secure attribute-based proxy re-encryption in standard model
- Low communication threshold fully homomorphic encryption
- LP solutions of vectorial integer subset sums -- cryptanalysis of Galbraith's binary matrix LWE
- Multi-hop fine-grained proxy re-encryption
- Multiparty computation with low communication, computation and interaction via threshold FHE
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the bit security of cryptographic primitives
- On the security of homomorphic encryption on approximate numbers
- Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices
- Revisiting homomorphic encryption schemes for finite fields
- Sanitization of FHE ciphertexts
- Securing approximate homomorphic encryption using differential privacy
- Strong post-compromise secure proxy re-encryption
- Threshold cryptosystems from threshold fully homomorphic encryption
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Two-round threshold lattice-based signatures from threshold homomorphic encryption
- Universal proxy re-encryption
- What about Bob? The inadequacy of CPA security for proxy reencryption
This page was built for publication: HRA-secure homomorphic lattice-based proxy re-encryption with tight security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326610)
