Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
From MaRDI portal
Publication:6135425
Recommendations
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Toward basing fully homomorphic encryption on worst-case hardness
- Somewhat/fully homomorphic encryption: implementation progresses and challenges
- Practical Parameters for Somewhat Homomorphic Encryption (SHE) Schemes on Binary Circuits
- On CCA-Secure Somewhat Homomorphic Encryption
- On homomorphic encryption and chosen-ciphertext security
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- The ECCA Security of Hybrid Encryptions
- On the CCA-1 security of somewhat homomorphic encryption over the integers
Cites work
- scientific article; zbMATH DE number 2009966 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A Complete Study of Two Classes of Boolean Functions: Direct Sums of Monomials and Threshold Functions
- A new efficient algorithm for computing Gröbner bases (F₄)
- Advances in Cryptology - CRYPTO 2003
- Boolean functions for cryptography and coding theory
- Candidate one-way functions based on expander graphs
- Ciphers for MPC and FHE
- Cryptanalysis of the FLIP family of stream ciphers
- Deep learning
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic evaluation of the AES circuit
- Improved filter permutators for efficient FHE: better instances and implementations
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Multi-user security bound for filter permutators in the random oracle model
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the algebraic immunity of direct sum constructions
- On the concrete hardness of learning with errors
- Rasta: a cipher with low ANDdepth and few ANDs per bit
- Scale-invariant fully homomorphic encryption over the integers
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- TFHE: fast fully homomorphic encryption over the torus
- Towards stream ciphers for efficient FHE with low-noise ciphertexts
- Transciphering framework for approximate homomorphic encryption
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation
- Understanding machine learning. From theory to algorithms
- Worst-case to average-case reductions for module lattices
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
Cited in
(13)- Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation
- Towards stream ciphers for efficient FHE with low-noise ciphertexts
- Cryptanalysis of \texttt{Elisabeth-4}
- Transciphering framework for approximate homomorphic encryption
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Coefficient grouping for complex affine layers
- Learning with physical rounding for linear and quadratic leakage functions
- The patching landscape of Elisabeth-4 and the mixed filter permutator paradigm
- Security analysis of P-SPN schemes against invariant subspace attack with inactive S-boxes
- The algebraic FreeLunch: efficient Gröbner basis attacks against arithmetization-oriented primitives
- Revisiting key switching techniques with applications to light-key FHE
This page was built for publication: Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135425)
