RIV for robust authenticated encryption
From MaRDI portal
Recommendations
Cites work
- A domain extender for the ideal cipher
- A modular framework for building variable-input-length tweakable ciphers
- A New Algorithm for Inner Product
- A Provable-Security Treatment of the Key-Wrap Problem
- Badger – A Fast and Provably Secure MAC
- BTM: a single-key, inverse-cipher-free mode for deterministic authenticated encryption
- Constructive cryptography -- a new paradigm for security definitions and proofs
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm
- Fast Software Encryption
- Fast Software Encryption
- Faster Luby-Rackoff ciphers
- HBS: A Single-Key Mode of Operation for Deterministic Authenticated Encryption
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- How to securely release unverified plaintext in authenticated encryption
- scientific article; zbMATH DE number 1583788 (Why is no real title available?)
- scientific article; zbMATH DE number 1583804 (Why is no real title available?)
- scientific article; zbMATH DE number 1406775 (Why is no real title available?)
- scientific article; zbMATH DE number 1418297 (Why is no real title available?)
- Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
- Information Security and Cryptology
- McOE: a family of almost foolproof on-line authenticated encryption schemes
- Message Authentication on 64-Bit Architectures
- Misuse-resistant variants of the OMD authenticated encryption mode
- On modes of operations of a block cipher for authentication and authenticated encryption
- On symmetric encryption with distinguishable decryption failures
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance
- Pipelineable on-line encryption
- Reconsidering generic composition
- Robust authenticated encryption and the limits of symmetric cryptography
- Robust authenticated-encryption AEZ and the problem that it solves
- Rogue Decryption Failures: Reconciling AE Robustness Notions
- The computational complexity of universal hashing
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2004
- Two practical and provably secure block ciphers: BEAR and LION
- Universal hashing and authentication codes
- Weak-key and related-key analysis of hash-counter-hash tweakable enciphering schemes
Cited in
(16)- Boosting authenticated encryption robustness with minimal modifications
- Reconsidering generic composition: the tag-then-encrypt case
- Reforgeability of authenticated encryption schemes
- Robust authenticated-encryption AEZ and the problem that it solves
- Authenticated encryption with variable stretch
- Rogue Decryption Failures: Reconciling AE Robustness Notions
- Robust authenticated encryption and the limits of symmetric cryptography
- A Provable-Security Treatment of the Key-Wrap Problem
- Jammin' on the deck
- Overloading the nonce: rugged PRPs, nonce-set AEAD, and order-resilient channels
- Implicit key-stretching security of encryption schemes
- KIVR: committing authenticated encryption using redundancy and application to GCM, CCM, and more
- Populating the zoo of rugged pseudorandom permutations
- Comprehensive robustness analysis of GCM, CCM, and OCB3
- CCA security with short AEAD tags
- Universal forgery attack against GCM-RUP
This page was built for publication: RIV for robust authenticated encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639469)
