Enhancing Data Parallelism of Fully Homomorphic Encryption

DOI10.1007/978-3-319-53177-9_10zbMath1381.94081OpenAlexW2586632692MaRDI QIDQ2988346

No author found.

Publication date: 19 May 2017

Published in: Information Security and Cryptology – ICISC 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53177-9_10

zbMATH Keywords

homomorphic encryptiondata parallelismring learning with errors

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes

Uses Software

• Unnamed Item
• NFLlib

Cites Work

• Unnamed Item
• NFLlib: NTT-Based Fast Lattice Library
• (Leveled) fully homomorphic encryption without bootstrapping
• Homomorphic Evaluation of the AES Circuit
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Towards Efficient Arithmetic for Lattice-Based Cryptography on Reconfigurable Hardware
• A Comparison of the Homomorphic Encryption Schemes FV and YASHE
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Computing Blindfolded: New Developments in Fully Homomorphic Encryption

This page was built for publication: Enhancing Data Parallelism of Fully Homomorphic Encryption