Results 171 to 180 of about 94,502 (210)
Some of the next articles are maybe not open access.
Beyond Birthday Bound Secure MAC in Faulty Nonce Model
IACR Cryptology ePrint Archive, 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 +2 more sources
One-Key Compression Function Based MAC with Security Beyond Birthday Bound
Australasian Conference on Information Security and Privacy, 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 +2 more sources
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 +3 more sources
Parallelizable MACs Based on the Sum of PRPs with Security Beyond the Birthday Bound
IACR Cryptology ePrint Archive, 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 +2 more sources
Authenticated Encryption Mode for Beyond the Birthday Bound Security
International Conference on Cryptology in Africa, 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
openaire +2 more sources
Tweakable Block Ciphers Secure Beyond the Birthday Bound in the Ideal Cipher Model
IACR Cryptology ePrint Archive, 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 +2 more sources
XOCB: Beyond-Birthday-Bound Secure Authenticated Encryption Mode with Rate-One Computation
IACR Cryptology ePrint Archive, 2023Zhenzhen Bao +5 more
openaire +2 more sources
SCIENTIA SINICA Informationis
In recent years, beyond-birthday-bound (BBB) secure cryptographic primitives have attracted much attention. As an extension of the traditional cryptographic primitive, tweakable cryptographic primitive also plays an important role in cryptographic ...
Ping ZHANG, Yiyuan LUO
openaire +2 more sources
In recent years, beyond-birthday-bound (BBB) secure cryptographic primitives have attracted much attention. As an extension of the traditional cryptographic primitive, tweakable cryptographic primitive also plays an important role in cryptographic ...
Ping ZHANG, Yiyuan LUO
openaire +2 more sources
On the Security of Blockwise Secure Modes of Operation Beyond the Birthday Bound
IEEE Transactions on Information Theory, 2010Antoine Joux
openaire +2 more sources
Dedicated Quantum Attacks on XOR-Type Function With Applications to Beyond-Birthday- Bound MACs
IEEE Transactions on Information Forensics and SecurityA lot of work in the field of quantum cryptanalysis is currently devoted to finding applications of Grover-meets-Simon algorithm and its complexity is given in the form of $\mathcal {O}$ , but research on how to implement the attack efficiently is still
Tairong Shi +6 more
semanticscholar +1 more source