PMAC with parity: minimizing the query-length influence

DOI10.1007/978-3-642-27954-6_13MaRDI QIDQ2890005zbMATH OpenOpenAlexFDO

Authors Kan Yasuda

Publication date 8 June 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-27954-6_13

zbMATH Keywords

Block cipherchecksumgame-playing techniquemode of operationpermutationprovable security

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• A new variant of PMAC: beyond the birthday bound
• Improved security analysis of PMAC
• New Bounds for PMAC, TMAC, and XCBC
• scientific article; zbMATH DE number 2086719
• On the influence of message length in PMAC's security bounds

Cites work

• A new variant of PMAC: beyond the birthday bound
• A unified method for improving PRF bounds for a class of blockcipher based MACs
• CBC MAC for real-time data sources
• Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
• Fast and Secure CBC-Type MAC Algorithms
• How to stretch random functions: The security of protected counter sums
• scientific article; zbMATH DE number 1030977 (Why is no real title available?)
• scientific article; zbMATH DE number 1030978 (Why is no real title available?)
• scientific article; zbMATH DE number 1962141 (Why is no real title available?)
• scientific article; zbMATH DE number 1759779 (Why is no real title available?)
• scientific article; zbMATH DE number 2086719 (Why is no real title available?)
• scientific article; zbMATH DE number 1406792 (Why is no real title available?)
• Improved Security Analyses for CBC MACs
• Improving the Security of MACs Via Randomized Message Preprocessing
• Multilane HMAC— Security beyond the Birthday Limit
• New Bounds for PMAC, TMAC, and XCBC
• OMAC: one-key CBC MAC.
• Pseudo-Random Functions and Parallelizable Modes of Operations of a Block Cipher
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The sum of CBC MACs is a secure PRF

Cited in

(13)

• Using an Error-Correction Code for Fast, Beyond-Birthday-Bound Authentication
• On the influence of message length in PMAC's security bounds
• Revisiting full-PRF-secure PMAC and using it for beyond-birthday authenticated encryption
• Generalizing PMAC under weaker assumptions
• New Bounds for PMAC, TMAC, and XCBC
• Improved security analysis of PMAC
• A MAC mode for lightweight block ciphers
• A new variant of PMAC: beyond the birthday bound
• Fine-tuning the ISO/IEC standard \textsf{LightMAC}
• Quantum attacks on beyond-birthday-bound MACs
• \textsf{LightMAC}: fork it and make it faster
• A quantum-secure partial parallel MAC QPCBC
• A lightweight alternative to PMAC

This page was built for publication: PMAC with parity: minimizing the query-length influence

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