Results 141 to 150 of about 4,552,363 (166)
Some of the next articles are maybe not open access.
Revisiting the Security of DbHtS MACs: Beyond-Birthday-Bound in the Multi-user Setting
Lecture Notes in Computer Science, 2021Double-block Hash-then-Sum (DbHtS) MACs are a class of MACs that aim for achieving beyond-birthday-bound security, including SUM-ECBC, PMAC_Plus, 3kf9 and LightMAC_Plus. Recently Datta et al. (FSE’19), and then Kim et al. (Eurocrypt’20) prove that DbHtS constructions are secure beyond the birthday bound in the single-user setting. However, by a generic
Dawu Gu, Jian Weng
exaly +2 more sources
Authenticated Encryption Mode for Beyond the Birthday Bound Security
2008In this paper, we propose an authenticated encryption mode for blockciphers. Our authenticated encryption mode, CIP, has provable security bounds which are better than the usual birthday bound security. Besides, the proven security bound for authenticity of CIP is better than any of the previously known schemes.
Tetsu Iwata
exaly +2 more sources
Parallelizable MACs Based on the Sum of PRPs with Security Beyond the Birthday Bound
Lecture Notes in Computer Science, 2019The combination of universal hashing and encryption is a fundamental paradigm for the construction of symmetric-key MACs, dating back to the seminal works by Wegman and Carter, Shoup, and Bernstein. While fully sufficient for many practical applications, the Wegman-Carter construction, however, is well-known to break if nonces are ever repeated, and ...
Eik List
exaly +4 more sources
Beyond-Birthday-Bound Security with HCTR2: Cascaded Construction and Tweak-Based Key Derivation
Lecture Notes in Computer ScienceThe block cipher (BC) mode for realizing a variable-input-length strong tweakable pseudorandom permutation (VIL-STPRP), also known as the accordion mode, is a rapidly growing research field driven by NIST\u27s standardization project, which considers AES
Nicky Mouha
exaly +4 more sources
Beyond Birthday Bound Secure MAC in Faulty Nonce Model [PDF]
, 2019 Encrypt-then-MAC (EtM) is a popular mode for authenticated encryption (AE). Unfortunately, almost all designs following the EtM paradigm, including the AE suites for TLS, are vulnerable against nonce misuse. A single repetition of the nonce value reveals the hash key, leading to a universal forgery attack.
Avijit Dutta +2 more
core +4 more sources
Tweakable Block Ciphers Secure Beyond the Birthday Bound in the Ideal Cipher Model
Lecture Notes in Computer Science, 2018We propose a new construction of tweakable block ciphers from standard block ciphers. Our construction, dubbed \(\mathsf {XHX2}\), is the cascade of two independent \(\mathsf {XHX}\) block ciphers, so it makes two calls to the underlying block cipher using tweak-dependent keys.
Jooyoung Lee
exaly +3 more sources
Key-Reduced Variants of 3kf9 with Beyond-Birthday-Bound Security [PDF]
, 2022 3kf9 is a three-key CBC-type MAC that enhances the standardized integrity algorithm f9 (3GPP-MAC). It has beyond-birthday-bound security and is expected to be a possible candidate in constrained environments when instantiated with lightweight ...
Yaobin Shen, Ferdinand Sibleyras
core +5 more sources
On the Security of Blockwise Secure Modes of Operation Beyond the Birthday Bound
IEEE Transactions on Information Theory, 2010Antoine Joux
exaly +3 more sources
Generic Attacks Against Beyond-Birthday-Bound MACs [PDF]
Lecture Notes in Computer Science, 2018 In this work, we study the security of several recent MAC constructions with provable security beyond the birthday bound. We consider block-cipher based constructions with a double-block internal state, such as SUM-ECBC, PMAC+, 3kf9, GCM-SIV2, and some ...
Gaëtan Leurent, Mridul Nandi
exaly +1 more source
POEx: A beyond-birthday-bound-secure on-line cipher
Cryptography and Communications, 2017On-line ciphers are convenient building blocks for realizing efficient single- pass encryption. In particular, the trend to limit the consequences of nonce reuses rendered them popular in recent authenticated encryption schemes. While encryption schemes, such as POE, COPE, or the ciphers within ElmE/ElmD concentrated on efficiency, their security ...
Christian Forler +3 more
openaire +2 more sources