Tweakable ForkCipher from Ideal Block Cipher

Sougata Mandal

doi:10.62056/aey4fbn2hd

Tweakable ForkCipher from Ideal Block Cipher

Authors

Sougata Mandal

Institute for Advancing Intelligence, TCG CREST, Kolkata, India
Ramakrishna Mission Vivekananda Educational and Research Institute, Belur, India
sougata dot mandal at tcgcrest dot org

Abstract

In ASIACRYPT 2019, Andreeva et al. introduced a new symmetric key primitive called the forkcipher, designed for lightweight applications handling short messages. A forkcipher is a keyed function with a public tweak, featuring fixed-length input and fixed-length (expanding) output. They also proposed a specific forkcipher, ForkSkinny, based on the tweakable block cipher SKINNY, and its security was evaluated through cryptanalysis. Since then, several efficient AEAD and MAC schemes based on forkciphers have been proposed, catering not only to short messages but also to various purposes such as leakage resilience and cloud security. While forkciphers have proven to be efficient solutions for designing AEAD schemes, the area of forkcipher design remains unexplored, particularly the lack of provably secure forkcipher constructions.

In this work, we propose forkcipher design for various tweak lengths, based on a block cipher as the underlying primitive. We provide proofs of security for these constructions, assuming the underlying block cipher behaves as an ideal block cipher. First, we present a forkcipher, $\widetilde{\textsf{F}}1$, for an $n$-bit tweak and prove its optimal ($n$-bit) security. Next, we propose another construction, $\widetilde{\textsf{F}}2$, for a $2n$-bit tweak, also proving its optimal ($n$-bit) security. Finally, we introduce a construction, $\widetilde{\textsf{F}}r$, for a general $rn$-bit tweak, achieving $n$-bit security.

References

[ABL⁺14]

Elena Andreeva, Andrey Bogdanov, Atul Luykx, Bart Mennink, Nicky Mouha, and Kan Yasuda. How to Securely Release Unverified Plaintext in Authenticated Encryption. In Palash Sarkar and Tetsu Iwata, editors, Advances in Cryptology – ASIACRYPT 2014, pages 105–125, Berlin, Heidelberg. 2014. Springer Berlin Heidelberg. DOI: https://doi.org/10.1007/978-3-662-45611-8_6

Google Scholar ePrint

[ABPV21]

Elena Andreeva, Amit Singh Bhati, Bart Preneel, and Damian Vizár. 1, 2, 3, Fork: Counter Mode Variants based on a Generalized Forkcipher. IACR Trans. Symmetric Cryptol., 2021(3):1–35, 2021. DOI: 10.46586/TOSC.V2021.I3.1-35

Google Scholar ePrint

[ABV21]

Elena Andreeva, Amit Singh Bhati, and Damian Vizár. Nonce-Misuse Security of the SAEF Authenticated Encryption Mode. In Orr Dunkelman, Michael J. Jacobson Jr., and Colin O'Flynn, editors, Selected Areas in Cryptography, pages 512–534, Cham. 2021. Springer International Publishing. DOI: https://doi.org/10.1007/978-3-030-81652-0_20

Google Scholar ePrint

[ALP⁺19]

Elena Andreeva, Virginie Lallemand, Antoon Purnal, Reza Reyhanitabar, Arnab Roy, and Damian Vizár. Forkcipher: A New Primitive for Authenticated Encryption of Very Short Messages. In Steven D. Galbraith and Shiho Moriai, editors, ASIACRYPT II, volume 11922 of LNCS, pages 153–182. 2019. Springer. DOI: 10.1007/978-3-030-34621-8_6

Google Scholar ePrint

[ARVV18]

Elena Andreeva, Reza Reyhanitabar, Kerem Varici, and Damian Vizár. Forking a Blockcipher for Authenticated Encryption of Very Short Messages. https://eprint.iacr.org/2018/916. Cryptology ePrint Archive, Paper 2018/916. 2018.

Google Scholar ePrint

[AW23]

Elena Andreeva and Andreas Weninger. A Forkcipher-Based Pseudo-Random Number Generator. In Mehdi Tibouchi and XiaoFeng Wang, editors, Applied Cryptography and Network Security, pages 3–31, Cham. 2023. Springer Nature Switzerland. DOI: https://doi.org/10.1007/978-3-031-33491-7_1

Google Scholar ePrint

[BAV24]

Amit Singh Bhati, Elena Andreeva, and Damian Vizár. OAE-RUP: A Strong Online AEAD Security Notion and Its Application to SAEF. In Clemente Galdi and Duong Hieu Phan, editors, Security and Cryptography for Networks - 14th International Conference, SCN 2024, Amalfi, Italy, September 11-13, 2024, Proceedings, Part II, volume 14974 of Lecture Notes in Computer Science, pages 117–139. 2024. Springer. DOI: 10.1007/978-3-031-71073-5_6

Google Scholar ePrint

[BBJ⁺19]

Subhadeep Banik, Jannis Bossert, Amit Jana, Eik List, Stefan Lucks, Willi Meier, Mostafizar Rahman, Dhiman Saha, and Yu Sasaki. Cryptanalysis of ForkAES. In Applied Cryptography and Network Security: 17th International Conference, ACNS 2019, Bogota, Colombia, June 5–7, 2019, Proceedings, pages 43–63, Berlin, Heidelberg. 2019. Springer-Verlag. DOI: 10.1007/978-3-030-21568-2_3

Google Scholar ePrint

[BDL20]

Augustin Bariant, Nicolas David, and Gaëtan Leurent. Cryptanalysis of Forkciphers. IACR Transactions on Symmetric Cryptology, 2020(1):233–265, May 2020. DOI: 10.13154/tosc.v2020.i1.233-265

Google Scholar ePrint

[BPA⁺23]

Amit Singh Bhati, Erik Pohle, Aysajan Abidin, Elena Andreeva, and Bart Preneel. Let's Go Eevee! A Friendly and Suitable Family of AEAD Modes for IoT-to-Cloud Secure Computation. In Weizhi Meng, Christian Damsgaard Jensen, Cas Cremers, and Engin Kirda, editors, Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS 2023, Copenhagen, Denmark, November 26-30, 2023, pages 2546–2560. 2023. ACM. DOI: 10.1145/3576915.3623091

Google Scholar ePrint

[BSL24]

Francesco Berti, François-Xavier Standaert, and Itamar Levi. Authenticity in the Presence of Leakage using a Forkcipher. Cryptology ePrint Archive, Paper 2024/1325. 2024.

Google Scholar ePrint

[DDDM23]

Nilanjan Datta, Shreya Dey, Avijit Dutta, and Sougata Mandal. Cascading Four Round LRW1 is Beyond Birthday Bound Secure. IACR Trans. Symmetric Cryptol., 2023(4):365–390, 2023. DOI: 10.46586/TOSC.V2023.I4.365-390

Google Scholar ePrint

[DDLM24]

Nilanjan Datta, Avijit Dutta, Eik List, and Sougata Mandal. FEDT: Forkcipher-based Leakage-resilient Beyond-birthday-secure AE. IACR Communications in Cryptology, 1(2), 2024. DOI: 10.62056/akgyl86bm

Google Scholar ePrint

[DDML24]

Nilanjan Datta, Avijit Dutta, and Cuauhtemoc Mancillas-López. $\textsf{LightMAC}$: Fork it and make it faster. 2024.

Google Scholar ePrint

[DGL22]

Avijit Dutta, Jian Guo, and Eik List. Forking Sums of Permutations for Optimally Secure and Highly Efficient PRFs. https://eprint.iacr.org/2022/1609. Cryptology ePrint Archive, Paper 2022/1609. 2022.

Google Scholar ePrint

[FFL12]

Ewan Fleischmann, Christian Forler, and Stefan Lucks. McOE: A Family of Almost Foolproof On-Line Authenticated Encryption Schemes. In Anne Canteaut, editor, Fast Software Encryption - 19th International Workshop, FSE 2012, Washington, DC, USA, March 19-21, 2012. Revised Selected Papers, volume 7549 of Lecture Notes in Computer Science, pages 196–215. 2012. Springer. DOI: 10.1007/978-3-642-34047-5_12

Google Scholar ePrint

[JKNS24]

Ashwin Jha, Mustafa Khairallah, Mridul Nandi, and Abishanka Saha. Tight Security of TNT and Beyond - Attacks, Proofs and Possibilities for the Cascaded LRW Paradigm. In Marc Joye and Gregor Leander, editors, Advances in Cryptology - EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zurich, Switzerland, May 26-30, 2024, Proceedings, Part I, volume 14651 of Lecture Notes in Computer Science, pages 249–279. 2024. Springer. DOI: 10.1007/978-3-031-58716-0_9

Google Scholar ePrint

[JNP14]

Jérémy Jean, Ivica Nikolic, and Thomas Peyrin. Tweaks and Keys for Block Ciphers: The TWEAKEY Framework. In Palash Sarkar and Tetsu Iwata, editors, Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014, Proceedings, Part II, volume 8874 of Lecture Notes in Computer Science, pages 274–288. 2014. Springer. DOI: 10.1007/978-3-662-45608-8_15

Google Scholar ePrint

[KLL20]

Hwigyeom Kim, Yeongmin Lee, and Jooyoung Lee. Forking Tweakable Even-Mansour Ciphers. IACR Trans. Symmetric Cryptol., 2020(4):71–87, 2020. DOI: 10.46586/TOSC.V2020.I4.71-87

Google Scholar ePrint

[LRW02]

Moses D. Liskov, Ronald L. Rivest, and David A. Wagner. Tweakable Block Ciphers. In Moti Yung, editor, Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 2002, Proceedings, volume 2442 of Lecture Notes in Computer Science, pages 31–46. 2002. Springer. DOI: 10.1007/3-540-45708-9_3

Google Scholar ePrint

[LS13]

Rodolphe Lampe and Yannick Seurin. Tweakable Blockciphers with Asymptotically Optimal Security. In Shiho Moriai, editor, Fast Software Encryption - 20th International Workshop, FSE 2013, Singapore, March 11-13, 2013. Revised Selected Papers, volume 8424 of Lecture Notes in Computer Science, pages 133–151. 2013. Springer. DOI: 10.1007/978-3-662-43933-3_8

Google Scholar ePrint

[LST12]

Will Landecker, Thomas Shrimpton, and R. Seth Terashima. Tweakable Blockciphers with Beyond Birthday-Bound Security. In Reihaneh Safavi-Naini and Ran Canetti, editors, Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings, volume 7417 of Lecture Notes in Computer Science, pages 14–30. 2012. Springer. DOI: 10.1007/978-3-642-32009-5_2

Google Scholar ePrint

[Men15a]

Bart Mennink. Optimally Secure Tweakable Blockciphers. In Gregor Leander, editor, Fast Software Encryption - 22nd International Workshop, FSE 2015, Istanbul, Turkey, March 8-11, 2015, Revised Selected Papers, volume 9054 of Lecture Notes in Computer Science, pages 428–448. 2015. Springer. DOI: 10.1007/978-3-662-48116-5_21

Google Scholar ePrint

[Men15b]

Bart Mennink. Optimally Secure Tweakable Blockciphers. Cryptology ePrint Archive, Paper 2015/363. 2015.

Google Scholar ePrint

[Ost90]

Rafail Ostrovsky. Efficient Computation on Oblivious RAMs. In Harriet Ortiz, editor, Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, USA, pages 514–523. 1990. ACM. DOI: 10.1145/100216.100289

Google Scholar ePrint

[Pat08]

Jacques Patarin. The "Coefficients H" Technique. In Roberto Maria Avanzi, Liam Keliher, and Francesco Sica, editors, Selected Areas in Cryptography, 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers, volume 5381 of Lecture Notes in Computer Science, pages 328–345. 2008. Springer. DOI: 10.1007/978-3-642-04159-4_21

Google Scholar ePrint

[Rog04]

Phillip Rogaway. Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC. In Pil Joong Lee, editor, Advances in Cryptology - ASIACRYPT 2004, 10th International Conference on the Theory and Application of Cryptology and Information Security, Jeju Island, Korea, December 5-9, 2004, Proceedings, volume 3329 of Lecture Notes in Computer Science, pages 16–31. 2004. Springer. DOI: 10.1007/978-3-540-30539-2_2

Google Scholar ePrint

[SS23]

Yaobin Shen and François-Xavier Standaert. Optimally Secure Tweakable Block Ciphers with a Large Tweak from n-bit Block Ciphers. IACR Trans. Symmetric Cryptol., 2023(2):47–68, 2023. DOI: 10.46586/TOSC.V2023.I2.47-68

Google Scholar ePrint

[WGZ⁺16]

Lei Wang, Jian Guo, Guoyan Zhang, Jingyuan Zhao, and Dawu Gu. How to Build Fully Secure Tweakable Blockciphers from Classical Blockciphers. In Jung Hee Cheon and Tsuyoshi Takagi, editors, Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part I, volume 10031 of Lecture Notes in Computer Science, pages 455–483. 2016. DOI: 10.1007/978-3-662-53887-6_17

Google Scholar ePrint

PDF Open access

DOI: https://doi.org/10.62056/aey4fbn2hd

History

Submitted: 2024-07-09
Accepted: 2024-09-02
Published: 2024-10-07

How to cite

Sougata Mandal, Tweakable ForkCipher from Ideal Block Cipher. IACR Communications in Cryptology, vol. 1, no. 3, Oct 07, 2024, doi: 10.62056/aey4fbn2hd.

License

Copyright is held by the author(s)

This work is licensed under a Creative Commons Attribution (CC BY) license.

@article{CiC-1-3-42,
    author = "Mandal, Sougata",
    journal = "{IACR} {C}ommunications in {C}ryptology",
    publisher = "{I}nternational {A}ssociation for {C}ryptologic {R}esearch",
    title = "Tweakable ForkCipher from Ideal Block Cipher",
    volume = "1",
    number = "3",
    date = "2024-10-07",
    year = "2024",
    issn = "3006-5496",
    doi = "10.62056/aey4fbn2hd"
}

TY - JOUR
AU - Mandal, Sougata
PY  - 2024
TI  - Tweakable ForkCipher from Ideal Block Cipher
JF  - IACR Communications in Cryptology
JA  - CIC
VL  - 1
IS  - 3
DO  - 10.62056/aey4fbn2hd
UR  - https://doi.org/10.62056/aey4fbn2hd
AB  - <p>        In ASIACRYPT 2019, Andreeva et al. introduced a new symmetric key primitive called the forkcipher, designed for lightweight applications handling short messages. A forkcipher is a keyed function with a public tweak, featuring fixed-length input and fixed-length (expanding) output. They also proposed a specific forkcipher, ForkSkinny, based on the tweakable block cipher SKINNY, and its security was evaluated through cryptanalysis. Since then, several efficient AEAD and MAC schemes based on forkciphers have been proposed, catering not only to short messages but also to various purposes such as leakage resilience and cloud security. While forkciphers have proven to be efficient solutions for designing AEAD schemes, the area of forkcipher design remains unexplored, particularly the lack of provably secure forkcipher constructions.</p><p>  In this work, we propose forkcipher design for various tweak lengths, based on a block cipher as the underlying primitive. We provide proofs of security for these constructions, assuming the underlying block cipher behaves as an ideal block cipher. First, we present a forkcipher, $\widetilde{\textsf{F}}1$, for an $n$-bit tweak and prove its optimal ($n$-bit) security. Next, we propose another construction, $\widetilde{\textsf{F}}2$, for a $2n$-bit tweak, also proving its optimal ($n$-bit) security. Finally, we introduce a construction, $\widetilde{\textsf{F}}r$, for a general $rn$-bit tweak, achieving $n$-bit security. </p>
ER  -

Sougata Mandal, Tweakable ForkCipher from Ideal Block Cipher. IACR Communications in Cryptology, vol. 1, no. 3, Oct 07, 2024, doi: 10.62056/aey4fbn2hd.