Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
From MaRDI portal
Publication:6135425
DOI10.1007/978-3-031-22969-5_2zbMath1519.94093OpenAlexW4317928194MaRDI QIDQ6135425
François-Xavier Standaert, Pierrick Méaux, Orel Cosseron, Clément Hoffmann
Publication date: 25 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-22969-5_2
Related Items
Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato} ⋮ Learning with physical rounding for linear and quadratic leakage functions ⋮ Coefficient grouping for complex affine layers
Cites Work
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Rasta: a cipher with low ANDdepth and few ANDs per bit
- 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
- TFHE: fast fully homomorphic encryption over the torus
- Worst-case to average-case reductions for module lattices
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- 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
- Homomorphic Evaluation of the AES Circuit
- Ciphers for MPC and FHE
- Candidate One-Way Functions Based on Expander Graphs
- On Ideal Lattices and Learning with Errors over Rings
- A Complete Study of Two Classes of Boolean Functions: Direct Sums of Monomials and Threshold Functions
- Boolean Functions for Cryptography and Coding Theory
- Scale-Invariant Fully Homomorphic Encryption over the Integers
- Advances in Cryptology - CRYPTO 2003
- Understanding Machine Learning
- On lattices, learning with errors, random linear codes, and cryptography
- Transciphering framework for approximate homomorphic encryption
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
