Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping

DOI10.1007/978-3-031-22966-4_5zbMath1519.94163OpenAlexW3204113425MaRDI QIDQ6132408

Zeyu Liu, Daniele Micciancio, Yuriy Polyakov

Publication date: 16 August 2023

Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22966-4_5

zbMATH Keywords

programmable bootstrappingsign function evaluation algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Related Items (4)

Discretization error reduction for high precision torus fully homomorphic encryption ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ Parameter optimization and larger precision for (T)FHE ⋮ \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain

Cites Work

• (Leveled) Fully Homomorphic Encryption without Bootstrapping
• On the concrete hardness of learning with errors
• CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
• Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
• Efficient homomorphic conversion between (ring) LWE ciphertexts
• An improved RNS variant of the BFV homomorphic encryption scheme
• Building an efficient lattice gadget toolkit: Subgaussian sampling and more
• Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
• Homomorphic encryption for arithmetic of approximate numbers
• Efficient homomorphic comparison methods with optimal complexity
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
• Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
• Optimal Convergence Rates for the Orthogonal Greedy Algorithm
• Neural field equations with neuron‐dependent Heaviside‐type activation function and spatial‐dependent delay
• On lattices, learning with errors, random linear codes, and cryptography
• FINAL: faster FHE instantiated with NTRU and LWE
• Revisiting homomorphic encryption schemes for finite fields
• Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE

This page was built for publication: Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping