Toward a Fully Secure Authenticated Encryption Scheme from a Pseudorandom Permutation

Choi, Wonseok; Lee, Byeonghak; Lee, Jooyoung; Lee, Yeongmin

doi:10.1007/978-3-030-92078-4_14

Cited by 7 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We believe that the techniques have a wide range of applications in the future design of public permutation based schemes. For example, when building nonce-less MAC algorithms and (authenticated) encryption schemes with beyond birthday bound security using public permutations, as done in the case of block cipher-based mirror theory [13,28].…”

Section: Our Contributionmentioning

confidence: 99%

A Modular Approach to the Security Analysis of Two-Permutation Constructions

Chen

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Constructions based on two public permutation calls are very common in today's cryptographic community. However, each time a new construction is introduced, a dedicated proof must be carried out to study the security of the construction. In this work, we propose a new tool to analyze the security of these constructions in a modular way. This tool is built on the idea of the classical mirror theory for block cipher based constructions, such that it can be used for security proofs in the ideal permutation model. We present different variants of this public permutation mirror theory such that it is suitable for different security notions. We also present a framework to use the new techniques, which provides the bad events that need to be excluded in order to apply the public permutation mirror theory. Furthermore, we showcase the new technique on three examples: the Tweakable Even-Mansour cipher by Cogliati et al. (CRYPTO '15), the two permutation variant of the pEDM PRF by Dutta et al. (ToSC '21(2)), and the two permutation variant of the nEHtMp MAC algorithm by Dutta and Nandi (AFRICACRYPT '20).With this new tool we prove the multi-user security of these constructions in a considerably simplified way.

show abstract

Section: Our Contributionmentioning

confidence: 99%

A Modular Approach to the Security Analysis of Two-Permutation Constructions

Chen

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…For a µ-faulty nonce, if µ = 0, it is expected to degenerate to nonce-respecting; if µ ≥ 1, it is nonce-misuse. At ASIACRYPT 2021, Choi et al introduced the faulty nonce to AE, presented a parallelizable nonce-based AE mode SCM, and proved its security with graceful degradation in the faulty nonce security model [15].…”

Section: Introductionmentioning

confidence: 99%

GCM Variants with Robust Initialization Vectors

Zhang

2023

Mathematics

View full text Add to dashboard Cite

The complexity and isomerization of communication networks have put forth new requirements for cryptographic schemes to ensure the operation of network security protocols. Robust cryptographic schemes have been gradually favored. The robust initialization vector (RIV) instead of the synthetic initialization vector (SIV) was first introduced to support strong security and robust authenticated encryption. This paper first introduces RIV to GCM-SIV1, proposes a robust variant, GCM-RIV1, and proves that it ensures birthday-bound subtle AE (SAE) security and nonce-misuse resistance. Then, to support beyond-birthday-bound (BBB) security with graceful degradation, we introduce another, stronger security variant, GCM-RIV2, and prove that it allows gracefully degrading BBB SAE security in the faulty nonce setting. Finally, the performance of GCM-RIV1 and GCM-RIV2 is discussed and compared.

show abstract

Enhanced QSimon Algorithm for Attacking the Offset Two‐Round Scheme

Wu,

Feng,

Zhang

et al. 2024

Adv Quantum Tech

View full text Add to dashboard Cite

QSimon algorithm (a full quantum version of Simon's algorithm) is used to find periods in commitment functions and does not require classical calculations. However, QSimon algorithm circuit is incomplete, and the implementation of an essential component (solving boolean linear equations) has high resource consumption. This work further studies QSimon algorithm and applies QSimon algorithm to attack the offset two‐round (OTR) scheme. QSimon algorithm is established by quantum boolean linear equations solving algorithm and general quantum truncation technique, which can obtain the period of any truncated function with overwhelming probability. The confidentiality and integrity of the OTR scheme are compromised by employing QSimon algorithm. The attacks ensure a high success rate and realize exponential speedup compared with classical versions.

show abstract

Toward a Fully Secure Authenticated Encryption Scheme from a Pseudorandom Permutation

Cited by 7 publications

References 21 publications

A Modular Approach to the Security Analysis of Two-Permutation Constructions

A Modular Approach to the Security Analysis of Two-Permutation Constructions

GCM Variants with Robust Initialization Vectors

Enhanced QSimon Algorithm for Attacking the Offset Two‐Round Scheme

Contact Info

Product

Resources

About