Results 161 to 170 of about 93,608 (187)
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
Yaobin Shen +3 more
openaire +3 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.
openaire +3 more sources
On the Security of Blockwise Secure Modes of Operation Beyond the Birthday Bound
IEEE Transactions on Information Theory, 2010openaire +3 more sources
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 +1 more source
Beyond Birthday Bound Secure MAC in Faulty Nonce Model
2019Encrypt-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
openaire +1 more source
On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers
Cryptography and Communications, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ashwin Jha, Mridul Nandi
openaire +2 more sources
One-Key Compression Function Based MAC with Security Beyond Birthday Bound
2016Gaži et al. [CRYPTO 2014] analyzed the NI-MAC construction proposed by An and Bellare [CRYPTO 1999] and gave a tight birthday-bound of $$O\ell q^{2}/2^{n}$$, as an improvement over the previous bound of $$O\ell ^{2}q^{2}/2^{n}$$. In this paper, we design a simple extension of NI-MAC, called $$\mathrm{NI}^{+}$$-MAC, and prove that it has security bound ...
Avijit Dutta, Mridul Nandi, Goutam Paul
openaire +1 more source
Tweakable Block Ciphers Secure Beyond the Birthday Bound in the Ideal Cipher Model
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.
ByeongHak Lee, Jooyoung Lee
openaire +1 more source
Parallelizable MACs Based on the Sum of PRPs with Security Beyond the Birthday Bound
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 ...
Alexander Moch, Eik List
openaire +1 more source
Efficient beyond-birthday-bound secure authenticated encryption modes
Science China Information Sciences, 2018Ping Zhang, Honggang Hu, Peng Wang
openaire +1 more source