Revisiting the indifferentiability of the sum of permutations

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

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

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

zbMATH Keywords

attacksindifferentiabilityresolutionssum of permutations

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Information-theoretic indistinguishability via the chi-squared method
• On the XOR of Multiple Random Permutations
• On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction
• 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?
• Building a Collision-Resistant Compression Function from Non-compressing Primitives
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Domain Extension of Public Random Functions: Beyond the Birthday Barrier
• Salvaging Merkle-Damgård for Practical Applications
• Indifferentiability of the Sum of Random Permutations Toward Optimal Security
• Merkle-Damgård Revisited: How to Construct a Hash Function
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• Leaky Random Oracle (Extended Abstract)
• Theory of Cryptography
• Block-cipher-based tree hashing

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