scientific article; zbMATH DE number 1406792
From MaRDI portal
Publication:4940708
zbMath0939.94554MaRDI QIDQ4940708
Mihir Bellare, Joe Kilian, Phillip Rogaway
Publication date: 1 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On tight quantum security of HMAC and NMAC in the quantum random oracle model, PMAC with Parity: Minimizing the Query-Length Influence, On modes of operations of a block cipher for authentication and authenticated encryption, On Fast and Provably Secure Message Authentication Based on Universal Hashing, CBCR: CBC MAC with rotating transformations, On-line ciphers and the Hash-CBC constructions, Authenticated Encryption Mode for Beyond the Birthday Bound Security, TrCBC: another look at CBC-MAC, Multi-user security of the sum of truncated random permutations, Towards tight security bounds for \textsf{OMAC, XCBC} and \textsf{TMAC}, Improved multi-user security using the squared-ratio method, Message authentication based on cryptographically secure CRC without polynomial irreducibility test, Fine-tuning the ISO/IEC standard \textsf{LightMAC}, On the Unprovable Security of 2-Key XCBC, Security of message authentication codes in the presence of key-dependent messages, Improved truncated differential distinguishers of AES with concrete S-box, Universal hashing based on field multiplication and (near-)MDS matrices, On the security of keyed hashing based on public permutations, Revisiting the indifferentiability of the sum of permutations, Multi-verifier signatures, A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier, MMH: Software message authentication in the Gbit/second rates, Fast message authentication using efficient polynomial evaluation, ON THE SECURITY OF AEAD-CRYPTOSYSTEM OF THE GCM TYPE, A MAC Mode for Lightweight Block Ciphers, On the optimality of non-linear computations for symmetric key primitives, The security of the cipher block chaining message authentication code, Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms, On the XOR of Multiple Random Permutations, A Generic Method to Design Modes of Operation Beyond the Birthday Bound, A New Mode of Operation for Block Ciphers and Length-Preserving MACs, How much data may be safely processed on one key in different modes?, One-Key Compression Function Based MAC with Security Beyond Birthday Bound, PolyE+CTR: A Swiss-Army-Knife Mode for Block Ciphers, The summation-truncation hybrid: reusing discarded bits for free, Pseudorandom Functions: Three Decades Later
