Revisiting homomorphic encryption schemes for finite fields
From MaRDI portal
Publication:6157565
DOI10.1007/978-3-030-92078-4_21zbMath1514.94108OpenAlexW3159746013MaRDI QIDQ6157565
Andrey Kim, Yuriy Polyakov, Vincent Zucca
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92078-4_21
Related Items (5)
Optimisations and tradeoffs for HElib ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping ⋮ Finding and evaluating parameters for BGV ⋮ Bootstrapping for BGV and BFV revisited
Cites Work
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- Better bootstrapping for approximate homomorphic encryption
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- Approximate homomorphic encryption with reduced approximation error
- An improved RNS variant of the BFV homomorphic encryption scheme
- Homomorphic encryption for arithmetic of approximate numbers
- Fully homomorphic SIMD operations
- Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?
- Fully Homomorphic Encryption with Polylog Overhead
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme
- A Comparison of the Homomorphic Encryption Schemes FV and YASHE
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
This page was built for publication: Revisiting homomorphic encryption schemes for finite fields
