A homomorphic proxy re-encryption from lattices
From MaRDI portal
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Faster Bootstrapping with Polynomial Error
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 1303118 (Why is no real title available?)
- Improved proxy re-encryption schemes with applications to secure distributed storage
- Key-private proxy re-encryption under LWE
- On lattices, learning with errors, random linear codes, and cryptography
- Packing messages and optimizing bootstrapping in GSW-FHE
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(10)- Proxy re-encryption and re-signatures from lattices
- Key-private proxy re-encryption under LWE
- Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
- Lattice-based identity-based homomorphic conditional proxy re-encryption for secure big data computing in cloud environment
- A novel lattice-based ciphertext-policy attribute-based proxy re-encryption for cloud sharing
- Proxy re-encryption from lattices
- Homomorphic proxy re-authenticators and applications to verifiable multi-user data aggregation
- Multi-use deterministic public key proxy re-encryption from lattices in the auxiliary-input setting
- Multi-key Homomorphic Proxy Re-Encryption
- Multi-key homomorphic encryption with threshold re-encryption
This page was built for publication: A homomorphic proxy re-encryption from lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953873)