Equivalence between MAC, WCR and PRF for Blockcipher Based Constructions

被引：0
|
作者：
Datta, Nilanjan [1 ]
Nandi, Mridul [1 ]
机构：
[1] Indian Stat Inst, Kolkata 700108, India
来源：
PROVABLE SECURITY, PROVSEC 2014 | 2014年 / 8782卷
关键词：
Affine Domain Extension; Blockcipher; MAC; PRF; WCR; SECURITY; BOUNDS; OMAC; TMAC;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In FSE'10, Nandi proved a sufficient condition of pseudo random function (PRF) for affine domain extensions (ADE), a wide class of blockcipher based domain extensions. This sufficient condition is satisfied by all known ADE, however, it is not a characterization of PRF. In this paper we completely characterize the ADE and show that weaker security notions message authentication code (MAC) and weakly collision resistant (WCR) are indeed equivalent to PRF.
引用
收藏
页码：300 / 308
页数：9
相关论文
共 50 条
12345