Somewhat/fully homomorphic encryption: implementation progresses and challenges
From MaRDI portal
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A comparison of the homomorphic encryption schemes FV and YASHE
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- A homomorphic LWE based E-voting scheme
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Accelerating homomorphic evaluation on reconfigurable hardware
- Additively homomorphic encryption with \(d\)-operand multiplications
- Batch fully homomorphic encryption over the integers
- Ciphers for MPC and FHE
- Converting pairing-based cryptosystems from composite-order groups to prime-order groups
- Cryptanalysis of the FLIP family of stream ciphers
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Fully homomorphic SIMD operations
- Hardware/Software Co-Design of an Accelerator for FV Homomorphic Encryption Scheme Using Karatsuba Algorithm
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic evaluation of lattice-based symmetric encryption schemes
- Homomorphic evaluation of the AES circuit
- How (not) to instantiate ring-LWE
- scientific article; zbMATH DE number 1186931 (Why is no real title available?)
- Improved security for a ring-based fully homomorphic encryption scheme
- Lattice-based FHE as secure as PKE
- Minimizing the number of bootstrappings in fully homomorphic encryption
- ML confidential: machine learning on encrypted data
- Modular hardware architecture for somewhat homomorphic function evaluation
- New Software Speed Records for Cryptographic Pairings
- On the concrete hardness of learning with errors
- Optimized interpolation attacks on lowMC
- Pairing-Friendly Elliptic Curves of Prime Order
- Private computation on encrypted genomic data
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Theory of Cryptography
- Towards stream ciphers for efficient FHE with low-noise ciphertexts
Cited in
(5)- Fully homomorphic encryption in real world applications
- On CCA-Secure Somewhat Homomorphic Encryption
- Practical Parameters for Somewhat Homomorphic Encryption (SHE) Schemes on Binary Circuits
- Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
- On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption
This page was built for publication: Somewhat/fully homomorphic encryption: implementation progresses and challenges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739024)
