SoK: learning with errors, circular security, and fully homomorphic encryption
From MaRDI portal
Publication:6635900
DOI10.1007/978-3-031-57728-4_10MaRDI QIDQ6635900
Daniele Micciancio, Vinod Vaikuntanathan
Publication date: 12 November 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- (Leveled) fully homomorphic encryption without bootstrapping
- Probabilistic encryption
- On the bit security of cryptographic primitives
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- On the security of homomorphic encryption on approximate numbers
- Candidate obfuscation via oblivious LWE sampling
- Hardness of LWE on general entropic distributions
- Counterexamples to new circular security assumptions underlying iO
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more
- TFHE: fast fully homomorphic encryption over the torus
- Homomorphic encryption for arithmetic of approximate numbers
- New Circular Security Counterexamples from Decision Linear and Learning with Errors
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Faster Bootstrapping with Polynomial Error
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Packing Messages and Optimizing Bootstrapping in GSW-FHE
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Lattice-based FHE as secure as PKE
- Black-Box Circular-Secure Encryption beyond Affine Functions
- Homomorphic Encryption: From Private-Key to Public-Key
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Trapdoors for hard lattices and new cryptographic constructions
- Computational Soundness, Co-induction, and Encryption Cycles
- Bounded Key-Dependent Message Security
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Circular-Secure Encryption from Decision Diffie-Hellman
- A Framework for Efficient and Composable Oblivious Transfer
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Separations in Circular Security for Arbitrary Length Key Cycles
- Obfuscation of Probabilistic Circuits and Applications
- Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Classical hardness of learning with errors
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
- On lattices, learning with errors, random linear codes, and cryptography
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation from circular security
- Securing approximate homomorphic encryption using differential privacy
This page was built for publication: SoK: learning with errors, circular security, and fully homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635900)
