TU Darmstadt / ULB / TUbiblio

Populating the Zoo of Rugged Pseudorandom Permutations

Degabriele, Jean Paul ; Karadžić, Vukašin
eds.: Guo, Jian ; Steinfeld, Ron (2023)
Populating the Zoo of Rugged Pseudorandom Permutations.
29th International Conference on the Theory and Application of Cryptology and Information Security (Asiacrypt 2023). Guangzhou, Peoples Republic of China (04.-08.12.2023)
doi: 10.1007/978-981-99-8742-9_9
Conference or Workshop Item, Bibliographie

Abstract

A Rugged Pseudorandom Permutation (RPRP) is a variable-input-length tweakable cipher satisfying a security notion that is intermediate between tweakable PRP and tweakable SPRP. It was introduced at CRYPTO 2022 by Degabriele and Karad\vi\', who additionally showed how to generically convert such a primitive into nonce-based and nonce-hiding AEAD schemes satisfying either misuse-resistance or release-of-unverified-plaintext security as well as Nonce-Set AEAD which has applications in protocols like QUIC and DTLS. Their work shows that RPRPs are powerful and versatile cryptographic primitives. However, the RPRP security notion itself can seem rather contrived, and the motivation behind it is not immediately clear. Moreover, they only provided a single RPRP construction, called UIV, which puts into question the generality of their modular approach and whether other instantiations are even possible. In this work, we address this question positively by presenting new RPRP constructions, thereby validating their modular approach and providing further justification in support of the RPRP security definition. Furthermore, we present a more refined view of their results by showing that strictly weaker RPRP variants, which we introduce, suffice for many of their transformations. From a theoretical perspective, our results show that the well-known three-round Feistel structure achieves stronger security as a permutation than a mere pseudorandom permutation---as was established in the seminal result by Luby and Rackoff. We conclude on a more practical note by showing how to extend the left domain of one RPRP construction for applications that require larger values in order to meet the desired level of security.

Item Type: Conference or Workshop Item
Erschienen: 2023
Editors: Guo, Jian ; Steinfeld, Ron
Creators: Degabriele, Jean Paul ; Karadžić, Vukašin
Type of entry: Bibliographie
Title: Populating the Zoo of Rugged Pseudorandom Permutations
Language: English
Date: 19 December 2023
Publisher: Springer
Book Title: Advances in Cryptology - ASIACRYPT 2023
Series: Lecture Notes in Computer Science
Series Volume: 14445
Event Title: 29th International Conference on the Theory and Application of Cryptology and Information Security (Asiacrypt 2023)
Event Location: Guangzhou, Peoples Republic of China
Event Dates: 04.-08.12.2023
DOI: 10.1007/978-981-99-8742-9_9
Abstract:

A Rugged Pseudorandom Permutation (RPRP) is a variable-input-length tweakable cipher satisfying a security notion that is intermediate between tweakable PRP and tweakable SPRP. It was introduced at CRYPTO 2022 by Degabriele and Karad\vi\', who additionally showed how to generically convert such a primitive into nonce-based and nonce-hiding AEAD schemes satisfying either misuse-resistance or release-of-unverified-plaintext security as well as Nonce-Set AEAD which has applications in protocols like QUIC and DTLS. Their work shows that RPRPs are powerful and versatile cryptographic primitives. However, the RPRP security notion itself can seem rather contrived, and the motivation behind it is not immediately clear. Moreover, they only provided a single RPRP construction, called UIV, which puts into question the generality of their modular approach and whether other instantiations are even possible. In this work, we address this question positively by presenting new RPRP constructions, thereby validating their modular approach and providing further justification in support of the RPRP security definition. Furthermore, we present a more refined view of their results by showing that strictly weaker RPRP variants, which we introduce, suffice for many of their transformations. From a theoretical perspective, our results show that the well-known three-round Feistel structure achieves stronger security as a permutation than a mere pseudorandom permutation---as was established in the seminal result by Luby and Rackoff. We conclude on a more practical note by showing how to extend the left domain of one RPRP construction for applications that require larger values in order to meet the desired level of security.

Additional Information:

Part VIII

Divisions: 20 Department of Computer Science
20 Department of Computer Science > Cryptography and Complexity Theory
Profile Areas
Profile Areas > Cybersecurity (CYSEC)
Date Deposited: 20 Dec 2023 14:39
Last Modified: 14 May 2024 11:24
PPN: 518258424
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details