Welcome to the resource topic for 2025/1678
Title:
Two-Key Variant of the Four-Round Cascading LRW1
Authors: Shreya Dey, Avijit Dutta, Kazuhiko Minematsu
Abstract:In EUROCRYPT’20, Bao et al. have proved that three rounds of cascaded LRW1 construction provide security up to 2^{2n/3} queries. However, in a recent work by Khairallah et al., it has been shown that the construction provides only birthday bound security via exhibiting a distinguishing attack on the construction, and thereby invalidating the claim of Bao et al. In an independent and contemporaneous work, Datta et al. have shown that four rounds of cascading of the \textsf{LRW1} construction, dubbed as $\textsf{CLRW1}^4$—based on four independent keyed block ciphers—achieves 3n/4-bit CCA security. In this paper, we have shown that a key reduced variant of the \textsf{CLRW1}^4 construction, dubbed as \textsf{R}\mbox{-}\textsf{CLRW1}^4 based on two independent keyed block ciphers, achieves 2n/3-bit CCA security. The security proof of our construction relies on a heavy use of the H-Coefficient technique and non-trivial analysis in lower-bounding the real interpolation probability for good transcripts.
ePrint: https://eprint.iacr.org/2025/1678
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .