Faster Homomorphic Function Evaluation Using Non-integral Base Encoding

DOI10.1007/978-3-319-66787-4_28zbMath1446.94107OpenAlexW2621002008MaRDI QIDQ5114651

Frederik Vercauteren, Ilia Iliashenko, Charlotte Bonte, Carl Bootland, Joppe W. Bos, Wouter Castryck

Publication date: 24 June 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-66787-4_28

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead ⋮ Homomorphic lower digits removal and improved FHE bootstrapping ⋮ Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Efficiently processing complex-valued data in homomorphic encryption ⋮ A full RNS variant of approximate homomorphic encryption

This page was built for publication: Faster Homomorphic Function Evaluation Using Non-integral Base Encoding