Revisiting homomorphic encryption schemes for finite fields
From MaRDI portal
Publication:6157565
Recommendations
- Partially homomorphic encryption schemes over finite fields
- Fully homomorphic encryption from the finite field isomorphism problem
- Fully homomophic encryption over the integers revisited
- On finite fields for pairing based cryptography
- Efficient hardware implementation of finite fields with applications to cryptography
- On constructing homomorphic encryption schemes from coding theory
- On homomorphic encryption and chosen-ciphertext security
- On the homomorphic computation of symmetric cryptographic primitives
- scientific article; zbMATH DE number 927439
- Homomorphic encryption and applications
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
- An improved RNS variant of the BFV homomorphic encryption scheme
- Approximate homomorphic encryption with reduced approximation error
- Better bootstrapping for approximate homomorphic encryption
- FHEW: bootstrapping homomorphic encryption in less than a second
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully homomorphic SIMD operations
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic evaluation of the AES circuit
- Implementing Gentry's fully-homomorphic encryption scheme
- Which ring based somewhat homomorphic encryption scheme is best?
Cited in
(23)- On the precision loss in approximate homomorphic encryption
- Partially homomorphic encryption schemes over finite fields
- Bootstrapping for BGV and BFV revisited
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Finding and evaluating parameters for BGV
- On the practical \(\mathrm{CPA}^D\) security of ``exact and threshold FHE schemes and libraries
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- Fine-grained cryptography revisited
- Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
- Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
- An improved RNS variant of the BFV homomorphic encryption scheme
- Homomorphic encryption for finite automata
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- Full domain functional bootstrapping with least significant bit encoding
- A comparison of different finite fields for elliptic curve cryptosystems
- Fully homomorphic encryption from the finite field isomorphism problem
- Compression in Finite Fields and Torus-Based Cryptography
- (Finite) field work: choosing the best encoding of numbers for FHE computation
- Efficient hardware implementation of finite fields with applications to cryptography
- Fine-grained cryptography revisited
- Optimisations and tradeoffs for HElib
- Accelerating HE operations from key decomposition technique
- Bit Security of the CDH Problems over Finite Fields
This page was built for publication: Revisiting homomorphic encryption schemes for finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157565)
