Keying Hash Functions for Message Authentication
From MaRDI portal
Publication:3452335
DOI10.1007/3-540-68697-5_1zbMath1329.94051WikidataQ56675194 ScholiaQ56675194MaRDI QIDQ3452335
Hugo Krawczyk, Ran Canetti, Mihir Bellare
Publication date: 11 November 2015
Published in: Advances in Cryptology — CRYPTO ’96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-68697-5_1
Related Items
Related-key attacks on the compression function of Streebog, Keyed Streebog is a secure PRF and MAC, Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA, Let attackers program ideal models: modularity and composability for adaptive compromise, Non-adaptive Group-Testing Aggregate MAC Scheme, Key-reduced variants of 3Kf9 with beyond-birthday-bound security, When messages are keys: is HMAC a dual-PRF?, Universal hashing based on field multiplication and (near-)MDS matrices, On the security of keyed hashing based on public permutations, MMH: Software message authentication in the Gbit/second rates, Reinventing the travois: Encryption/MAC in 30 ROM bytes, New Bounds for Keyed Sponges with Extendable Output: Independence Between Capacity and Message Length, Modeling Random Oracles Under Unpredictable Queries, Pseudorandom Functions: Three Decades Later, Symmetric Authentication within a Simulatable Cryptographic Library, Strong Authenticity with Leakage Under Weak and Falsifiable Physical Assumptions, Many a Mickle Makes a Muckle: A Framework for Provably Quantum-Secure Hybrid Key Exchange, A Public Key Cryptosystem Using Hiil's Cipher, Cryptography and cryptographic protocols, Analysis of Multivariate Hash Functions, On Efficient Message Authentication Via Block Cipher Design Techniques, Multi-property Preserving Combiners for Hash Functions, Multilane HMAC— Security beyond the Birthday Limit, Extended Multi-Property-Preserving and ECM-Construction, An Update on the Side Channel Cryptanalysis of MACs Based on Cryptographic Hash Functions, A New Mode of Operation for Block Ciphers and Length-Preserving MACs, New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5, Security of NMAC and HMAC Based on Non-malleability, Universally Composable Security Analysis of TLS, The security of the cipher block chaining message authentication code, Broadcast authentication for group communication, Session resumption protocols and efficient forward security for TLS 1.3 0-RTT, Economically Optimal Variable Tag Length Message Authentication, A Public-Key Encryption Scheme with Pseudo-random Ciphertexts, Key Derivation Algorithms for Monotone Access Structures in Cryptographic File Systems, Security Notions for Disk Encryption, IQRA: Incremental Quadratic Re-keying friendly Authentication scheme, Arbitrated unconditionally secure authentication scheme with multi-senders, CBCR: CBC MAC with rotating transformations, Efficient arbitrated quantum signature and its proof of security, On optimal cryptographic key derivation, A simple variant of the Merkle-Damgård scheme with a permutation, Provably-secure time-bound hierarchical key assignment schemes, Sequential aggregate signatures with lazy verification from trapdoor permutations, Robust multi-property combiners for hash functions, A symmetric cryptographic scheme for data integrity verification in cloud databases, Unintended features of APIs: cryptanalysis of incremental HMAC, FORSAKES: a forward-secure authenticated key exchange protocol based on symmetric key-evolving schemes, New proofs for NMAC and HMAC: security without collision resistance, Authenticated encryption: relations among notions and analysis of the generic composition paradigm, Improved generic attacks against hash-based MACs and HAIFA, Message authentication based on cryptographically secure CRC without polynomial irreducibility test, Robust encryption, Security analysis of randomize-hash-then-sign digital signatures, A cryptographic analysis of the TLS 1.3 handshake protocol, Efficient dissection of bicomposite problems with cryptanalytic applications, Secure communication channel establishment: TLS 1.3 (over TCP Fast Open) versus QUIC, On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments, Tight security bounds for double-block hash-then-sum MACs, Analysing the HPKE standard, Group signatures with user-controlled and sequential linkability, Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions, New records of pre-image search of reduced SHA-1 using SAT solvers, Handling adaptive compromise for practical encryption schemes, KEMTLS with delayed forward identity protection in (almost) a single round trip, Revocable hierarchical identity-based authenticated key exchange, Collision-resistant and pseudorandom function based on Merkle-Damgård hash function, Key-homomorphic pseudorandom functions from LWE with small modulus, On tight quantum security of HMAC and NMAC in the quantum random oracle model, Provable security analysis of FIDO2, Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting, Clairvoyant state machine replication, Partition oracles from weak key forgeries, Incremental cryptography revisited: PRFs, nonces and modular design, CCA secure \textit{a posteriori} openable encryption in the standard model, Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions, Efficient schemes for committing authenticated encryption, LESPP: lightweight and efficient strong privacy preserving authentication scheme for secure VANET communication, Hardware security without secure hardware: how to decrypt with a password and a server, Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security, Public-key generation with verifiable randomness, Improved security analysis for nonce-based enhanced hash-then-mask MACs, How to Incorporate Associated Data in Sponge-Based Authenticated Encryption, One-Key Compression Function Based MAC with Security Beyond Birthday Bound, EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC, Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions, Another Look at Tightness, Impossible Differential Properties of Reduced Round Streebog, Concealment and Its Applications to Authenticated Encryption, Collisions of MMO-MD5 and Their Impact on Original MD5, The NIST SHA-3 Competition: A Perspective on the Final Year, Cryptographic Verification by Typing for a Sample Protocol Implementation, Universally Composable Private Proximity Testing, XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions, Generalizing PMAC Under Weaker Assumptions, On Fast and Provably Secure Message Authentication Based on Universal Hashing, Generic Constructions of Stateful Public Key Encryption and Their Applications, A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier, Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms, Slide Attacks on a Class of Hash Functions, Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography, An Integrated ECC-MAC Based on RS Code, On Randomizing Hash Functions to Strengthen the Security of Digital Signatures, Cryptanalysis on HMAC/NMAC-MD5 and MD5-MAC, Distinguishing Attack on the Secret-Prefix MAC Based on the 39-Step SHA-256, Second Preimage Attack on 5-Pass HAVAL and Partial Key-Recovery Attack on HMAC/NMAC-5-Pass HAVAL, Cryptanalysis of Vortex, A Scheme to Base a Hash Function on a Block Cipher
