Keying hash functions for message authentication
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- scientific article; zbMATH DE number 1676651 (Why is no real title available?)
- 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
- Breaking and repairing an approximate message authentication scheme
- Arbitrated unconditionally secure authentication scheme with multi-senders
- 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
- Delayed-key message authentication for streams
- On fast and provably secure message authentication based on universal hashing
- Generic Constructions of Stateful Public Key Encryption and Their Applications
- CBCR: CBC MAC with rotating transformations
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
- Efficient arbitrated quantum signature and its proof of security
- 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
- “Sandwich” Is Indeed Secure: How to Authenticate a Message with Just One Hashing
- 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
- scientific article; zbMATH DE number 1186882 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 2077191 (Why is no real title available?)
- scientific article; zbMATH DE number 1504778 (Why is no real title available?)
- 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
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Sequential aggregate signatures with lazy verification from trapdoor permutations
- Pseudorandom functions: three decades later
- Symmetric authentication within a simulatable cryptographic library
- A new authentication procedure for client-server applications using HMAC
- 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
- Keyed hash functions
- Analysis of Multivariate Hash Functions
- Boosting Merkle-Damgård Hashing for Message Authentication
- 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
- Efficient Shared-Key Authentication Scheme from Any Weak Pseudorandom Function
- 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
- Landau-Ramanujan keyed hash functions for message authentication
- Universally Composable Security Analysis of TLS
- Economically optimal variable tag length message authentication
This page was built for publication: Keying hash functions for message authentication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452335)
