Faster homomorphic encryption over GPGPUs via hierarchical DGT
From MaRDI portal
Publication:2147259
DOI10.1007/978-3-662-64331-0_27zbMATH Open1491.94032OpenAlexW3210706552MaRDI QIDQ2147259FDOQ2147259
Diego F. Aranha, Jheyne N. Ortiz, Pedro Geraldo M. R. Alves
Publication date: 22 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-662-64331-0_27
Recommendations
- Accelerating Fully Homomorphic Encryption in Hardware
- Exploiting the Power of GPUs for Asymmetric Cryptography
- Accelerating Lattice Based Proxy Re-encryption Schemes on GPUs
- Optimised Multiplication Architectures for Accelerating Fully Homomorphic Encryption
- Enhancing data parallelism of fully homomorphic encryption
- Faster fully homomorphic encryption
- Faster maliciously secure two-party computation using the GPU
- Accelerating homomorphic evaluation on reconfigurable hardware
Cites Work
- NFLlib: NTT-Based Fast Lattice Library
- TFHE: fast fully homomorphic encryption over the torus
- Homomorphic Evaluation of the AES Circuit
- (Leveled) fully homomorphic encryption without bootstrapping
- Title not available (Why is that?)
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- Speeding up the number theoretic transform for faster ideal lattice-based cryptography
- An improved RNS variant of the BFV homomorphic encryption scheme
- Homomorphic encryption for arithmetic of approximate numbers
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- cuHE: A Homomorphic Encryption Accelerator Library
- Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?
- Title not available (Why is that?)
- HIGH PRECISION INTEGER MULTIPLICATION WITH A GPU USING STRASSEN'S ALGORITHM WITH MULTIPLE FFT SIZES
Cited In (4)
Uses Software
This page was built for publication: Faster homomorphic encryption over GPGPUs via hierarchical DGT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147259)