Comparative Study of MAC Algorithms in Pervasive Computing Environment

Journal Title: International Journal of Science and Research (IJSR) - Year 2015, Vol 4, Issue 3

Abstract

Nowadays coming technology, many applications dependupon the existence of small devices that can exchange, share the information and formcommunication networks. In an expressive manner of such applications, the confidentiality and integrity of the communicated messages are of particular interest area. In this paper work, we going to 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.The main use of one way cryptographic hash function for message authentication. A popular example of iterated cryptographic hash functions in the design of message authentication codes is HMAC, which was proposed by Bell are et al.

Authors and Affiliations

Keywords

Related Articles

A Tool to Measure the Behavioural Competency of Under Graduate Students

Behavioural competency refers to personal attributes or characteristics (i.e. motives, attitudes, values) that describe how a job or task is performed as opposed to the particulars of the job or task. For instance, compe...

Recording of Intimacies using Mobile Phone Cameras: An Exploratory Study into the Factors behind the Consent of Female Counterparts

Recording of Intimacies using Mobile Phone Cameras: An Exploratory Study into the Factors behind the Consent of Female Counterparts

Finding Maximal Clique In A Graph

Given a simple graph G with n vertices. Furthermore, given an algorithm to get maximal clique in graph G. Clique Q of G is a set of vertices, where each vertex are connected to each other. Clique is called maximal clique...

Karanja Oil as an Alternative Fuel for Direct Injection CI Engine- A Review

An ever increasing demand of fuels has been a challenge for today

Performance Modeling of Automotive Sensors and Sensor Interface Systems using Simulink

Performance Modeling of Automotive Sensors and Sensor Interface Systems using Simulink

Download PDF file
  • EP ID EP357113
  • DOI -
  • Views 78
  • Downloads 0

How To Cite

(2015). Comparative Study of MAC Algorithms in Pervasive Computing Environment. International Journal of Science and Research (IJSR), 4(3), -. https://europub.co.uk/articles/-A-357113