Message authentication, revisited
From MaRDI portal
Recommendations
Cited in
(40)- Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system
- Message franking via committing authenticated encryption
- Efficient authentication from hard learning problems
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
- Authentication in the bounded storage model
- Solving LPN using covering codes
- From non-adaptive to adaptive pseudorandom functions
- Two-round man-in-the-middle security from LPN
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Cryptography from learning parity with noise
- Key-indistinguishable message authentication codes
- Secure message authentication against related-key attack
- \(\mathcal{E}\)-MACs: towards more secure and more efficient constructions of secure channels
- Leakage-resilient cryptography from minimal assumptions
- Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol
- scientific article; zbMATH DE number 5525643 (Why is no real title available?)
- Security of message authentication codes in the presence of key-dependent messages
- MMH: Software message authentication in the Gbit/second rates
- Robust encryption, revisited
- Round-efficient anonymous password-authenticated key exchange protocol in the standard model
- Strong authenticity with leakage under weak and falsifiable physical assumptions
- Hierarchical identity-based encryption with tight multi-challenge security
- Efficient message authentication codes with combinatorial group testing
- EHE: NONCE MISUSE-RESISTANT MESSAGE AUTHENTICATION
- Group key establishment in a quantum-future scenario
- Progress in Cryptology - INDOCRYPT 2003
- Unilaterally-authenticated key exchange
- Topics in Cryptology – CT-RSA 2006
- Topics in Cryptology – CT-RSA 2006
- Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs
- A lower bound on the length of signatures based on group actions and generic isogenies
- Almost tight multi-user security under adaptive corruptions \& leakages in the standard model
- Privacy-preserving authenticated key exchange in the standard model
- An iterative correction method for practically LPN solving
- The Legendre pseudorandom function as a multivariate quadratic cryptosystem: security and applications
- Round-optimal authenticated key exchange with full forward privacy
- Keyed-verification anonymous credentials with highly efficient partial disclosure
- Post-quantum provably-secure authentication and MAC from Mersenne primes
This page was built for publication: Message authentication, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894418)
