Secure Message Authentication Process in Mobile Computing
Keywords:
Verification, Unconditional Guarantee, Computational Guarantee, Pervasive computingAbstract
In frequent applications trust on the persistence of compact inventions that can interchange data and produce the communication networks. In a relevant part of such applications, the confidentiality and integrity of the exchanged messages are of particular attention. In this effort, we use two novel procedures for protecting message authentication codes and validating encrypted messages that are required to face the demands of mobile and pervasive computing. By taking the benefits of the reality that the report to be verified must also be encrypted, we use provably securing codes that will be productive than other codes. The secret intention behind our advance techniques is to make use of the security that can be issued by an encryption algorithm to plan additional protecting actions, as against to using other standalone securing primitives.
References
 [1] B. Alomair, A. Clark, and R. Poovendran, “The Power of Primes: Security of Authentication Based on a Universal Hash-Function Family,†J. Math. Cryptology, vol. 4,     no. 2, 2010.
[2] B. Preneel and P.V. Oorschot, “MDx-MAC and Building Fast MACs from Hash Functions,†Proc. 15th Ann. Int’l Cryptology Conf. Advances in Cryptology            (CRYPTO ’95), vol. 963, pp. 1-14, 1995.
[3] J. Katz and Y. Lindell, Introduction to Modern Cryptography. Chapman & Hall/CRC, 2008.
[4] M. Furer, “Faster Integer Multiplication,†Proc. ACM Symp. Theory of Computing (STOC ’07), p. 66, 2007.
[5] P. Rogaway, M. Bellare, and J. Black, “OCB: A Block-Cipher Mode of Operation for Efficient Authenticated Encryption,†ACM Trans. Information and System Security, vol. 6, no. 3, pp. 365-403, 2003.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRSET
This work is licensed under a Creative Commons Attribution 4.0 International License.