Revisiting homomorphic encryption schemes for finite fields
From MaRDI portal
Publication:6157565
DOI10.1007/978-3-030-92078-4_21zbMATH Open1514.94108OpenAlexW3159746013MaRDI QIDQ6157565FDOQ6157565
Authors: 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
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
- Fully homomorphic encryption with polylog overhead
- Homomorphic evaluation of the AES circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Implementing Gentry's fully-homomorphic encryption scheme
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- (Leveled) fully homomorphic encryption without bootstrapping
- Fully homomorphic SIMD operations
- A comparison of the homomorphic encryption schemes FV and YASHE
- Better bootstrapping for approximate homomorphic encryption
- FHEW: bootstrapping homomorphic encryption in less than a second
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- An improved RNS variant of the BFV homomorphic encryption scheme
- Homomorphic encryption for arithmetic of approximate numbers
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Which ring based somewhat homomorphic encryption scheme is best?
- Approximate homomorphic encryption with reduced approximation error
Cited In (22)
- Fine-grained cryptography revisited
- Full domain functional bootstrapping with least significant bit encoding
- Fully homomorphic encryption from the finite field isomorphism problem
- Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
- Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
- Homomorphic encryption for finite automata
- An improved RNS variant of the BFV homomorphic encryption scheme
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Finding and evaluating parameters for BGV
- On the precision loss in approximate homomorphic encryption
- Fine-grained cryptography revisited
- A comparison of different finite fields for elliptic curve cryptosystems
- Optimisations and tradeoffs for HElib
- Partially homomorphic encryption schemes over finite fields
- Bootstrapping for BGV and BFV revisited
- 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
- Compression in Finite Fields and Torus-Based Cryptography
- Bit Security of the CDH Problems over Finite Fields
- (Finite) field work: choosing the best encoding of numbers for FHE computation
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- Efficient hardware implementation of finite fields with applications to cryptography
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)
