Multi-user security of the sum of truncated random permutations
From MaRDI portal
Publication:6132432
DOI10.1007/978-3-031-22966-4_23zbMath1519.94090OpenAlexW4320154873MaRDI QIDQ6132432
Hwigyeom Kim, Yeongmin Lee, Jooyoung Lee, Wonseok Choi
Publication date: 16 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22966-4_23
pseudorandom functionmulti-user securitytruncated random permutationsum of permutationsLuby-Rackoff backward
Permutations, words, matrices (05A05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
- 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
- How many queries are needed to distinguish a truncated random permutation from a random function?
- Analysis of the single-permutation encrypted Davies-Meyer construction
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
- The summation-truncation hybrid: reusing discarded bits for free
- How to build pseudorandom functions from public random permutations
- Indifferentiability of truncated random permutations
- Linking Stam's bounds with generalized truncation
- Beyond birthday bound secure MAC in faulty nonce model
- On the XOR of Multiple Random Permutations
- 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
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Distance between sampling with and without replacement
- Indifferentiability of the Sum of Random Permutations Toward Optimal Security
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- The Multi-user Security of Double Encryption
- Luby-Rackoff backwards with more users and more security
- Toward a fully secure authenticated encryption scheme from a pseudorandom permutation