scientific article; zbMATH DE number 1030978
From MaRDI portal
Publication:4343418
zbMATH Open0876.94020MaRDI QIDQ4343418FDOQ4343418
Authors: M. Bellare, Roch Guérin, Phillip Rogaway
Publication date: 23 November 1997
Title of this publication is not available (Why is that?)
Recommendations
- Improving the Security of MACs Via Randomized Message Preprocessing
- scientific article; zbMATH DE number 1302852
- 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 (32)
- Analysis and improvement of an authentication scheme in incremental cryptography
- Fine-tuning the ISO/IEC standard \textsf{LightMAC}
- Improved multi-user security using the squared-ratio method
- PMAC with parity: minimizing the query-length influence
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
- \textsf{LightMAC}: fork it and make it faster
- Revisiting full-PRF-secure PMAC and using it for beyond-birthday authenticated encryption
- Title not available (Why is that?)
- Authenticated Encryption Mode for Beyond the Birthday Bound Security
- Quantum linearization attacks
- IQRA: Incremental Quadratic Re-keying friendly Authentication scheme
- Arbitrated unconditionally secure authentication scheme with multi-senders
- The security of the cipher block chaining message authentication code
- Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
- On fast and provably secure message authentication based on universal hashing
- \textsc{Merge}MAC: a MAC for authentication with strict time constraints and limited bandwidth
- Title not available (Why is that?)
- Generalizing PMAC under weaker assumptions
- A MAC mode for lightweight block ciphers
- Symmetric-key corruption detection: when XOR-MACs meet combinatorial group testing
- Advances in Cryptology - CRYPTO 2003
- Secure storage -- confidentiality and authentication
- Incremental cryptography revisited: PRFs, nonces and modular design
- Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic
- A quantum-secure partial parallel MAC QPCBC
- Message authentication, revisited
- Boosting Merkle-Damgård Hashing for Message Authentication
- Message authentication based on cryptographically secure CRC without polynomial irreducibility test
- Limits of the cryptographic realization of Dolev-Yao-style XOR
- Multilane HMAC— Security beyond the Birthday Limit
- Title not available (Why is that?)
- The summation-truncation hybrid: reusing discarded bits for free
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4343418)