Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

Efficient Authentication Using Fine-grained Approach over Mobile and Pervasive Computing

Vemula Rohini, Dr S.Prem Kumar, , ,
(M.Tech), CSE
Professor & HOD, Department of computer science and engineering, G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.

Now a days in technology, many applications fall back on the existence of small devices that can swap information and form communication networks. In important portion of such applications, the confidentiality and integrity of the communicated messages are of fastidious attention. 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.

Vemula Rohini,Dr S.Prem Kumar."Efficient Authentication Using Fine-grained Approach over Mobile and Pervasive Computing". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 09,pp.617-621, SEPTEMBER - 2015, URL :,

Keywords : Mobile computing, Pervasive Computing, message authentication code (MAC) algorithm.

[1] L. Carter and M. Wegman, ―Universal Hash Functions,‖ J. Computer and System Sciences, vol. 18, no. 2, pp. 143-154, 1979. 
[2] T. Helleseth and T. Johansson, ―Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings,‖ Proc. 16th Ann. Int‘l Cryptology Conf. Advances in Cryptology (CRYPTO ‘96), pp. 31-44, 1996. 
[3] V. Shoup, ―On Fast and Provably Secure Message Authentication Based on Universal Hashing,‖ Proc. 16th Ann. Int‘l Cryptology Conf. Advances in Cryptology (CRYPTO ‘96), pp. 313-328, 1996. 
[4] 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. 
[5] B. Alomair and R. Poovendran, ―E-MACs: Towards More Secure and More Efficient Constructions of Secure Channels,‖ IEEE Trans. Computers, 2012. 
[6] ―Near Optimal Algorithms for Solving Differential Equations of Addition with Batch Queries,‖ in Progress in Cryptology– INDOCRYPT‘05, vol. 3797, Lecture Notes in Computer Science. Springer, 2005, pp. 90–103. 
[7] H. Wu and B. Preneel, ―Differential-linear attacks against the stream cipher Phelix,‖ in Fast Software Encryption–FSE‘07, vol. 4593, Lecture Notes in Computer Science. Springer, 2007, pp. 87–100. 
[8] D. Stinson, Cryptography: Theory and Practice. CRC Press, 2006. 
[9] M. Bellare and C. Namprempre, ―Authenticated Encryption: Relations Among Notions and Analysis of the Generic Composition Paradigm,‖ Journal of Cryptology, vol. 21, no. 4, pp. 469–491, 2008. 
[10] J. Katz and Y. Lindell, Introduction to modern cryptography. Chapman & Hall/CRC, 2008. 
[11] M. F¨urer, ―Faster integer multiplication,‖ in ACM symposium on Theory of computing–STOC‘07. ACM, 2007, p. 66. 
[12] C. Jutla, ―Encryption modes with almost free message integrity,‖ Journal of Cryptology, vol. 21, no. 4, pp. 547–578, 2008. 
[13] P. Rogaway, M. Bellare, and J. Black, ―OCB: A Block-Cipher Mode of Operation for Efficient Authenticated Encryption,‖ ACM Transactions on Information and System Security, vol. 6, no. 3, pp. 365–403, 2003. 
[14] A. Menezes, P. Van Oorschot, and S. Vanstone, Handbook of applied cryptography. CRC, 1997. 
[15] B. Alomair and R. Poovendran, ―Efficient Authentication for Mobile and Pervasive Computing,‖ in The 12th International Conference on Information and Communications Security–ICICS‘10. Springer, 2010. 
[16] S. Callegari, R. Rovatti, and G. Setti, ―Embeddable ADC-based true random number generator for crypto- graphic applications exploiting nonlinear signal processing and chaos,‖ IEEE Transactions on Signal Processing, vol. 53, no. 2 Part 2, pp. 793–805, 2005. 
[17] A. Francillon, C. Castelluccia, and P. Inria, ―TinyRNG: A cryptographic random number generator for wireless sensors network nodes,‖ in Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks– WiOpt‘07. Citeseer, 2007, pp. 1–7. 
[18] J. Nakajima and M. Matsui, ―Performance analysis and parallel implementation of dedicated hash functions,‖ in Advances in Cryptology– EUROCRYPT 2002. Springer, 2002, pp. 165–180. 
[19] B. Preneel, ―Using Cryptography Well,‖ Printed handout available at /using crypto well. pdf, 2010. 
[20] J. Großsch¨adl, R. Avanzi, E. Savas¸, and S. Tillich, ―Energy-efficient software implementation of long integer modular arithmetic,‖ in Proceedings of the 7th international conference on Cryptographic hardware and embedded systems – CHES‘05, vol. 3659. SpringerVerlag, 2005, pp. 75–90.


Download :

Refbacks : Currently there are no Refbacks


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events

Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.

Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.

IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert

IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)

Emerging Sources Citation Index (in process)

IJCERT title is under evaluation by Scopus.

Key Dates

☞   LAST DATE OF SUBMISSION : 31st March 2023
In 7 Days

Important Announcements

All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index

Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)

Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links

Conference Proposal