XOR MACs: New methods for message authentication using finite pseudorandom functions

DOI10.1007/3-540-44750-4_2MaRDI QIDQ4343418zbMATH OpenFDO

Authors M. Bellare, Roch Guérin, Phillip Rogaway

Publication date 23 November 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44750-4_2

zbMATH Keywords

finite pseudorandom functionmessage authenticationXOR MACs

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Cryptography (94A60)

Recommendations

• Improving the Security of MACs Via Randomized Message Preprocessing
• From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs. (Extended abstract)
• On the security of the ``Free-XOR technique
• Improved algebraic MACs and practical keyed-verification anonymous credentials
• Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations
• Symmetric-key corruption detection: when XOR-MACs meet combinatorial group testing
• On the security of two MAC algorithms
• On the adaptive security of MACs and PRFs

Cited in

(34)

• \textsc{Merge}MAC: a MAC for authentication with strict time constraints and limited bandwidth
• Message authentication based on cryptographically secure CRC without polynomial irreducibility test
• Analysis and improvement of an authentication scheme in incremental cryptography
• The summation-truncation hybrid: reusing discarded bits for free
• Incremental cryptography revisited: PRFs, nonces and modular design
• Symmetric-key corruption detection: when XOR-MACs meet combinatorial group testing
• Secure storage -- confidentiality and authentication
• Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic
• PMAC with parity: minimizing the query-length influence
• Message authentication, revisited
• Arbitrated unconditionally secure authentication scheme with multi-senders
• Revisiting full-PRF-secure PMAC and using it for beyond-birthday authenticated encryption
• Generalizing PMAC under weaker assumptions
• On fast and provably secure message authentication based on universal hashing
• Authenticated Encryption Mode for Beyond the Birthday Bound Security
• A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
• From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs. (Extended abstract)
• A MAC mode for lightweight block ciphers
• UMAC: Fast and secure message authentication
• Constructing VIL-MACs from FIL-MACs: Message authentication under weakened assumptions
• Stateless evaluation of pseudorandom functions: Security beyond the birthday barrier
• Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
• Boosting Merkle-Damgård Hashing for Message Authentication
• Advances in Cryptology - CRYPTO 2003
• Multilane HMAC— Security beyond the Birthday Limit
• Limits of the cryptographic realization of Dolev-Yao-style XOR
• IQRA: Incremental Quadratic Re-keying friendly Authentication scheme
• The security of the cipher block chaining message authentication code
• Improved multi-user security using the squared-ratio method
• Quantum linearization attacks
• Fine-tuning the ISO/IEC standard \textsf{LightMAC}
• \textsf{LightMAC}: fork it and make it faster
• A quantum-secure partial parallel MAC QPCBC
• A long tweak goes a long way: high multi-user security authenticated encryption from tweakable block ciphers

This page was built for publication: XOR MACs: New methods for message authentication using finite pseudorandom functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4343418)