Improved filter permutators for efficient FHE: better instances and implementations
From MaRDI portal
Publication:2179380
DOI10.1007/978-3-030-35423-7_4zbMath1456.94100OpenAlexW2996671342MaRDI QIDQ2179380
Pierrick Méaux, Claude Carlet, Anthony Journault, François-Xavier Standaert
Publication date: 12 May 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-35423-7_4
Related Items (9)
On the fast algebraic immunity of threshold functions ⋮ On constructions of weightwise perfectly balanced Boolean functions ⋮ Transciphering, using FiLIP and TFHE for an efficient delegation of computation ⋮ On the algebraic immunity of direct sum constructions ⋮ \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption ⋮ Improved filter permutators for efficient FHE: better instances and implementations ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher ⋮ Transciphering framework for approximate homomorphic encryption
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Rasta: a cipher with low ANDdepth and few ANDs per bit
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- On the concrete security of Goldreich's pseudorandom generator
- Tools in analyzing linear approximation for Boolean functions related to FLIP
- On the nonlinearity of Boolean functions with restricted input
- Improved filter permutators for efficient FHE: better instances and implementations
- Multi-user security bound for filter permutators in the random oracle model
- Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
- (Leveled) fully homomorphic encryption without bootstrapping
- Cryptanalysis of the FLIP Family of Stream Ciphers
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Block Ciphers That Are Easier to Mask: How Far Can We Go?
- Algorithms in HElib
- LS-Designs: Bitslice Encryption for Efficient Masked Software Implementations
- Ciphers for MPC and FHE
- Candidate One-Way Functions Based on Expander Graphs
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression
- Cryptographic Hardness of Random Local Functions–Survey
- Fully homomorphic encryption using ideal lattices
- Algebraic attacks against random local functions and their countermeasures
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Advances in Cryptology - CRYPTO 2003
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
This page was built for publication: Improved filter permutators for efficient FHE: better instances and implementations
