Pages that link to "Item:Q2826066"
From MaRDI portal
The following pages link to (Leveled) fully homomorphic encryption without bootstrapping (Q2826066):
Displaying 50 items.
- Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption (Q2807191) (← links)
- Candidate indistinguishability obfuscation and functional encryption for all circuits (Q2816296) (← links)
- Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations (Q2817469) (← links)
- A novel fully homomorphic encryption scheme bsed on LWE (Q2825264) (← links)
- FHE Circuit Privacy Almost for Free (Q2829211) (← links)
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits (Q2829941) (← links)
- How to Prove Knowledge of Small Secrets (Q2829957) (← links)
- Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts (Q2835588) (← links)
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP (Q2914305) (← links)
- Depth Optimized Efficient Homomorphic Sorting (Q2946441) (← links)
- Private Computation on Encrypted Genomic Data (Q2946463) (← links)
- Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms (Q2946465) (← links)
- On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes (Q2946478) (← links)
- Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes (Q2947538) (← links)
- Augmented Learning with Errors: The Untapped Potential of the Error Term (Q2948191) (← links)
- A Homomorphic Proxy Re-encryption from Lattices (Q2953873) (← links)
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds (Q2958113) (← links)
- On error distributions in ring-based LWE (Q2971006) (← links)
- Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based (Q2980857) (← links)
- Fully Homomorphic Encryption for Point Numbers (Q2980860) (← links)
- Enhancing Data Parallelism of Fully Homomorphic Encryption (Q2988346) (← links)
- Lattice-based FHE as secure as PKE (Q2988863) (← links)
- Cryptogenography (Q2988864) (← links)
- Limits of random oracles in secure computation (Q2988865) (← links)
- Non-commutative arithmetic circuits with division (Q2988867) (← links)
- Decision trees, protocols and the entropy-influence conjecture (Q2988868) (← links)
- Locally testable codes and cayley graphs (Q2988869) (← links)
- Invitation games and the price of stability (Q2988870) (← links)
- Welfare maximization and truthfulness in mechanism design with ordinal preferences (Q2988871) (← links)
- Coordination mechanisms from (almost) all scheduling policies (Q2988872) (← links)
- Private interactive communication across an adversarial channel (Q2988873) (← links)
- Tree codes and a conjecture on exponential sums (Q2988874) (← links)
- Capacity of non-malleable codes (Q2988875) (← links)
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications (Q2988877) (← links)
- Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements (Q2988878) (← links)
- Sequential decision making with vector outcomes (Q2988880) (← links)
- Learning mixtures of arbitrary distributions over large discrete domains (Q2988881) (← links)
- Why do simple algorithms for triangle enumeration work in the real world? (Q2988883) (← links)
- Black-box obfuscation for d-CNFs (Q2988884) (← links)
- Candidate weak pseudorandom functions in AC <sup>0</sup> ○ MOD <sub>2</sub> (Q2988885) (← links)
- Iterated group products and leakage resilience against NC1 (Q2988886) (← links)
- Building one-time memories from isolated qubits (Q2988887) (← links)
- Attribute-efficient evolvability of linear functions (Q2988888) (← links)
- Energy-efficient circuit design (Q2988889) (← links)
- Rate-independent computation in continuous chemical reaction networks (Q2988890) (← links)
- Testers and their applications (Q2988891) (← links)
- On the automorphism groups of strongly regular graphs I (Q2988892) (← links)
- Faster private release of marginals on small databases (Q2988893) (← links)
- Mechanism design in large games (Q2988894) (← links)
- Redrawing the boundaries on purchasing data from privacy-sensitive individuals (Q2988895) (← links)
