Security Proofs for Key-Alternating Ciphers with Non-Independent Round Permutations

Liqing Yu; Yusai Wu; Yu Yu; Zhenfu Cao; Xiaolei Dong

doi:10.1007/978-3-031-48615-9_9

Security Proofs for Key-Alternating Ciphers with Non-Independent Round Permutations

Liqing Yu
, Yusai Wu^*
, Yu Yu
, Zhenfu Cao
, Xiaolei Dong

^*Corresponding author for this work

Software Engineering Institute

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

This work studies the key-alternating ciphers (KACs) whose round permutations are not necessarily independent. We revisit existing security proofs for key-alternating ciphers with a single permutation (KACSPs), and extend their method to an arbitrary number of rounds. In particular, we propose new techniques that can significantly simplify the proofs, and also remove two unnatural restrictions in the known security bound of 3-round KACSP (Wu et al., Asiacrypt 2020). With these techniques, we prove the first tight security bound for t-round KACSP, which was an open problem. We stress that our techniques apply to all variants of KACs with non-independent round permutations, as well as to the standard KACs.

Original language	English
Title of host publication	Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings
Editors	Guy Rothblum, Hoeteck Wee
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	238-267
Number of pages	30
ISBN (Print)	9783031486142
DOIs	https://doi.org/10.1007/978-3-031-48615-9_9
State	Published - 2023
Event	21st International conference on Theory of Cryptography Conference, TCC 2023 - Taipei, Taiwan, Province of China Duration: 29 Nov 2023 → 2 Dec 2023

Publication series

Name	Lecture Notes in Computer Science
Volume	14369 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	21st International conference on Theory of Cryptography Conference, TCC 2023
Country/Territory	Taiwan, Province of China
City	Taipei
Period	29/11/23 → 2/12/23

Access to Document

10.1007/978-3-031-48615-9_9

Cite this

Yu, L., Wu, Y., Yu, Y., Cao, Z., & Dong, X. (2023). Security Proofs for Key-Alternating Ciphers with Non-Independent Round Permutations. In G. Rothblum, & H. Wee (Eds.), Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings (pp. 238-267). (Lecture Notes in Computer Science; Vol. 14369 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-48615-9_9

@inproceedings{a902a8a4c8b447efbfbb7fa03c85e196,

title = "Security Proofs for Key-Alternating Ciphers with Non-Independent Round Permutations",

abstract = "This work studies the key-alternating ciphers (KACs) whose round permutations are not necessarily independent. We revisit existing security proofs for key-alternating ciphers with a single permutation (KACSPs), and extend their method to an arbitrary number of rounds. In particular, we propose new techniques that can significantly simplify the proofs, and also remove two unnatural restrictions in the known security bound of 3-round KACSP (Wu et al., Asiacrypt 2020). With these techniques, we prove the first tight security bound for t-round KACSP, which was an open problem. We stress that our techniques apply to all variants of KACs with non-independent round permutations, as well as to the standard KACs.",

author = "Liqing Yu and Yusai Wu and Yu Yu and Zhenfu Cao and Xiaolei Dong",

note = "Publisher Copyright: {\textcopyright} 2023, International Association for Cryptologic Research.; 21st International conference on Theory of Cryptography Conference, TCC 2023 ; Conference date: 29-11-2023 Through 02-12-2023",

year = "2023",

doi = "10.1007/978-3-031-48615-9\_9",

language = "英语",

isbn = "9783031486142",

series = "Lecture Notes in Computer Science",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "238--267",

editor = "Guy Rothblum and Hoeteck Wee",

booktitle = "Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings",

address = "德国",

}

Yu, L, Wu, Y, Yu, Y , Cao, Z & Dong, X 2023, Security Proofs for Key-Alternating Ciphers with Non-Independent Round Permutations. in G Rothblum & H Wee (eds), Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings. Lecture Notes in Computer Science, vol. 14369 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 238-267, 21st International conference on Theory of Cryptography Conference, TCC 2023, Taipei, Taiwan, Province of China, 29/11/23. https://doi.org/10.1007/978-3-031-48615-9_9

Security Proofs for Key-Alternating Ciphers with Non-Independent Round Permutations. / Yu, Liqing; Wu, Yusai; Yu, Yu et al.
Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings. ed. / Guy Rothblum; Hoeteck Wee. Springer Science and Business Media Deutschland GmbH, 2023. p. 238-267 (Lecture Notes in Computer Science; Vol. 14369 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Security Proofs for Key-Alternating Ciphers with Non-Independent Round Permutations

AU - Yu, Liqing

AU - Wu, Yusai

AU - Yu, Yu

AU - Cao, Zhenfu

AU - Dong, Xiaolei

PY - 2023

Y1 - 2023

N2 - This work studies the key-alternating ciphers (KACs) whose round permutations are not necessarily independent. We revisit existing security proofs for key-alternating ciphers with a single permutation (KACSPs), and extend their method to an arbitrary number of rounds. In particular, we propose new techniques that can significantly simplify the proofs, and also remove two unnatural restrictions in the known security bound of 3-round KACSP (Wu et al., Asiacrypt 2020). With these techniques, we prove the first tight security bound for t-round KACSP, which was an open problem. We stress that our techniques apply to all variants of KACs with non-independent round permutations, as well as to the standard KACs.

AB - This work studies the key-alternating ciphers (KACs) whose round permutations are not necessarily independent. We revisit existing security proofs for key-alternating ciphers with a single permutation (KACSPs), and extend their method to an arbitrary number of rounds. In particular, we propose new techniques that can significantly simplify the proofs, and also remove two unnatural restrictions in the known security bound of 3-round KACSP (Wu et al., Asiacrypt 2020). With these techniques, we prove the first tight security bound for t-round KACSP, which was an open problem. We stress that our techniques apply to all variants of KACs with non-independent round permutations, as well as to the standard KACs.

UR - https://www.scopus.com/pages/publications/85178602991

U2 - 10.1007/978-3-031-48615-9_9

DO - 10.1007/978-3-031-48615-9_9

M3 - 会议稿件

AN - SCOPUS:85178602991

SN - 9783031486142

T3 - Lecture Notes in Computer Science

SP - 238

EP - 267

BT - Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings

A2 - Rothblum, Guy

A2 - Wee, Hoeteck

PB - Springer Science and Business Media Deutschland GmbH

T2 - 21st International conference on Theory of Cryptography Conference, TCC 2023

Y2 - 29 November 2023 through 2 December 2023

ER -

Yu L, Wu Y, Yu Y , Cao Z , Dong X. Security Proofs for Key-Alternating Ciphers with Non-Independent Round Permutations. In Rothblum G, Wee H, editors, Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings. Springer Science and Business Media Deutschland GmbH. 2023. p. 238-267. (Lecture Notes in Computer Science). doi: 10.1007/978-3-031-48615-9_9