Luby-Rackoff backwards with more users and more security

DOI10.1007/978-3-030-92078-4_12MaRDI QIDQ6157554zbMATH OpenOpenAlexFDO

Authors Srimanta Bhattacharya, Mridul Nandi

Publication date 12 May 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-92078-4_12

zbMATH Keywords

\(\chi^2\) methodmulti-user securityPRF securityrandom permutationXOR construction

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cryptography (94A60)

Recommendations

• Multi-user security of the sum of truncated random permutations
• On the XOR of multiple random permutations
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• Generic attacks for the Xor of k random permutations
• XOR of PRPs in a quantum world

Cites work

• A new variant of PMAC: beyond the birthday bound
• A note on the chi-square method: a tool for proving cryptographic security
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• scientific article; zbMATH DE number 5009203 (Why is no real title available?)
• 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 1418300 (Why is no real title available?)
• Indifferentiability of truncated random permutations
• Information-theoretic indistinguishability via the chi-squared method
• Linking Stam's bounds with generalized truncation
• Multi-key security: the Even-Mansour construction revisited
• New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
• On the XOR of multiple random permutations
• Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
• The indistinguishability of the XOR of k permutations
• The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
• The Multi-user Security of Double Encryption
• The sum of PRPs is a secure PRF
• The summation-truncation hybrid: reusing discarded bits for free
• Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model
• ZMAC: a fast tweakable block cipher mode for highly secure message authentication

Cited in

(6)

• Multi-user security bound for filter permutators in the random oracle model
• Multi-user security of the sum of truncated random permutations
• Improved multi-user security using the squared-ratio method
• A sponge-based PRF with good multi-user security
• Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
• Combining outputs of a random permutation: new constructions and tight security bounds by Fourier analysis

This page was built for publication: Luby-Rackoff backwards with more users and more security

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