Proficient Authentication Mechanism for Mobile and Pervasive Computing

Kantamraju Anuhya, G Syam Prasad

Abstract


Mobile Computing is a technology that allows transmission of data, voice and video via a computer or any other wireless enabled device without having to be connected to a fixed physical link. 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

Keywords


Authentication, unconditional security, computational security, universal hash-function families, pervasive computing.

References


J. Carter and M. Wegman, “Universal classes of hash functions,†in Proceedings of the ninth annual ACM symposium on Theory of computing–STOC’77. ACM, 1977, pp. 106–112.

M. Wegman and J. Carter, “New classes and applications of hash functions,†in 20th Annual Symposium on Foundations of Computer Science–FOCS’79. IEEE, 1979, pp. 175–182.

L. Carter and M. Wegman, “Universal hash functions,†Journal of Computer and System Sciences, vol. 18, no. 2, pp. 143–154, 1979.

M. Wegman and L. Carter, “New hash functions and their use in authentication and set equality,†Journal of Computer and System Sciences, vol. 22, no. 3, pp. 265–279, 1981.

J. Bierbrauer, “A2-codes from universal hash classes,†in Advances in Cryptology–EUROCRYPT’95, vol. 921, Lecture Notes in Computer Science. Springer, 1995, pp. 311–318.

M. Atici and D. Stinson, “Universal Hashing and Multiple Authentication,†in Advances in Cryptology–CRYPTO’96, vol. 96, Lecture Notes in Computer Science. Springer, 1996, pp. 16–30.

T. Helleseth and T. Johansson, “Universal hash functions from exponential sums over finite fields and Galois rings,†in Advances in cryptology–CRYPTO’96, vol. 1109, Lecture Notes in Computer Science. Springer, 1996, pp. 31–44.

V. Shoup, “On fast and provably secure message authentication based on universal hashing,†in Advances in Cryptology–CRYPTO’96, vol. 1109, Lecture Notes in Computer Science. Springer, 1996, pp. 313–328.

J. Bierbrauer, “Universal hashing and geometric codes,†Designs, Codes and Cryptography, vol. 11, no. 3, pp. 207–221, 1997.

B. Alomair, A. Clark, and R. Poovendran, “The Power of Primes: Security of Authentication Based on a Universal Hash-Function Family,†Journal of Mathematical Cryptology, vol. 4, no. 2, 2010.

B. Alomair and R. Poovendran, “E-MACs: Towards More Secure and More Efficient Constructions of Secure Channels,†in the 13th International Conference on Information Security and Cryptology –ICISC’10. Springer, 2010.

FIPS 113, “Computer Data Authentication,†Federal Information Processing Standards Publication, 113, 1985.

ISO/IEC 9797-1, “Information technology – Security techniques –Message Authentication Codes (MACs) – Part 1: Mechanisms using a block cipher,†1999.

M. Dworkin, “Recommendation for block cipher modes of operation: The CMAC mode for authentication,†2005.

T. Iwata and K. Kurosawa, “omac: One-key cbc mac,†in Fast Software Encryption–FSE’03, vol. 2887, Lecture notes in computer science. Springer, 2003, pp. 129–153.

M. Bellare, R. Guerin, and P. Rogaway, “XOR MACs: New methods for message authentication using finite pseudorandom functions,†in Advances in Cryptology–CRYPTO’95, vol. 963, Lecture Notes in Computer Science. Springer, 1995, pp. 15–28.

P. Rogaway and J. Black, “PMAC: Proposal to NIST for a parallelizable message authentication code,†2001.

M. Bellare, J. Kilian, and P. Rogaway, “The Security of the Cipher Block Chaining Message Authentication Code,†Journal of Computer and System Sciences, vol. 61, no. 3, pp. 362–399, 2000.

B. Preneel and P. Van Oorschot, “On the security of iterated message authentication codes,†IEEE Transactions on Information theory, vol. 45, no. 1, pp. 188–199, 1999.


Full Text: PDF [Full Text]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.

Â