Revisiting the indifferentiability of the sum of permutations

DOI10.1007/978-3-031-38548-3_21OpenAlexW4385654477MaRDI QIDQ6186774FDOQ6186774

Authors: Aldo Gunsing, Ritam Bhaumik, Ashwin Jha, Bart Mennink, Yaobin Shen 

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-38548-3_21

Recommendations

• Indifferentiability beyond the birthday bound for the xor of two public random permutations
• On the XOR of multiple random permutations
• Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• Indifferentiability of truncated random permutations

zbMATH Keywords

indifferentiabilityresolutionsattackssum of permutations

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the public indifferentiability and correlation intractability of the 6-round Feistel construction
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Title not available (Why is that?)
• Theory of Cryptography
• Salvaging Merkle-Damgård for Practical Applications
• Title not available (Why is that?)
• Leaky Random Oracle (Extended Abstract)
• Building a Collision-Resistant Compression Function from Non-compressing Primitives
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Domain Extension of Public Random Functions: Beyond the Birthday Barrier
• Title not available (Why is that?)
• On the XOR of multiple random permutations
• Indifferentiability beyond the birthday bound for the xor of two public random permutations
• Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?
• Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
• Information-theoretic indistinguishability via the chi-squared method
• 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
• Block-cipher-based tree hashing

Cited In (2)

• Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
• Indifferentiability of 3-round confusion-diffusion networks

This page was built for publication: Revisiting the indifferentiability of the sum of permutations

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