Faster homomorphic evaluation of discrete Fourier transforms

DOI10.1007/978-3-319-70972-7_29MaRDI QIDQ5854442zbMATH OpenOpenAlexFDO

Authors Anamaria Costache, Srinivas Vivek, N. P. Smart

Publication date 17 March 2021

Published in Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL http://eprint.iacr.org/2016/1019

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Cryptography (94A60)

Recommendations

• Efficiently processing complex-valued data in homomorphic encryption
• Fast homomorphic evaluation of deep discretized neural networks
• Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
• Homomorphic evaluation of the AES circuit
• TFHE: fast fully homomorphic encryption over the torus

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• Factoring polynomials with rational coefficients
• Homomorphic evaluation of the AES circuit
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

Cited in

(9)

• Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data
• Bootstrapping for approximate homomorphic encryption
• Fixed-point arithmetic in SHE schemes
• A full RNS variant of approximate homomorphic encryption
• When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead
• Efficiently processing complex-valued data in homomorphic encryption
• Improved Twiddle Access for Fast Fourier Transforms
• Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms
• Faster Homomorphic Function Evaluation Using Non-integral Base Encoding

This page was built for publication: Faster homomorphic evaluation of discrete Fourier transforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5854442)