Issue No. 03 - March (2014 vol. 13)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2012.252
Basel Alomair , Computer Research Institute (CRI), King Abdulaziz City for Science and Technology (KACST), Saudi Arabia
Radha Poovendran , University of Washington, Seattle
With today's technology, many applications rely 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 communicated messages are of particular interest. In this work, we propose two novel techniques for authenticating short encrypted messages that are directed to meet the requirements of mobile and pervasive applications. By taking advantage of the fact that the message to be authenticated must also be encrypted, we propose provably secure authentication codes that are more efficient than any message authentication code in the literature. The key idea behind the proposed techniques is to utilize the security that the encryption algorithm can provide to design more efficient authentication mechanisms, as opposed to using standalone authentication primitives.
Encryption, Authentication, Message authentication, Algorithm design and analysis,pervasive computing, Authentication, unconditional security, computational security, universal hash-function families
Basel Alomair, Radha Poovendran, "Efficient Authentication for Mobile and Pervasive Computing", IEEE Transactions on Mobile Computing, vol. 13, no. , pp. 469-481, March 2014, doi:10.1109/TMC.2012.252