CBC MACs for arbitrary-length messages: The three-key constructions
We suggest some simple variants of the CBC MAC that enable the efficient authentication of arbitrary-length messages. Our constructions use three keys, K1, K2, K3, to avoid unnecessary padding and MAC any message M {0,1}*using max{1, Γ |M|/nΓ} applications of the underlying n-bit block cipher. Our f...
Saved in:
Main Authors: | John Black, Phillip Rogaway |
---|---|
Format: | Journal |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=17444383008&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/62165 |
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: Black J., et al.
Published: (2014) -
Improved security analyses for CBC MACs
by: Mihir Bellare, et al.
Published: (2018) -
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)