Fully homomorphic encryption using ideal lattices
From MaRDI portal
Recommendations
- (Leveled) fully homomorphic encryption without bootstrapping
- (Leveled) fully homomorphic encryption without bootstrapping
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Efficient fully homomorphic encryption from (standard) LWE
Cited in
(only showing first 100 items - show all)- Integer feasibility of random polytopes: random integer programs
- Improved filter permutators for efficient FHE: better instances and implementations
- A new framework for fast homomorphic matrix multiplication
- Dual lattice attacks for closest vector problems (with preprocessing)
- Towards constructing fully homomorphic encryption without ciphertext noise from group theory
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Actively secure garbled circuits with constant communication overhead in the plain model
- New ideas to build noise-free homomorphic cryptosystems
- Full domain functional bootstrapping using the prime cyclotomic ring
- Finding shortest lattice vectors faster using quantum search
- EvalRound algorithm in CKKS bootstrapping
- Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
- Preimage sampling in the higher-bit approximate setting with a non-spherical Gaussian sampler
- A new random sampling method and its application in improving progressive BKZ algorithm
- Bootstrapping with RMFE for fully homomorphic encryption
- Monotone-policy BARGs and more from BARGs and quadratic residuosity
- On CCA-Secure Somewhat Homomorphic Encryption
- Bounded simultaneous messages
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- Succinct non-interactive secure computation
- Semi-generic construction of public key encryption and identity-based encryption with equality test
- On the black-box complexity of private-key inner-product functional encryption
- Worst-case to average-case hardness of LWE: an alternative perspective
- Privacy and verifiability in voting systems: methods, developments and trends
- Relaxed functional bootstrapping: a new perspective on BGV/BFV bootstrapping
- Unsupervised Machine Learning on encrypted data
- Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems
- Adaptive security, erasures, and network assumptions in communication-local MPC
- A note on low-communication secure multiparty computation via circuit depth-reduction
- More efficient functional bootstrapping for general functions in polynomial modulus
- Homomorphic sign evaluation with a RNS representation of integers
- Revisiting key decomposition techniques for FHE: simpler, faster and more generic
- Faster BGV bootstrapping for power-of-two cyclotomics through homomorphic NTT
- Tree codes and a conjecture on exponential sums
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- Somewhat homomorphic encryption based on random codes
- Complexity of approximating CSP with balance / hard constraints
- Multi-key Homomorphic Proxy Re-Encryption
- Multi-server blind quantum computation protocol with limited classical communication among servers
- KDM security for identity-based encryption: constructions and separations
- EPiC: efficient privacy-preserving counting for MapReduce
- Homomorphically encrypted k-means on cloud-hosted servers with low client-side load
- Limits of local algorithms over sparse random graphs
- Faster fully homomorphic encryption
- Fully homomorphic encryption over the integers
- Additively homomorphic encryption with \(d\)-operand multiplications
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
- Fully homomorphic encryption with polylog overhead
- TFHE: fast fully homomorphic encryption over the torus
- Description of (fully) homomorphic cryptographic primitives within the \(p\)-adic model of encryption
- Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation
- An efficient somewhat homomorphic encryption scheme based on factorization
- Processing secure, verifiable and efficient SQL over outsourced database
- mrNISC from LWE with polynomial modulus
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- How to compress encrypted data
- Optimal single-server private information retrieval
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Two Party Distribution Testing: Communication and Security
- Homomorphic encryption and some black box attacks
- On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
- HELIOPOLIS: verifiable computation over homomorphically encrypted data from interactive oracle proofs is practical
- Post-quantum multi-party computation
- Post-quantum insecurity from LWE
- Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing
- Batch fully homomorphic encryption over the integers
- Group homomorphic encryption: characterizations, impossibility results, and applications
- Candidate iO from homomorphic encryption schemes
- Provably secure NTRU instances over prime cyclotomic rings
- Sanitization of FHE ciphertexts
- Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes
- IND-CPA\textsuperscript{C}: a new security notion for conditional decryption in fully homomorphic encryption
- FHE circuit privacy almost for free
- Trapdoors for ideal lattices with applications
- Preventing adaptive key recovery attacks on the GSW levelled homomorphic encryption scheme
- Fast Fourier Orthogonalization over NTRU Lattices
- Applications of finite non-abelian simple groups to cryptography in the quantum era
- Permuted puzzles and cryptographic hardness
- Making private function evaluation safer, faster, and simpler
- A framework for cryptographic problems from linear algebra
- A novel vertical fragmentation method for privacy protection based on entropy minimization in a relational database
- How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
- Cryptogenography
- Privacy preserving computation in cloud using noise-free fully homomorphic encryption (FHE) schemes
- Cryptanalysis of the FLIP family of stream ciphers
- Fast practical lattice reduction through iterated compression
- Encrypted data processing with homomorphic re-encryption
- Ring packing and amortized FHEW bootstrapping
- Mechanism design in large games: incentives and privacy (extended abstract)
- Oblivious transfer from weakly random self-reducible public-key cryptosystem
- Efficient computations over encrypted data blocks
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Delegatable homomorphic encryption with applications to secure outsourcing of computation
- Lattice-based key exchange on small integer solution problem
- Some basics on privacy techniques, anonymization and their big data challenges
- How to run Turing machines on encrypted data
- Perennial secure multi-party computation of universal Turing machine
- Lattice-based cryptography: a survey
- Boolean searchable symmetric encryption with worst-case sub-linear complexity
- An improved affine equivalence algorithm for random permutations
This page was built for publication: Fully homomorphic encryption using ideal lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5172710)
