scientific article; zbMATH DE number 1406792
From MaRDI portal
zbMATH Open0939.94554MaRDI QIDQ4940708FDOQ4940708
Authors: M. Bellare, Joe Kilian, Phillip Rogaway 
Publication date: 1 March 2000
Title of this publication is not available (Why is that?)
Recommendations
Cited In (55)
- Information-theoretic security with asymmetries
- One-key compression function based MAC with security beyond birthday bound
- Information Security and Privacy
- Fast message authentication using efficient polynomial evaluation
- Multi-verifier signatures
- 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
- TrCBC: another look at CBC-MAC
- Towards Understanding the Known-Key Security of Block Ciphers
- Security of message authentication codes in the presence of key-dependent messages
- Authenticated Encryption Mode for Beyond the Birthday Bound Security
- On modes of operations of a block cipher for authentication and authenticated encryption
- On the optimality of non-linear computations for symmetric key primitives
- On-line ciphers and the Hash-CBC constructions
- Decorrelation over infinite domains: The encrypted CBC-MAC case
- Improved truncated differential distinguishers of AES with concrete S-box
- Fast and Secure CBC-Type MAC Algorithms
- Security of Sequential Multiple Encryption
- The security of the cipher block chaining message authentication code
- Legal messages for some message authentication functions in block ciphers
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs
- On fast and provably secure message authentication based on universal hashing
- Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
- Title not available (Why is that?)
- On the Unprovable Security of 2-Key XCBC
- The Security of Ciphertext Stealing
- On the security of keyed hashing based on public permutations
- Universal hashing based on field multiplication and (near-)MDS matrices
- Revisiting the indifferentiability of the sum of permutations
- MMH: Software message authentication in the Gbit/second rates
- Multimixer-156: universal keyed hashing based on integer multiplication and cyclic shift
- Pseudorandom functions: three decades later
- On tight quantum security of HMAC and NMAC in the quantum random oracle model
- A MAC mode for lightweight block ciphers
- Title not available (Why is that?)
- Anamorphic encryption, revisited
- The multi-user security of MACs via universal hashing in the ideal cipher model
- A Simple and Unified Method of Proving Indistinguishability
- On the XOR of multiple random permutations
- CBCR: CBC MAC with rotating transformations
- How much data may be safely processed on one key in different modes?
- Cascade Encryption Revisited
- The DBlock family of block ciphers
- Towards tight security bounds for \textsf{OMAC, XCBC} and \textsf{TMAC}
- CBC MACs for arbitrary-length messages: The three-key constructions
- Message authentication based on cryptographically secure CRC without polynomial irreducibility test
- On the security of AEAD-cryptosystem of the GCM type
- A Generic Method to Design Modes of Operation Beyond the Birthday Bound
- Polye+CTR: a swiss-army-knife mode for block ciphers
- Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis
- The summation-truncation hybrid: reusing discarded bits for free
- The sum of CBC MACs is a secure PRF
- Multi-user security of the sum of truncated random permutations
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 Q4940708)
