Multi-user security of the sum of truncated random permutations

DOI10.1007/978-3-031-22966-4_23MaRDI QIDQ6132432zbMATH OpenOpenAlexFDO

Authors Wonseok Choi, Hwigyeom Kim, Jooyoung Lee, Yeongmin Lee

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

zbMATH Keywords

pseudorandom functionmulti-user securitytruncated random permutationsum of permutationsLuby-Rackoff backward

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Distributed systems (68M14)

Recommendations

• Luby-Rackoff backwards with more users and more security
• How to build pseudorandom functions from public random permutations
• On the XOR of multiple random permutations
• Indifferentiability of truncated random permutations
• The advantage of truncated permutations

Cites work

• 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 1406792 (Why is no real title available?)
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• Analysis of the single-permutation encrypted Davies-Meyer construction
• Beyond birthday bound secure MAC in faulty nonce model
• Distance between sampling with and without replacement
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
• Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
• How many queries are needed to distinguish a truncated random permutation from a random function?
• How to build pseudorandom functions from public random permutations
• Indifferentiability of the Sum of Random Permutations Toward Optimal Security
• Indifferentiability of truncated random permutations
• Information-theoretic indistinguishability via the chi-squared method
• Key-alternating ciphers and key-length extension: exact bounds and multi-user security
• Linking Stam's bounds with generalized truncation
• Luby-Rackoff backwards with more users and more security
• Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
• Multi-key security: the Even-Mansour construction revisited
• On the XOR of multiple random permutations
• Optimally secure block ciphers from ideal primitives
• Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
• The Multi-user Security of Double Encryption
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The indistinguishability of the XOR of \(k\) permutations
• The sum of PRPs is a secure PRF
• The summation-truncation hybrid: reusing discarded bits for free
• Toward a fully secure authenticated encryption scheme from a pseudorandom permutation

Cited in

(5)

• Luby-Rackoff backwards with more users and more security
• Improved multi-user security using the squared-ratio method
• How many queries are needed to distinguish a truncated random permutation from a random function?
• A sponge-based PRF with good multi-user security
• Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis

This page was built for publication: Multi-user security of the sum of truncated random permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132432)