Fully homomorphic encryption with polylog overhead
From MaRDI portal
Recommendations
Cited in
(63)- New ideas to build noise-free homomorphic cryptosystems
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- Research based on batch fully homomorphic encryption-symmetric encryption
- Attacks on the Search RLWE Problem with Small Errors
- Homomorphic evaluation of the AES circuit
- Batch fully homomorphic encryption over the integers
- Applications of finite non-abelian simple groups to cryptography in the quantum era
- Ring packing and amortized FHEW bootstrapping
- Efficient computations over encrypted data blocks
- Homomorphic evaluation requires depth
- Private database access with HE-over-ORAM architecture
- Bootstrapping for approximate homomorphic encryption
- Packed ciphertexts in LWE-based homomorphic encryption
- Homomorphically encrypted arithmetic operations over the integer ring
- Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes
- Minimizing the number of bootstrappings in fully homomorphic encryption
- CRT-based fully homomorphic encryption over the integers
- Revisiting homomorphic encryption schemes for finite fields
- Breaking the power-of-two barrier: noise estimation for BGV in NTT-friendly rings
- Bootstrapping fully homomorphic encryption over the integers in less than one second
- Lattice-based SNARGs and their application to more efficient obfuscation
- Homomorphic AES evaluation using the modified LTV scheme
- Efficient circuits for permuting and mapping packed values across leveled homomorphic ciphertexts
- Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
- Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
- Some security bounds for the key sizes of DGHV scheme
- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data
- Cryptanalysis of a homomorphic encryption scheme
- When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- Vive Galois! I: Optimal SIMD packing and packed bootstrapping for FHE
- Fully-homomorphic encryption from lattice isomorphism
- Provably weak instances of Ring-LWE
- Bootstrapping for helib
- On the deductive security of queries to databases with multi-bit records
- Asymptotically quasi-optimal cryptography
- Field instruction multiple data
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
- Homomorphic encryption
- Linear-size Boolean circuits for multiselection
- On key recovery attacks against existing somewhat homomorphic encryption schemes
- Faster amortized FHEW bootstrapping using ring automorphisms
- (Leveled) fully homomorphic encryption without bootstrapping
- On the deductive security of queries to confidential databases in cloud computing systems
- Optimisations and tradeoffs for HElib
- Bootstrapping for BGV and BFV revisited
- TinyLabels: how to compress garbled circuit input labels, efficiently
- Weakly super-invertible matrices and constant communication dishonest majority MPC
- Somewhat/fully homomorphic encryption: implementation progresses and challenges
- FHEW with Efficient Multibit Bootstrapping
- Multikey fully homomorphic encryption and applications
- A systematic study of sparse LWE
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- Fully homomorphic encryption for cyclotomic prime moduli
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- Depth optimized efficient homomorphic sorting
- Blending FHE-NTRU keys -- the excalibur property
- Flattening NTRU for evaluation key free homomorphic encryption
- Fully homomorphic SIMD operations
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography
- Homomorphic encryption: a mathematical survey
This page was built for publication: Fully homomorphic encryption with polylog overhead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894424)
