Multi-key fully homomorphic encryption with non-interactive setup in the plain model
From MaRDI portal
Cites work
- A polynomial time algorithm for breaking NTRU encryption with multiple keys
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Adding distributed decryption and key generation to a ring-LWE based CCA encryption scheme
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Batched multi-hop multi-key FHE from ring-LWE with compact ciphertext extension
- Carousel: fully homomorphic encryption with bootstrapping over automorphism group
- Circuit-private multi-key FHE
- Classical hardness of learning with errors
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Efficient fully homomorphic encryption from (standard) LWE
- Efficient public key encryption based on ideal lattices (extended abstract)
- Faster Bootstrapping with Polynomial Error
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Faster private decision tree evaluation for batched input from homomorphic encryption
- FHEW: bootstrapping homomorphic encryption in less than a second
- FINALLY: a multi-key FHE scheme based on NTRU and LWE
- Four round secure computation without setup
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- Lossy trapdoor functions and their applications
- Multi-identity and multi-key leveled FHE from learning with errors
- Multi-key FHE from LWE, revisited
- Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
- Multi-key fully-homomorphic encryption in the plain model
- Multi-key homomorphic encryption from TFHE
- NTRU-based bootstrapping for MK-FHEs without using overstretched parameters
- On ideal lattices and learning with errors over rings
- On the concrete hardness of learning with errors
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Packing messages and optimizing bootstrapping in GSW-FHE
- Plaintext-ciphertext matrix multiplication and FHE bootstrapping: fast and fused
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- SoK: learning with errors, circular security, and fully homomorphic encryption
- Towards practical multi-key TFHE: parallelizable, key-compatible, quasi-linear complexity
- Towards round-optimal secure multiparty computations: multikey FHE without a CRS
- Two round multiparty computation via multi-key FHE
- Two-message statistically sender-private OT from LWE
- Worst-case to average-case reductions for module lattices
This page was built for publication: Multi-key fully homomorphic encryption with non-interactive setup in the plain model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443235)