Multi-user BBB security of public permutations based MAC
type: Item
instance of: scholarly article
title: Multi-user BBB security of public permutations based MAC
zbMATH Open document ID: 1499.94037
author: Yu Long Chen
author: Avijit Dutta
author: Mridul Nandi
published in: Cryptography and Communications
publication date: 2022-10-06T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7596975
zbMATH Keywords: faulty nonce
zbMATH Keywords: mirror theory
zbMATH Keywords: public permutation
zbMATH Keywords: expectation method
describes a project that uses: spongent
describes a project that uses: Keccak
MaRDI profile type: Publication
full work available at URL: s12095-022-00571-w
OpenAlex ID: W4280523578
Wikidata QID: Q114849140
cites work: Hash-Function Based PRFs: AMAC and Its Multi-User Security
cites work: Q3374913
cites work: The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3
cites work: Keccak
cites work: How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
cites work: Improved Time-Memory Trade-Offs with Multiple Data
cites work: Q4737258
cites work: SPONGENT: The Design Space of Lightweight Cryptographic Hashing
cites work: Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
cites work: Another Look at Tightness
cites work: How to build pseudorandom functions from public random permutations
cites work: Improved security analysis for nonce-based enhanced hash-then-mask MACs
cites work: EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
cites work: Analysis of the single-permutation encrypted Davies-Meyer construction
cites work: Full-state keyed duplex with built-in multi-user support
cites work: Encrypt or decrypt -- to make a single-key beyond birthday secure nonce-based MAC
cites work: \(\mathsf{DWCDM}_+\): a BBB secure nonce based MAC
cites work: BBB Secure Nonce Based MAC Using Public Permutations
cites work: Beyond birthday bound secure MAC in faulty nonce model
cites work: A construction of a cipher from a single pseudorandom permutation.
cites work: The PHOTON Family of Lightweight Hash Functions
cites work: Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
cites work: The Multi-user Security of Double Encryption
cites work: Analyzing multi-key security degradation
cites work: A MAC Mode for Lightweight Block Ciphers
cites work: How to Thwart Birthday Attacks against MACs via Small Randomness
cites work: Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal
cites work: On the adaptive security of MACs and PRFs
cites work: Multi-key Security: The Even-Mansour Construction Revisited
cites work: Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
cites work: Improved security analysis of PMAC
cites work: The “Coefficients H” Technique
cites work: New hash functions and their use in authentication and set equality
cites work: Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
DOI: 10.1007/S12095-022-00571-W
Recommended article: BBB Secure Nonce Based MAC Using Public Permutations
Recommended article: Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
Recommended article: \(\mathsf{DWCDM}_+\): a BBB secure nonce based MAC
Recommended article: Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations
Recommended article: On the Security of Two MAC Algorithms
Recommended article: Q4413855
Recommended article: Fast and Secure CBC-Type MAC Algorithms
Recommended article: Quantum attacks against BBB secure PRFs or MACs built from public random permutations
Recommended article: Q3046361
Recommended article: Parallelizable MACs based on the sum of PRPs with security beyond the birthday bound
description: scientific article; zbMATH DE number 7596975