Pages that link to "Item:Q2826066"
From MaRDI portal
The following pages link to (Leveled) fully homomorphic encryption without bootstrapping (Q2826066):
Displaying 50 items.
- Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems (Q2988896) (← links)
- Complexity of approximating CSP with balance / hard constraints (Q2988897) (← links)
- Integer feasibility of random polytopes (Q2988898) (← links)
- Multireference alignment using semidefinite programming (Q2988900) (← links)
- Partial tests, universal tests and decomposability (Q2988902) (← links)
- High dimensional expanders and property testing (Q2988903) (← links)
- Parameterized testability (Q2988904) (← links)
- Direct sum fails for zero error average communication (Q2988905) (← links)
- Rational arguments (Q2988906) (← links)
- Faster Fully Homomorphic Encryption (Q3058667) (← links)
- Efficient Secure Multiparty Computation with Identifiable Abort (Q3179367) (← links)
- Targeted Homomorphic Attribute-Based Encryption (Q3181032) (← links)
- Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption (Q3194623) (← links)
- Boolean Functions for Homomorphic-Friendly Stream Ciphers (Q3294876) (← links)
- Improved Multiplication Triple Generation over Rings via RLWE-Based AHE (Q3297630) (← links)
- Fully Homomorphic Encryption with Auxiliary Inputs (Q3454587) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Attacks on the Search RLWE Problem with Small Errors (Q4603026) (← links)
- Lattice-Based Identity-Based Homomorphic Conditional Proxy Re-Encryption for Secure Big Data Computing in Cloud Environment (Q4605643) (← links)
- Packed Ciphertexts in LWE-Based Homomorphic Encryption (Q4915997) (← links)
- Improved (Hierarchical) Inner-Product Encryption from Lattices (Q4916012) (← links)
- Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES (Q4916022) (← links)
- Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications (Q4963266) (← links)
- Private Conjunctive Query over Encrypted Data (Q4975185) (← links)
- How to Use Indistinguishability Obfuscation: Deniable Encryption, and More (Q4989921) (← links)
- Ring Packing and Amortized FHEW Bootstrapping (Q5002783) (← links)
- Homomorphic Encryption (Q5021133) (← links)
- Practical FHE parameters against lattice attacks (Q5034914) (← links)
- Constraining and Watermarking PRFs from Milder Assumptions (Q5041166) (← links)
- Homomorphic Encryption Standard (Q5044564) (← links)
- An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers (Q5056042) (← links)
- (Q5091154) (← links)
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages (Q5199210) (← links)
- Integer Version of Ring-LWE and Its Applications (Q5216985) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- Scale-Invariant Fully Homomorphic Encryption over the Integers (Q5402978) (← links)
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime (Q5738759) (← links)
- Private Puncturable PRFs from Standard Lattice Assumptions (Q5738885) (← links)
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE (Q5738886) (← links)
- Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack (Q5738887) (← links)
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL (Q5738971) (← links)
- Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges (Q5739024) (← links)
- On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols (Q5744697) (← links)
- Outsourcing Medical Dataset Analysis: A Possible Solution (Q5854429) (← links)
- Faster Homomorphic Evaluation of Discrete Fourier Transforms (Q5854442) (← links)
- Expanders with respect to Hadamard spaces and random graphs (Q5892453) (← links)
- Limits of local algorithms over sparse random graphs (Q5892454) (← links)
- Deterministic compression with uncertain priors (Q5892455) (← links)
- The truth behind the myth of the folk theorem (Q5892456) (← links)
- Watermarking cryptographic functionalities from standard lattice assumptions (Q5918350) (← links)