Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges
From MaRDI portal
Publication:5739024
DOI10.1007/978-3-319-55589-8_5zbMath1365.94407OpenAlexW2594799405MaRDI QIDQ5739024
Adeline Roux-Langlois, Vianney Lapôtre, Guillaume Bonnoron, Vincent Herbert, Caroline Fontaine, Guy Gogniat, Vincent Migliore
Publication date: 1 June 2017
Published in: Codes, Cryptology and Information Security (Search for Journal in Brave)
Full work available at URL: https://zenodo.org/record/580199
Uses Software
Cites Work
- Unnamed Item
- On the concrete hardness of learning with errors
- Accelerating homomorphic evaluation on reconfigurable hardware
- Modular hardware architecture for somewhat homomorphic function evaluation
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- Fully homomorphic SIMD operations
- Optimized Interpolation Attacks on LowMC
- A Homomorphic LWE Based E-voting Scheme
- Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption
- Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes
- Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
- (Leveled) fully homomorphic encryption without bootstrapping
- How (Not) to Instantiate Ring-LWE
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Cryptanalysis of the FLIP Family of Stream Ciphers
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Fully Homomorphic Encryption with Polylog Overhead
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Private Computation on Encrypted Genomic Data
- Ciphers for MPC and FHE
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers
- Lattice-based FHE as secure as PKE
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Fully Homomorphic Encryption over the Integers
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
- Additively Homomorphic Encryption with d-Operand Multiplications
- New Software Speed Records for Cryptographic Pairings
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Hardware/Software Co-Design of an Accelerator for FV Homomorphic Encryption Scheme Using Karatsuba Algorithm
- Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression
- ML Confidential: Machine Learning on Encrypted Data
- Batch Fully Homomorphic Encryption over the Integers
- A Comparison of the Homomorphic Encryption Schemes FV and YASHE
- Fully homomorphic encryption using ideal lattices
- Pairing-Friendly Elliptic Curves of Prime Order
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Theory of Cryptography
This page was built for publication: Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges
