Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
From MaRDI portal
Publication:2413618
DOI10.1007/S00145-017-9273-9zbMATH Open1400.94132OpenAlexW2770809732WikidataQ121656641 ScholiaQ121656641MaRDI QIDQ2413618FDOQ2413618
Authors: Anne Canteaut, Sergiu Carpov, Caroline Fontaine, Tancrède Lepoint, María Naya-Plasencia, Pascal Paillier, Renaud Sirdey 
Publication date: 14 September 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01650012/file/joc.pdf
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
- Trivium
- PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
- SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Bootstrapping for HElib
- Fully homomorphic encryption using ideal lattices
- (Leveled) fully homomorphic encryption without bootstrapping
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Conditional Differential Cryptanalysis of Trivium and KATAN
- Conditional differential cryptanalysis of NLFSR-based cryptosystems
- Cube Attacks on Tweakable Black Box Polynomials
- Title not available (Why is that?)
- Fully homomorphic SIMD operations
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- Homomorphic AES evaluation using the modified LTV scheme
- A Comparison of the Homomorphic Encryption Schemes FV and YASHE
- Introduction to modern cryptography.
- Title not available (Why is that?)
- Breaking ‘128-bit Secure’ Supersingular Binary Curves
- Computing Discrete Logarithms in $${\mathbb F}_{3^{6 \cdot 137}}$$ and $${\mathbb F}_{3^{6 \cdot 163}}$$ Using Magma
- A New Variant of PMAC: Beyond the Birthday Bound
- The interpolation attack on block ciphers
- KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Batch Fully Homomorphic Encryption over the Integers
- New Applications of Time Memory Data Tradeoffs
- TriviA: a fast and secure authenticated encryption scheme
- Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks
- Ciphers for MPC and FHE
- Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium
- Two Trivial Attacks on Trivium
- Optimized Interpolation Attacks on LowMC
- Some (in)sufficient conditions for secure hybrid encryption
- On the Security of IV Dependent Stream Ciphers
- Scale-Invariant Fully Homomorphic Encryption over the Integers
- Cube attacks on non-blackbox polynomials based on division property
- On Lightweight Stream Ciphers with Shorter Internal States
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
- A new algorithm for multiplication in finite fields
- Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption
- Degree evaluation of NFSR-based cryptosystems
- Algorithms in HElib
- Private Computation on Encrypted Genomic Data
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- ML Confidential: Machine Learning on Encrypted Data
- On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes
- Cryptanalysis of the FLIP Family of Stream Ciphers
- Match Box Meet-in-the-Middle Attack Against KATAN
- Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
Cited In (33)
- Computation of a 30750-bit binary field discrete logarithm
- Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
- New general framework for algebraic degree evaluation of NFSR-based cryptosystems
- Algebraic meet-in-the-middle attack on LowMC
- Boolean Functions for Homomorphic-Friendly Stream Ciphers
- 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
- How do the arbiter PUFs sample the Boolean function class?
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation
- GL-S-NFSR: a new NFSR structure and its period properties
- A Fibonacci view on the Galois NFSR used in Trivium
- An improved degree evaluation method of NFSR-based cryptosystems
- 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
- 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
- Massive superpoly recovery with nested monomial predictions
- Stretching cube attacks: improved methods to recover massive superpolies
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
- 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
- Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression
- 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
- QUAD: A Practical Stream Cipher with Provable Security
Uses Software
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)
