Improved multi-user security using the squared-ratio method
From MaRDI portal
Publication:6145930
DOI10.1007/978-3-031-38545-2_23OpenAlexW4385654205MaRDI QIDQ6145930
Wonseok Choi, Changmin Lee, Yu Long Chen
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38545-2_23
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to stretch random functions: The security of protected counter sums
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- Information-theoretic indistinguishability via the chi-squared method
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- Mirror theory and cryptography
- How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
- Tight security bounds for double-block hash-then-sum MACs
- Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
- Tight security of cascaded LRW2
- Beyond birthday bound secure MAC in faulty nonce model
- Improved security analysis for nonce-based enhanced hash-then-mask MACs
- Optimally Secure Block Ciphers from Ideal Primitives
- Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- The Indistinguishability of the XOR of $$k$$ Permutations
- Multi-key Security: The Even-Mansour Construction Revisited
- How to Thwart Birthday Attacks against MACs via Small Randomness
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- The “Coefficients H” Technique
- Proof of Mirror Theory for ξ max = 2
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- The Multi-user Security of Double Encryption
- Multi-user security of the sum of truncated random permutations
- A modular approach to the security analysis of two-permutation constructions
- Luby-Rackoff backwards with more users and more security
- Toward a fully secure authenticated encryption scheme from a pseudorandom permutation
- Categorization of faulty nonce misuse resistant message authentication
This page was built for publication: Improved multi-user security using the squared-ratio method
