Attacks on Beyond-Birthday-Bound MACs in the Quantum Setting

2021 ◽  
pp. 421-441
Author(s):  
Tingting Guo ◽  
Peng Wang ◽  
Lei Hu ◽  
Dingfeng Ye
Keyword(s):  
Beyond Birthday Bound

scholarly journals Generic Attacks Against Beyond-Birthday-Bound MACs

2018 ◽  
pp. 306-336 ◽  
Author(s):  
Gaëtan Leurent ◽  
Mridul Nandi ◽  
Ferdinand Sibleyras
Keyword(s):  
Generic Attacks ◽  
Beyond Birthday Bound

scholarly journals Single Key Variant of PMAC_Plus

2017 ◽  
pp. 268-305 ◽  
Author(s):  
Nilanjan Datta ◽  
Avijit Dutta ◽  
Mridul Nandi ◽  
Goutam Paul ◽  
Liting Zhang
Keyword(s):  
Standard Model ◽  
Design Principle ◽  
Block Cipher ◽  
Black Box ◽  
Arbitrary Field ◽  
Message Authentication ◽  
Message Authentication Code ◽  
Authentication Code ◽  
Parallel Network ◽  
Beyond Birthday Bound

At CRYPTO 2011, Yasuda proposed the PMAC_Plus message authentication code based on an n-bit block cipher. Its design principle inherits the well known PMAC parallel network with a low additional cost. PMAC_Plus is a rate-1 construction like PMAC (i.e., one block cipher call per n-bit message block) but provides security against all adversaries (under black-box model) making queries altogether consisting of roughly upto 22n/3 blocks (strings of n-bits). Even though PMAC_Plus gives higher security than the standard birthday bound security, with currently available best bound, it provides weaker security than PMAC for certain choices of adversaries. Moreover, unlike PMAC, PMAC_Plus operates with three independent block cipher keys. In this paper, we propose 1k-PMAC_Plus, the first rate-1 single keyed block cipher based BBB (Beyond Birthday Bound) secure (in standard model) deterministic MAC construction without arbitrary field multiplications. 1k-PMAC_Plus, as the name implies, is a simple one-key variant of PMAC_Plus. In addition to the key reduction, we obtain a higher security guarantee than what was proved originally for PMAC_Plus, thus an improvement in two directions.

scholarly journals Tweakable Blockciphers for Efficient Authenticated Encryptions with Beyond the Birthday-Bound Security

2017 ◽  
pp. 1-26 ◽  
Author(s):  
Yusuke Naito
Keyword(s):  
Modular Design ◽  
Data Block ◽  
Authenticated Encryption ◽  
Pseudorandom Permutation ◽  
Beyond Birthday Bound ◽  
Tweakable Blockciphers ◽  
Associated Data

Modular design via a tweakable blockcipher (TBC) offers efficient authenticated encryption (AE) schemes (with associated data) that call a blockcipher once for each data block (of associated data or a plaintext). However, the existing efficient blockcipher-based TBCs are secure up to the birthday bound, where the underlying keyed blockcipher is a secure strong pseudorandom permutation. Existing blockcipher-based AE schemes with beyond-birthday-bound (BBB) security are not efficient, that is, a blockcipher is called twice or more for each data block. In this paper, we present a TBC, XKX, that offers efficient blockcipher-based AE schemes with BBB security, by combining with efficient TBC-based AE schemes such as ΘCB3 and

scholarly journals Double-block Hash-then-Sum: A Paradigm for Constructing BBB Secure PRF

2018 ◽  
pp. 36-92 ◽  
Author(s):  
Nilanjan Datta ◽  
Avijit Dutta ◽  
Mridul Nandi ◽  
Goutam Paul
Keyword(s):  
Hash Function ◽  
Random Function ◽  
Design Principle ◽  
Block Cipher ◽  
Security Requirements ◽  
Design Paradigm ◽  
Beyond Birthday Bound ◽  
Generic Design

SUM-ECBC (Yasuda, CT-RSA 2010) is the first beyond birthday bound (BBB) secure block cipher based deterministic MAC. After this work, some more BBB secure deterministic MACs have been proposed, namely PMAC_Plus (Yasuda, CRYPTO 2011), 3kf9 (Zhang et al., ASIACRYPT 2012) and LightMAC_Plus (Naito, ASIACRYPT 2017). In this paper, we have abstracted out the inherent design principle of all these BBB secure MACs and present a generic design paradigm to construct a BBB secure pseudo random function, namely Double-block Hash-then- Sum or in short (DbHtS). A DbHtS construction, as the name implies, computes a double block hash on the message and then sum the encrypted output of the two hash blocks. Our result renders that if the underlying hash function meets certain security requirements (namely cover-free and block-wise universal advantage is low), DbHtS construction provides 2n/3-bit security. We demonstrate the applicability of our result by instantiating all the existing beyond birthday secure deterministic MACs (e.g., SUM-ECBC, PMAC_Plus, 3kf9, LightMAC_Plus) as well as a simple two-keyed variant for each of them and some algebraic hash based constructions.

scholarly journals CTET+: A Beyond-Birthday-Bound Secure Tweakable Enciphering Scheme Using a Single Pseudorandom Permutation

2021 ◽  
pp. 1-35
Author(s):  
Benoît Cogliati ◽  
Jordan Ethan ◽  
Virginie Lallemand ◽  
Byeonghak Lee ◽  
Jooyoung Lee ◽  
...  
Keyword(s):  
Block Cipher ◽  
Random Permutation ◽  
Pseudorandom Permutation ◽  
Linear Layer ◽  
Non Linear ◽  
Single Block ◽  
Permutation Model ◽  
Beyond Birthday Bound ◽  
Disk Encryption ◽  
Block Sizes

In this work, we propose a construction of 2-round tweakable substitutionpermutation networks using a single secret S-box. This construction is based on non-linear permutation layers using independent round keys, and achieves security beyond the birthday bound in the random permutation model. When instantiated with an n-bit block cipher with ωn-bit keys, the resulting tweakable block cipher, dubbed CTET+, can be viewed as a tweakable enciphering scheme that encrypts ωκ-bit messages for any integer ω ≥ 2 using 5n + κ-bit keys and n-bit tweaks, providing 2n/3-bit security.Compared to the 2-round non-linear SPN analyzed in [CDK+18], we both minimize it by requiring a single permutation, and weaken the requirements on the middle linear layer, allowing better performance. As a result, CTET+ becomes the first tweakable enciphering scheme that provides beyond-birthday-bound security using a single permutation, while its efficiency is still comparable to existing schemes including AES-XTS, EME, XCB and TET. Furthermore, we propose a new tweakable enciphering scheme, dubbed AES6-CTET+, which is an actual instantiation of CTET+ using a reduced round AES block cipher as the underlying secret S-box. Extensivecryptanalysis of this algorithm allows us to claim 127 bits of security.Such tweakable enciphering schemes with huge block sizes become desirable in the context of disk encryption, since processing a whole sector as a single block significantly worsens the granularity for attackers when compared to, for example, AES-XTS, which treats every 16-byte block on the disk independently. Besides, as a huge amount of data is being stored and encrypted at rest under many different keys in clouds, beyond-birthday-bound security will most likely become necessary in the short term.

POEx: A beyond-birthday-bound-secure on-line cipher

2017 ◽  
Vol 10 (1) ◽  
pp. 177-193 ◽  
Author(s):  
Christian Forler ◽  
Eik List ◽  
Stefan Lucks ◽  
Jakob Wenzel
Keyword(s):  
On Line ◽  
Beyond Birthday Bound
Sign in / Sign up

Export Citation Format

Share Document