Improved security analyses for CBC MACs
We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bits. The result assumes that no message queried is a prefix of any other, as is the case when all messages to be MACed have...
Saved in:
Main Authors: | Mihir Bellare, Krzysztof Pietrzak, Phillip Rogaway |
---|---|
Format: | Book Series |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=33745136125&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/61607 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
CBC MACs for arbitrary-length messages: The three-key constructions
by: John Black, et al.
Published: (2018) -
CBC MACs for arbitrary-length messages: The three-key constructions
by: Black J., et al.
Published: (2014) -
Formalizing human ignorance collision-resistant hashing without the keys
by: Phillip Rogaway
Published: (2018) -
MUMT - CBC - R: R Programming for EQA in CBC
by: ศิริลักษณ์ วิริยะอัครเดชา
Published: (2020) -
Human Resource Information System for China Banking Corporation (HRIS-CBC)
by: Arevalo, Mark Raymond C., et al.
Published: (1999)