%0 Journal Article
%A WANG Da-yin
%A WEN Qiao-yan
%A XU Jin
%T An Analysis of the Construction of XOR-MAC and a Proof for Its Security
%D 2014
%R 10.13190/j.jbupt.2014.02.001
%J Journal of Beijing University of Posts and Telecommunications
%P 1-4
%V 37
%N 2
%X <p>In order to study the construction of XOR message authentication code (XOR-MAC), we analyse it from the view of universal Hash and pseudo-random function, using shared random funciton model. Firstly, XOR-MAC is splited into two parts: a pseudo-random funtion and an universal Hash. Secondly, this two parts can be proved to have certain properties. Finally, XOR-MAC is regarded as a kind of Carter-Wegman MAC by adopting a new method that applies a pseudo-random functions directly to the output of an universal Hash family. And we give a simple security proof of XOR-MAC based on information theory. The most important thing is that many new MACs can be easily constructed using this idea.</p>
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2014.02.001