Improved multi-user security using the squared-ratio method
From MaRDI portal
Recommendations
- Luby-Rackoff backwards with more users and more security
- The Multi-user Security of Double Encryption
- Information-theoretic security with asymmetries
- Information-theoretic indistinguishability via the chi-squared method
- The exact multi-user security of (tweakable) key alternating ciphers with a single permutation
Cites work
- A modular approach to the security analysis of two-permutation constructions
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Beyond birthday bound secure MAC in faulty nonce model
- Categorization of faulty nonce misuse resistant message authentication
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
- How to stretch random functions: The security of protected counter sums
- How to Thwart Birthday Attacks against MACs via Small Randomness
- scientific article; zbMATH DE number 1302860 (Why is no real title available?)
- scientific article; zbMATH DE number 1303128 (Why is no real title available?)
- scientific article; zbMATH DE number 1030978 (Why is no real title available?)
- scientific article; zbMATH DE number 1406792 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Improved security analysis for nonce-based enhanced hash-then-mask MACs
- Information-theoretic indistinguishability via the chi-squared method
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Luby-Rackoff backwards with more users and more security
- Mirror theory and cryptography
- Multi-key security: the Even-Mansour construction revisited
- Multi-user security of the sum of truncated random permutations
- Optimally secure block ciphers from ideal primitives
- Proof of Mirror Theory for ξ max = 2
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
- The indistinguishability of the XOR of k permutations
- The Multi-user Security of Double Encryption
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- The sum of PRPs is a secure PRF
- The “Coefficients H” Technique
- Tight security bounds for double-block hash-then-sum MACs
- Tight security of cascaded LRW2
- Toward a fully secure authenticated encryption scheme from a pseudorandom permutation
Cited in
(3)
This page was built for publication: Improved multi-user security using the squared-ratio method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6145930)