Transciphering, using FiLIP and TFHE for an efficient delegation of computation
From MaRDI portal
Publication:2152020
DOI10.1007/978-3-030-65277-7_3zbMath1492.94122OpenAlexW3109192485MaRDI QIDQ2152020
Pierrick Méaux, Thomas Ricosset, Clément Hoffmann
Publication date: 6 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-65277-7_3
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Boolean functions (94D10)
Related Items (5)
On the fast algebraic immunity of threshold functions ⋮ \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption ⋮ FINAL: faster FHE instantiated with NTRU and LWE ⋮ Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher ⋮ Transciphering framework for approximate homomorphic encryption
Cites Work
- Cryptographic properties of the hidden weighted bit function
- On the concrete hardness of learning with errors
- Rasta: a cipher with low ANDdepth and few ANDs per bit
- Improved filter permutators for efficient FHE: better instances and implementations
- On the fast algebraic immunity of majority functions
- Decryption failure attacks on IND-CCA secure lattice-based schemes
- TFHE: fast fully homomorphic encryption over the torus
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Algorithms in HElib
- Homomorphic Evaluation of the AES Circuit
- Ciphers for MPC and FHE
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Lattice-based FHE as secure as PKE
- Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression
- A Comparison of the Homomorphic Encryption Schemes FV and YASHE
- Fully homomorphic encryption using ideal lattices
- Scale-Invariant Fully Homomorphic Encryption over the Integers
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Efficient Fully Homomorphic Encryption from (Standard) LWE
This page was built for publication: Transciphering, using FiLIP and TFHE for an efficient delegation of computation
