Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
From MaRDI portal
Recommendations
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Implementing Gentry's fully-homomorphic encryption scheme
- Keyed-fully homomorphic encryption without indistinguishability obfuscation
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
- Verifiable Decryption for Fully Homomorphic Encryption
- On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption from approximate ideal lattices
- (Leveled) fully homomorphic encryption without bootstrapping
- (Leveled) fully homomorphic encryption without bootstrapping
Cited in
(only showing first 100 items - show all)- Homomorphic lower digits removal and improved FHE bootstrapping
- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data
- Bootstrapping for approximate homomorphic encryption
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- Security considerations for Galois non-dual RLWE families
- An efficient quantum somewhat homomorphic symmetric searchable encryption
- A full RNS variant of approximate homomorphic encryption
- Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes
- CRT-based fully homomorphic encryption over the integers
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
- How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- Optimal broadcast encryption from pairings and LWE
- On the security of homomorphic encryption on approximate numbers
- Bootstrapping fully homomorphic encryption over the integers in less than one second
- Keyed-fully homomorphic encryption without indistinguishability obfuscation
- An optimized GHV-type HE scheme: simpler, faster, and more versatile
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Deniable fully homomorphic encryption from learning with errors
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
- Attribute-based conditional proxy re-encryption in the standard model under LWE
- Approximate homomorphic encryption with reduced approximation error
- Field instruction multiple data
- Flattening NTRU for evaluation key free homomorphic encryption
- Homomorphically encrypted k-means on cloud-hosted servers with low client-side load
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Maliciously secure matrix multiplication with applications to private deep learning
- Efficient homomorphic comparison methods with optimal complexity
- An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
- Maliciously circuit-private multi-key FHE and MPC based on LWE
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- A novel fully homomorphic encryption scheme bsed on LWE
- Depth optimized efficient homomorphic sorting
- Private computation on encrypted genomic data
- Efficient integer encoding for homomorphic encryption via ring isomorphisms
- On key recovery attacks against existing somewhat homomorphic encryption schemes
- Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- A homomorphic proxy re-encryption from lattices
- Multi-bit leveled homomorphic encryption via dual LWE-based
- Fully homomorphic encryption for point numbers
- Enhancing data parallelism of fully homomorphic encryption
- Lattice-based FHE as secure as PKE
- Cryptogenography
- Limits of random oracles in secure computation (extended abstract)
- Non-commutative arithmetic circuits with division
- Decision trees, protocols and the entropy-influence conjecture
- Locally testable codes and Cayley graphs
- Invitation games and the price of stability
- Welfare maximization and truthfulness in mechanism design with ordinal preferences
- Coordination mechanisms from (almost) all scheduling policies
- Private interactive communication across an adversarial channel
- Tree codes and a conjecture on exponential sums
- Capacity of non-malleable codes
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Adversarial hypothesis testing and a quantum Stein's lemma for restricted measurements (extended abstract)
- Sequential decision making with vector outcomes
- Learning mixtures of arbitrary distributions over large discrete domains
- Why do simple algorithms for triangle enumeration work in the real world?
- Black-box obfuscation for \(d\)-CNFs
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
- Iterated group products and leakage resilience against \(\mathrm{NC}^1\)
- Building one-time memories from isolated qubits (extended abstract)
- Attribute-efficient evolvability of linear functions
- Energy-efficient circuit design
- Rate-independent computation in continuous chemical reaction networks
- Testers and their applications
- On the automorphism groups of strongly regular graphs. I
- Faster private release of marginals on small databases
- Mechanism design in large games: incentives and privacy (extended abstract)
- Redrawing the boundaries on purchasing data from privacy-sensitive individuals
- Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems
- Complexity of approximating CSP with balance / hard constraints
- Integer feasibility of random polytopes: random integer programs
- Multireference alignment using semidefinite programming
- Partial tests, universal tests and decomposability
- High dimensional expanders and property testing
- Parameterized testability
- Direct sum fails for zero error average communication
- Rational arguments: single round delegation with sublinear verification
- Homomorphic AES evaluation using the modified LTV scheme
- Blending FHE-NTRU keys -- the excalibur property
- Targeted homomorphic attribute-based encryption
- Classical homomorphic encryption for quantum circuits
- Fully homomorphic encryption with auxiliary inputs
- Coded-BKW: solving LWE using lattice codes
- Multikey fully homomorphic encryption and applications
- Lattice-based identity-based homomorphic conditional proxy re-encryption for secure big data computing in cloud environment
- Packed ciphertexts in LWE-based homomorphic encryption
- Improved (hierarchical) inner-product encryption from lattices
- How to use indistinguishability obfuscation: deniable encryption, and more
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- Ring packing and amortized FHEW bootstrapping
- Homomorphic encryption
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Homomorphic Encryption Standard
- Lattice-based SNARGs and their application to more efficient obfuscation
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Somewhat/fully homomorphic encryption: implementation progresses and challenges
This page was built for publication: Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914305)
