Multi-key homomorphic encryption with threshold re-encryption
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1303118 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A CCA-secure collusion-resistant identity-based proxy re-encryption scheme
- A homomorphic proxy re-encryption from lattices
- Batched multi-hop multi-key FHE from ring-LWE with compact ciphertext extension
- Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic proxy re-authenticators and applications to verifiable multi-user data aggregation
- Information-theoretically secure protocols and security under composition
- Multi-key FHE from LWE, revisited
- Multi-key Homomorphic Proxy Re-Encryption
- Multi-key homomorphic encryption from TFHE
- Multiparty computation with low communication, computation and interaction via threshold FHE
- On ideal lattices and learning with errors over rings
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- TFHE: fast fully homomorphic encryption over the torus
This page was built for publication: Multi-key homomorphic encryption with threshold re-encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970686)