Faster homomorphic encryption over GPGPUs via hierarchical DGT
From MaRDI portal
Publication:2147259
DOI10.1007/978-3-662-64331-0_27zbMATH Open1491.94032OpenAlexW3210706552MaRDI QIDQ2147259FDOQ2147259
Authors: Pedro Geraldo M. R. Alves, Jheyne N. Ortiz, Diego F. Aranha 
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 (17)
- Survey on homomorphic encryption algorithm and its application in the privacy-preserving for cloud computing
- Accelerating Lattice Based Proxy Re-encryption Schemes on GPUs
- Investigating the application of one instruction set computing for encrypted data computation
- Efficient circuits for permuting and mapping packed values across leveled homomorphic ciphertexts
- Reaction attack on outsourced computing with fully homomorphic encryption schemes
- Outsourcing medical dataset analysis: a possible solution
- Homomorphic encryption systems statement: trends and challenges
- Encrypted SQL arithmetic functions processing for secure cloud database
- Encoding of rational numbers and their homomorphic computations for FHE-based applications
- Differential privacy for free? Harnessing the noise in approximate homomorphic encryption
- TFHE public-key encryption revisited
- Exploring the advantages and challenges of Fermat NTT in FHE acceleration
- Simulation of a homomorphic encryption system
- A complete break of an homomorphic encryption algorithm based on polynomial rings
- Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption
- Cheap and fast iterative matrix inverse in encrypted domain
- Secure outsourced matrix multiplication with fully homomorphic encryption
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)
