The Sum of CBC MACs Is a Secure PRF

DOI10.1007/978-3-642-11925-5_25zbMath1274.94125OpenAlexW1590517425MaRDI QIDQ5189462

Kan Yasuda

Publication date: 16 March 2010

Published in: Topics in Cryptology - CT-RSA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11925-5_25

zbMATH Keywords

PRPcollisionPRF64-bit block cipherlazy samplinggame-playing proofISO/IEC 9797-1:1999sum construction

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (20)

PMAC with Parity: Minimizing the Query-Length Influence ⋮ Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting ⋮ Revisiting structure graphs: applications to CBC-MAC and EMAC ⋮ Tweakable Blockciphers with Asymptotically Optimal Security ⋮ \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations ⋮ Proof of mirror theory for a wide range of \(\xi_{\max }\) ⋮ Key-reduced variants of 3Kf9 with beyond-birthday-bound security ⋮ Quantum attacks against BBB secure PRFs or MACs built from public random permutations ⋮ Quantum linearization attacks ⋮ Fine-tuning the ISO/IEC standard \textsf{LightMAC} ⋮ On the Efficiency of ZMAC-Type Modes ⋮ Quantum attacks on beyond-birthday-bound MACs ⋮ Improved security analysis for nonce-based enhanced hash-then-mask MACs ⋮ How to build optimally secure PRFs using block ciphers ⋮ A MAC Mode for Lightweight Block Ciphers ⋮ One-Key Compression Function Based MAC with Security Beyond Birthday Bound ⋮ Mind the composition: birthday bound attacks on EWCDMD and SoKAC21 ⋮ Tight security bounds for double-block hash-then-sum MACs ⋮ EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC ⋮ Attacks on beyond-birthday-bound MACs in the quantum setting

This page was built for publication: The Sum of CBC MACs Is a Secure PRF