With current technology many applications depend on the existence of small devices that can exchange information and form communication networks. In a significant portion of such applications, the confidentiality and integrity of the messages communicated are of particular interest.
A popular class of unconditionally secure authentication is based on universal hash-function families initiated by Carter and Wegman. Since then the study of unconditionally secure message authentication based on universal hash functions has attracted the attention of research both from the point of view of design and analysis.