The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
Open accessAbstract
Symmetric ciphers purposed for Fully Homomorphic Encryption FHE have recently been proposed for two main reasons. First, minimizing the implementation time and memory overheads that are inherent to current FHE schemes. Second, improving the homomorphic capacity, i.e. the amount of operations that one can perform on homomorphic ciphertexts before bootstrapping, which amounts to limit their level of noise. Existing solutions for this purpose suggest a gap between block ciphers and stream ciphers. The first ones typically allow a constant but small homomorphic capacity, due to the iteration of rounds eventually leading to complex Boolean functions hence large noise. The second ones typically allow a larger homomorphic capacity for the first ciphertext blocks, that decreases with the number of ciphertext blocks due to the increasing Boolean complexity of the stream ciphers' output. In this paper, we aim to combine the best of these two worlds, and propose a new stream cipher construction that allows constant and smaller noise. Its main idea is to apply a Boolean filter function to a public bit permutation of a constant key register, so that the Boolean complexity of the stream cipher outputs is constant. We also propose an instantiation of the filter function designed to exploit recent 3rd-generation FHE schemes, where the error growth is quasi-additive when adequately multiplying ciphertexts with the same amount of noise. In order to stimulate further investigation, we then specify a few instances of this stream cipher, for which we provide a preliminary security analysis. We finally highlight the good properties of our stream cipher regarding the other goal of minimizing the time and memory complexity of calculus delegation for 2nd-generation FHEi¾?schemes. We conclude the paper with open problems related to the large design space opened by these new constructions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806 · cited 5×
“Since the breakthrough work of Gentry [30], the only known way to obtain FHE consists in adding a bootstrapping technique to a SWHE.”
BackgroundMethodInfluentialNoise-tolerant learning, the parity problem, and the statistical query model
Blum, A., Kalai, A., & Wasserman, H. (2003) · Journal of the ACM · doi:10.1145/792538.792543 · Cited by 598
Cube Attacks on Tweakable Black Box Polynomials
Dinur, I., & Shamir, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_16 · Cited by 451 · cited 1×
“Eventually, cube attacks were introduced by Dinur and Shamir at Eurocrypt 2009 [20] as a variant of algebraic attacks taking advantage of the public parameters of a cryptographic protocol (plaintext in block ciphers, IV in stream cipher) in order to generate a system of equations of low degree.”
Background
Cited by
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
Albrecht, M., Grassi, L., Rechberger, C., Roy, A., & Tiessen, T. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53887-6_7 · Cited by 258
LIZARD—A lightweight stream cipher for power-constrained devices
Hamann, M., Krause, M., & Meier, W. (2017) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2017.i1.45-79 · Cited by 121
Stream cipher designs: a review
Jiao, L., Hao, Y., & Feng, D. (2020) · Science China Information Sciences · doi:10.1007/s11432-018-9929-x · Cited by 67
Design and analysis of small-state grain-like stream ciphers
Hamann, M., Krause, M., Meier, W., & Zhang, B. (2018) · Cryptography and Communications · doi:10.1007/s12095-017-0261-6 · Cited by 30
“The output function of LIZARD builds on the construction scheme introduced in [40] as part of the FLIP family of stream ciphers.”
Method
Metadata
- Authors
- Méaux, P., Journault, A., Standaert, F.-X., & Carlet, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2016
- Volume
- 2016
- Pages
- 311-343
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2469100438
- Cited by
- 164
- References
- 3
- FWCI
- 6.90
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts. https://app.cochat.ai/papers/10.1007/978-3-662-49890-3_13
- The paper
- Méaux, P., Journault, A., Standaert, F.-X., & Carlet, C. (2016). Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-662-49890-3_13
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.