Pages that link to "Item:Q2412881"
From MaRDI portal
The following pages link to Homomorphic encryption for arithmetic of approximate numbers (Q2412881):
Displaying 50 items.
- Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM (Q832329) (← links)
- Homomorphic lower digits removal and improved FHE bootstrapping (Q1648799) (← links)
- Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
- A full RNS variant of approximate homomorphic encryption (Q1726685) (← links)
- Approximate homomorphic encryption over the conjugate-invariant ring (Q1736036) (← links)
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes (Q2023314) (← links)
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys (Q2056705) (← links)
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function (Q2056708) (← links)
- On the security of homomorphic encryption on approximate numbers (Q2056709) (← links)
- Flexible and efficient verifiable computation on encrypted data (Q2061972) (← links)
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting (Q2079218) (← links)
- Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation (Q2096626) (← links)
- PSI-stats: private set intersection protocols supporting secure statistical functions (Q2096631) (← links)
- Efficient homomorphic conversion between (ring) LWE ciphertexts (Q2117044) (← links)
- Faster homomorphic encryption over GPGPUs via hierarchical DGT (Q2147259) (← links)
- When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead (Q2149801) (← links)
- Approximate homomorphic encryption with reduced approximation error (Q2152155) (← links)
- Private computation of polynomials over networks (Q2169792) (← links)
- Sine series approximation of the mod function for bootstrapping of approximate HE (Q2170011) (← links)
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) (Q2170012) (← links)
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization (Q2170015) (← links)
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption (Q2170018) (← links)
- Field instruction multiple data (Q2170023) (← links)
- Efficiently processing complex-valued data in homomorphic encryption (Q2191203) (← links)
- TFHE: fast fully homomorphic encryption over the torus (Q2303454) (← links)
- Bootstrapping for helib (Q2661696) (← links)
- Maliciously secure matrix multiplication with applications to private deep learning (Q2691579) (← links)
- Efficient homomorphic comparison methods with optimal complexity (Q2692383) (← links)
- SLAP: simpler, improved private stream aggregation from ring learning with errors (Q2693220) (← links)
- An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption (Q2697678) (← links)
- Arithmetic operations on encrypted data (Q4876338) (← links)
- Practical FHE parameters against lattice attacks (Q5034914) (← links)
- Privacy-preserving multikey computing framework for encrypted data in the cloud (Q6065993) (← links)
- BLEACH: cleaning errors in discrete computations over CKKS (Q6070452) (← links)
- Optimisations and tradeoffs for HElib (Q6080894) (← links)
- Parameter optimization and larger precision for (T)FHE (Q6109082) (← links)
- Achievable \textsf{CCA2} relaxation for homomorphic encryption (Q6114265) (← links)
- Homomorphic encryption: a mathematical survey (Q6118172) (← links)
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping (Q6132408) (← links)
- EvalRound algorithm in CKKS bootstrapping (Q6132409) (← links)
- Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping (Q6132971) (← links)
- Securing approximate homomorphic encryption using differential privacy (Q6155269) (← links)
- Balanced non-adjacent forms (Q6157562) (← links)
- Revisiting homomorphic encryption schemes for finite fields (Q6157565) (← links)
- Transciphering framework for approximate homomorphic encryption (Q6157566) (← links)
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE (Q6157567) (← links)
- More efficient verifiable functional encryption (Q6173113) (← links)
- Batched fully dynamic multi-key FHE from FHEW-like cryptosystems (Q6173118) (← links)
- Efficient circuits for permuting and mapping packed values across leveled homomorphic ciphertexts (Q6173299) (← links)
- Toward practical privacy-preserving linear regression (Q6199734) (← links)