Efficient Authentication Using Fine-grained Approach over Mobile and Pervasive Computing
Main Article Content
Abstract
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.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
IJCERT Policy:
The published work presented in this paper is licensed under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. This means that the content of this paper can be shared, copied, and redistributed in any medium or format, as long as the original author is properly attributed. Additionally, any derivative works based on this paper must also be licensed under the same terms. This licensing agreement allows for broad dissemination and use of the work while maintaining the author's rights and recognition.
By submitting this paper to IJCERT, the author(s) agree to these licensing terms and confirm that the work is original and does not infringe on any third-party copyright or intellectual property rights.
References
L. Carter and M. Wegman, ―Universal Hash Functions, J. Computer and System Sciences, vol. 18, no. 2, pp. 143-154, 1979.
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.
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.
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.
B. Alomair and R. Poovendran, ―E-MACs: Towards More Secure and More Efficient Constructions of Secure Channels, IEEE Trans. Computers, 2012.
―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.
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.
D. Stinson, Cryptography: Theory and Practice. CRC Press, 2006.
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.
J. Katz and Y. Lindell, Introduction to modern cryptography. Chapman & Hall/CRC, 2008.
M. F¨urer, ―Faster integer multiplication, in ACM symposium on Theory of computing–STOC‘07. ACM, 2007, p. 66.
C. Jutla, ―Encryption modes with almost free message integrity, Journal of Cryptology, vol. 21, no. 4, pp. 547–578, 2008.
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.
A. Menezes, P. Van Oorschot, and S. Vanstone, Handbook of applied cryptography. CRC, 1997.
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.
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.
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.
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.
B. Preneel, ―Using Cryptography Well, Printed handout available at http://secappdev.org/handouts/2010/Bart%20Preneel /using crypto well. pdf, 2010.
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.