Faster homomorphic encryption over GPGPUs via hierarchical DGT

DOI10.1007/978-3-662-64331-0_27zbMath1491.94032OpenAlexW3210706552MaRDI QIDQ2147259

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

zbMATH Keywords

CUDAfully homomorphic encryptionpolynomial multiplicationBFVprivacy-preserving computing

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• NFLlib
• cuHE
• GitHub
• SEAL
• TFHE

Cites Work

• Unnamed Item
• Unnamed Item
• (Leveled) Fully Homomorphic Encryption without Bootstrapping
• 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
• TFHE: fast fully homomorphic encryption over the torus
• Homomorphic encryption for arithmetic of approximate numbers
• Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?
• NFLlib: NTT-Based Fast Lattice Library
• cuHE: A Homomorphic Encryption Accelerator Library
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Homomorphic Evaluation of the AES Circuit
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• HIGH PRECISION INTEGER MULTIPLICATION WITH A GPU USING STRASSEN'S ALGORITHM WITH MULTIPLE FFT SIZES

This page was built for publication: Faster homomorphic encryption over GPGPUs via hierarchical DGT