Proof of mirror theory for a wide range of \(\xi_{\max }\)

DOI10.1007/978-3-031-30634-1_16MaRDI QIDQ6083139

Benoît Cogliati, Jacques Patarin, Mridul Nandi, Abishanka Saha, Avijit Dutta

Publication date: 8 December 2023

Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

zbMATH Keywords

PRPbeyond-birthday-bound securitymirror theoryPRFsystem of affine equations

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Towards tight security of cascaded LRW2
• Encrypt or decrypt -- to make a single-key beyond birthday secure nonce-based MAC
• ZMAC: a fast tweakable block cipher mode for highly secure message authentication
• Information-theoretic indistinguishability via the chi-squared method
• Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
• Blockcipher-based MACs: beyond the birthday bound without message length
• Tight security bounds for double-block hash-then-sum MACs
• Tight security of cascaded LRW2
• \(\mathsf{DWCDM}_+\): a BBB secure nonce based MAC
• Parallelizable MACs based on the sum of PRPs with security beyond the birthday bound
• Beyond birthday bound secure MAC in faulty nonce model
• Beyond-birthday secure domain-preserving PRFs from a single permutation
• \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
• How to build optimally secure PRFs using block ciphers
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• Foiling Birthday Attacks in Length-Doubling Transformations
• The Indistinguishability of the XOR of $$k$$ Permutations
• Feistel Ciphers
• Revisiting Full-PRF-Secure PMAC and Using It for Beyond-Birthday Authenticated Encryption
• How to Encipher Messages on a Small Domain
• Full PRF-Secure Message Authentication Code Based on Tweakable Block Cipher
• New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
• The “Coefficients H” Technique
• Unbalanced Feistel networks and block cipher design
• 3kf9: Enhancing 3GPP-MAC beyond the Birthday Bound
• Proof of Mirror Theory for ξ _max = 2
• The Sum of CBC MACs Is a Secure PRF
• A New Variant of PMAC: Beyond the Birthday Bound
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• Information Security and Cryptology - ICISC 2005

This page was built for publication: Proof of mirror theory for a wide range of \(\xi_{\max }\)