Blending FHE-NTRU Keys – The Excalibur Property
From MaRDI portal
Publication:3179473
DOI10.1007/978-3-319-49890-4_1zbMath1411.94061OpenAlexW2557199661MaRDI QIDQ3179473
Louis Goubin, Francisco Vial-Prado
Publication date: 21 December 2016
Published in: Progress in Cryptology – INDOCRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-49890-4_1
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Practical Bootstrapping in Quasilinear Time
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- Faster Bootstrapping with Polynomial Error
- Algorithms in HElib
- Fully Homomorphic Encryption with Polylog Overhead
- Better Bootstrapping in Fully Homomorphic Encryption
- Solving Underdetermined Systems of Multivariate Quadratic Equations Revisited
- Ring Switching in BGV-Style Homomorphic Encryption
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Private Computation on Encrypted Genomic Data
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme
- On Ideal Lattices and Learning with Errors over Rings
- Computing on Encrypted Data
- Unbalanced Oil and Vinegar Signature Schemes
- Packed Ciphertexts in LWE-Based Homomorphic Encryption
- Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
This page was built for publication: Blending FHE-NTRU Keys – The Excalibur Property