Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
From MaRDI portal
Publication:2413618
Recommendations
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Towards stream ciphers for efficient FHE with low-noise ciphertexts
- Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
- On the homomorphic computation of symmetric cryptographic primitives
- Homomorphic evaluation of lattice-based symmetric encryption schemes
Cites work
- scientific article; zbMATH DE number 1583765 (Why is no real title available?)
- scientific article; zbMATH DE number 2009966 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A comparison of the homomorphic encryption schemes FV and YASHE
- A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
- A new algorithm for multiplication in finite fields
- A new variant of PMAC: beyond the birthday bound
- Algorithms in HElib
- Batch fully homomorphic encryption over the integers
- Bootstrapping for HElib
- Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\))
- Ciphers for MPC and FHE
- Computing discrete logarithms in \(\mathbb F_{3^{6 \cdot 137}}\) and \(\mathbb F_{3^{6 \cdot 163}}\) using Magma
- Conditional Differential Cryptanalysis of Trivium and KATAN
- Conditional differential cryptanalysis of NLFSR-based cryptosystems
- Cryptanalysis of the FLIP family of stream ciphers
- Cube Attacks on Tweakable Black Box Polynomials
- Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium
- Cube attacks on non-blackbox polynomials based on division property
- Degree evaluation of NFSR-based cryptosystems
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- FHEW: bootstrapping homomorphic encryption in less than a second
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully homomorphic SIMD operations
- Fully homomorphic encryption using ideal lattices
- Homomorphic AES evaluation using the modified LTV scheme
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic evaluation of the AES circuit
- Improved security for a ring-based fully homomorphic encryption scheme
- Improving key recovery to 784 and 799 rounds of Trivium using optimized cube attacks
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
- Introduction to modern cryptography.
- KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
- ML confidential: machine learning on encrypted data
- Match box meet-in-the-middle attack against KATAN
- Minimizing the number of bootstrappings in fully homomorphic encryption
- New Applications of Time Memory Data Tradeoffs
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- On key recovery attacks against existing somewhat homomorphic encryption schemes
- On lightweight stream ciphers with shorter internal states
- On the Security of IV Dependent Stream Ciphers
- Optimized interpolation attacks on lowMC
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- Private computation on encrypted genomic data
- SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers
- Scale-invariant fully homomorphic encryption over the integers
- Some (in)sufficient conditions for secure hybrid encryption
- The interpolation attack on block ciphers
- Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
- Towards stream ciphers for efficient FHE with low-noise ciphertexts
- TriviA: a fast and secure authenticated encryption scheme
- Trivium
- Two Trivial Attacks on Trivium
Cited in
(34)- QUAD: A Practical Stream Cipher with Provable Security
- New general framework for algebraic degree evaluation of NFSR-based cryptosystems
- Computation of a 30750-bit binary field discrete logarithm
- Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
- How to compress encrypted data
- Algebraic meet-in-the-middle attack on LowMC
- A generic method for investigating nonsingular Galois NFSRs
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- The MILP-aided conditional differential attack and its application to Trivium
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation
- How do the arbiter PUFs sample the Boolean function class?
- GL-S-NFSR: a new NFSR structure and its period properties
- An improved degree evaluation method of NFSR-based cryptosystems
- A Fibonacci view on the Galois NFSR used in Trivium
- A note on generalization of bent Boolean functions
- Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
- Transciphering framework for approximate homomorphic encryption
- Cryptanalysis of Ciminion
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Coefficient grouping for complex affine layers
- More balanced polynomials: cube attacks on 810- and 825-round Trivium with practical complexities
- Improved graph-based model for recovering superpoly on Trivium
- Security analysis of P-SPN schemes against invariant subspace attack with inactive S-boxes
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Massive superpoly recovery with nested monomial predictions
- \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
- Stretching cube attacks: improved methods to recover massive superpolies
- Massive superpoly recovery with a meet-in-the-middle framework. Improved cube attacks on \textsc{Trivium} and Kreyvium
- The algebraic FreeLunch: efficient Gröbner basis attacks against arithmetization-oriented primitives
- On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator
- Boolean functions for homomorphic-friendly stream ciphers
- New cryptanalysis of LowMC with algebraic techniques
- The inverse of \(\chi\) and its applications to Rasta-like ciphers
- Revisiting key switching techniques with applications to light-key FHE
This page was built for publication: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413618)
