Authenticated encryption schemes: A systematic review
Authenticated encryption (AE) is a cryptographic construction that simultaneously protects
confidentiality and integrity. A considerable amount of research has been devoted to the …
confidentiality and integrity. A considerable amount of research has been devoted to the …
A survey on cryptographic techniques for protecting big data security: present and forthcoming
S Lu, J Zheng, Z Cao, Y Wang, C Gu - Science China Information …, 2022 - Springer
Big data drive multidimensional convergence and profound innovations among industries
and provide novel ways of exploring the world. As they significantly create economic and …
and provide novel ways of exploring the world. As they significantly create economic and …
Boosting authenticated encryption robustness with minimal modifications
Secure and highly efficient authenticated encryption (AE) algorithms which achieve data
confidentiality and authenticity in the symmetric-key setting have existed for well over a …
confidentiality and authenticity in the symmetric-key setting have existed for well over a …
On leakage-resilient authenticated encryption with decryption leakages
At CCS 2015, Pereira et al. introduced a pragmatic model enabling the study of leakage-
resilient symmetric cryptographic primitives based on the minimal use of a leak-free …
resilient symmetric cryptographic primitives based on the minimal use of a leak-free …
Stronger security variants of GCM-SIV
T Iwata, K Minematsu - Cryptology ePrint Archive, 2016 - eprint.iacr.org
Abstract At CCS 2015, Gueron and Lindell proposed GCM-SIV, a provably secure
authenticated encryption scheme that remains secure even if the nonce is repeated. While …
authenticated encryption scheme that remains secure even if the nonce is repeated. While …
Indifferentiable authenticated encryption
Abstract We study Authenticated Encryption with Associated Data (AEAD) from the viewpoint
of composition in arbitrary (single-stage) environments. We use the indifferentiability …
of composition in arbitrary (single-stage) environments. We use the indifferentiability …
Jammin'on the deck
Currently, a vast majority of symmetric-key cryptographic schemes are built as block cipher
modes. The block cipher is designed to be hard to distinguish from a random permutation …
modes. The block cipher is designed to be hard to distinguish from a random permutation …
Populating the Zoo of Rugged Pseudorandom Permutations
JP Degabriele, V Karadžić - International Conference on the Theory and …, 2023 - Springer
Abstract A Rugged Pseudorandom Permutation (RPRP) is a variable-input-length tweakable
cipher satisfying a security notion that is intermediate between tweakable PRP and …
cipher satisfying a security notion that is intermediate between tweakable PRP and …
Comprehensive Robustness Analysis of GCM, CCM, and OCB3
A Inoue, T Iwata, K Minematsu - Cryptology ePrint Archive, 2024 - eprint.iacr.org
Clarifying the robustness of authenticated encryption (AE) schemes, such as security under
nonce misuse or Release of Unverified Plaintext (RUP), is critically important due to the …
nonce misuse or Release of Unverified Plaintext (RUP), is critically important due to the …
XOR of PRPs in a quantum world
B Mennink, A Szepieniec - International Workshop on Post-Quantum …, 2017 - Springer
In the classical world, the XOR of pseudorandom permutations E_ k_1 ⊕ ⋯ ⊕ E_ k_r for r ≥
2 is a well-established way to design a pseudorandom function with “optimal” security …
2 is a well-established way to design a pseudorandom function with “optimal” security …