Generalizing PMAC Under Weaker Assumptions

DOI10.1007/978-3-319-19962-7_25zbMath1391.94742OpenAlexW2296016513MaRDI QIDQ3194621

Kan Yasuda, Nilanjan Datta

Publication date: 20 October 2015

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19962-7_25

zbMATH Keywords

regularMACprivacy preservingPMACfinalization

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Keying Hash Functions for Message Authentication
• On Fast and Provably Secure Message Authentication Based on Universal Hashing
• Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations
• Pseudo-Random Functions and Parallelizable Modes of Operations of a Block Cipher
• Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
• Automata, Languages and Programming
• New Proofs for NMAC and HMAC: Security Without Collision-Resistance
• Fast Software Encryption

This page was built for publication: Generalizing PMAC Under Weaker Assumptions