Multi-user security of the sum of truncated random permutations

DOI10.1007/978-3-031-22966-4_23zbMATH Open1519.94090OpenAlexW4320154873MaRDI QIDQ6132432FDOQ6132432

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

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

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)

Cites Work

• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Title not available (Why is that?)
• Analysis of the single-permutation encrypted Davies-Meyer construction
• Toward a fully secure authenticated encryption scheme from a pseudorandom permutation
• Multi-key Security: The Even-Mansour Construction Revisited
• Title not available (Why is that?)
• On the XOR of Multiple Random Permutations
• The Multi-user Security of Double Encryption
• Distance between sampling with and without replacement
• Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
• Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• Optimally Secure Block Ciphers from Ideal Primitives
• 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
• How many queries are needed to distinguish a truncated random permutation from a random function?
• The Indistinguishability of the XOR of $$k$$ Permutations
• The sum of PRPs is a secure PRF
• Title not available (Why is that?)
• 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
• Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
• How to build pseudorandom functions from public random permutations
• Linking Stam's bounds with generalized truncation
• Beyond birthday bound secure MAC in faulty nonce model
• The summation-truncation hybrid: reusing discarded bits for free
• Indifferentiability of truncated random permutations
• Luby-Rackoff backwards with more users and more security

Cited In (3)

• Luby-Rackoff backwards with more users and more security
• Improved multi-user security using the squared-ratio method
• 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)