A cost-efficient one time password-based authentication in cloud environment using equal length cellular automata

Journal of Industrial Information Integration

Volumn 5, Issue , 2017, Pages 17-25

  Mitra, Arnab ^a   Kundu, Anirban ^b   Chattopadhyay, Matangini ^c   Chattopadhyay, Samiran ^c  

^a Computer Innovative Research Society ^*  (India)

^b NETAJI SUBHASH ENGINEERING COLLEGE   (India)

^c JADAVPUR UNIVERSITY   (India)

Author keywords

Authentication; Cellular automata; Characteristics polynomial; Cloud computing; Equal length cellular automata; One time password

Indexed keywords

CELLULAR AUTOMATA; CLOUD COMPUTING; COST EFFECTIVENESS; POLYNOMIALS;

CHARACTERISTICS POLYNOMIAL; CLOUD ENVIRONMENTS; COST EFFECTIVE; ITS APPLICATIONS; MODULAR ARITHMETIC; NOVEL ALGORITHM; ONE TIME PASSWORDS; PSEUDORANDOMNESS;

AUTHENTICATION;

EID: 85018550229     PISSN: 2452414X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jii.2016.11.002     Document Type: Article

References (60)

1. [1] Yin, Y., Zeng, Y., Chen, X., Fan, Y., The internet of things in healthcare: an overview. J. Ind. Inf. Integ. 1 (2016), 3–13.
2. [2] Tao, F., Wang, Y., Zuo, Y., Yang, H., Zhang, M., Internet of things in product life-cycle energy management. J. Ind. Inf. Integ. 1 (2016), 26–39.
3. [3] Viriyasitavat, W., Multi-criteria selection for services selection in service workflow. J. Ind. Inf. Integ. 1 (2016), 20–25.
4. [4] Wang, C., A multidisciplinary design and analysis environment and its application to aircraft flight dynamics analysis. J. Ind. Inf. Integ. 1 (2016), 14–19.
5. [5] T.Y.C. Woo, S.S. Lam, Authentication for distributed system, (1992) 1–30. http://www.cs.utexas.edu/users/lam/Vita/Bpapers/WooLam98b.pdf (accessed January 2016).
6. [6] Islam, S.K.H., Biswas, G.P., Choo, K.-K.R., Cryptanalysis of an improved smartcard-based remote password authentication scheme. Inf. Sci. Lett. 3:1 (2014), 35–40.
7. [7] Siddiqui, Z., Abdullah, A.H., Khan, M.K., Alghamdi, S., Smart environment as a service: three factor cloud based user authentication for telecare medical information system. J. Med. Syst. 38:1 (2014), 1–14.
8. [8] Xu, F., Lv, X., Zhou, Q., Liu, X., Self-updating one-time password mutual authentication protocol for ad hoc network. KSII Trans. Int. Inf. Syst. 8:5 (2014), 1817–1827.
9. [9] Vinh, T.L., Bouzefrane, S., Farinone, J.M., Attar, A., Kennedy, B.P., Middleware to integrate mobile devices, sensors and cloud computing. Procedia Computer Science 52 (2015), 234–243.
10. [10] Jeon, J.C., Kim, K.W., Yoo, K.Y., Non-group cellular automata based one time password authentication scheme in wireless networks. International Workshop Secure Mobile Ad-hoc Networks and Sensors (MADNES), Singapore, 2006, 110–116.
11. [11] Kolhe, S., Dhage, S., Trusted platform for support services in cloud computing environment. International Conference of System Engineering and Technology (ICSET), Bandung, 2012, 1–6.
12. [12] Kuyoro, S.O., Ibikunle, F., Awodele, O., Cloud computing security issues and challenges. Int. J. Comput. Netw. 3:5 (2011), 247–255.
13. [13] Kshemkalyani, A., Singhal, M., Chapter 16: Authentication in Distributed System, Distributed Computing: Principles, Algorithms and Systems. 2011, Cambridge University Press, 598–628.
14. [14] Dasgupta, P., Chattopadhyay, S., Sengupta, I., An ASIC for cellular automata based message authentication. VLSI Design Conference, Calcutta, India, 1999, 538–541.
15. [15] Timpner, J., Schürmann, D., Wolf, L., Secure smartphone-based registration and key deployment for vehicle-to-cloud communications. ACM Workshop on Security, Privacy & Dependability for Cyber Vehicles, 2013, 31–36.
16. [16] Yang, H.J., Costan, V., Zeldovich, N., Devadas, S., Authenticated storage using small trusted hardware. ACM Workshop Cloud Computing Security, 2013, 35–46.
17. [17] Dunning, L.A., Kresman, R., Privacy preserving data sharing with anonymous id assignment. IEEE Trans. Inf. Forensic. Sec. 8:2 (2013), 402–413.
18. [18] Jeon, J.-C., Yoo, K-Y., Authentication based on singular cellular automata. Lect. Notes Comp. Science 4173 (2006), 605–610.
19. [19] Bhadauria, R., Sanyal, S., Survey on security issues in cloud computing and associated mitigation techniques. Int. J. Comput. Appl. 47:18 (2012), 47–66.
20. [20] S. Wolfram, Cryptography with cellular automata. http://www.stephenwolfram.com/publications/academic/cryptography-cellular-automata.pdf (accessed April 2016).
21. [21] Chin, W., Cortzen, B., Goldman, J., Linear cellular automata with boundary conditions. Linear Algebra Appl. 322:1 (2001), 193–206.
22. [22] Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chattopadhyay, S., Additive Cellular Automata: Theory and Applications. 1997, IEEE Computer Society Press, USA, 1.
23. [23] Agrawal, P., Rao, S., Energy-aware scheduling of distributed systems. IEEE Trans. Autom. Sci. Eng. 11:4 (2014), 1163–1175.
24. [24] Sunderam, V.S., PVM: a framework for parallel distributed computing. Concurrency 2:4 (1990), 315–339.
25. [25] Seredynski, F., Zomaya, A.Y., Sequential and parallel cellular automata-based scheduling algorithms. IEEE Trans. Parallel Distrib. Syst. 13:10 (2002), 1009–1023.
26. [26] Cannataro, M., Di Gregorio, S., Rongo, R., Spataro, W., Spezzano, G., Talia, D., A parallel cellular automata environment on multicomputers for computational science. Parallel Comput. 21:5 (1995), 803–823.
27. [27] Bandini, S., mauri, G., Serra, R., Cellular Automata: from a theoretical parallel computational model to its application to complex systems. Parallel Comput. 27:5 (2001), 539–553.
28. [28] Nandi, S., Kar, B.K., Chaudhuri, P.P., Theory and application of cellular automata in cryptography. IEEE Trans. Comput., 43(12), 1994 1346–135.
29. [29] Jamil, N., Ramlan, M., Cellular automata based user authentication scheme using identity-bits commitment for Wireless Sensor Network. IEEE 3rd International Conference Communication Software and Networks (ICCSN-2011), Xi'an, May 27-29, 2011, 388–391.
30. [30] Mukherjee, M., Ganguly, N., Chaudhuri, P.P., Cellular automata based authentication (CAA). Lect. Notes Comp. Science 2493 (2002), 259–269.
31. [31] Yampolskiy, R.V., Rebolledo-Mendez, J.D., Hindi, M.M., Password protected visual cryptography via cellular automaton rule 30, Tran. Data Hiding and Multimedia Security IX. Lect. Notes Comp. Science 8363 (2014), 57–67.
32. [32] Ghosh, S., Bacchar, T., Maiti, N.S., Mitra, I., Chaudhuri, P.P., Theory and application of equal length cycle cellular automata (ELCCA) for enzyme classification. Lect. Notes Comp. Science 6350 (2010), 46–57.
33. [33] Mitra, A., Kundu, A., Chattopadhyay, M., Chattopadhyay, S., An analysis of equal length cellular automata (ELCA) generating linear rules for applications in distributed computing. J. Cellular Automata 10:1-2 (2015), 95–117.
34. [34] Baetens, J.M., Baets, B.D., Towards generalized measures grasping CA dynamics. 9th International Conference Cellular Automata for Research and Industry (ACRI 2010), Italy, 2010, 177–187 Sep. 21-24.
35. [35] Mitra, A., Kundu, A., Das, C., Random number generators: performance comparison of ELCA and MaxCA. CSI Trans. ICT 2:2 (2014), 117–127.
36. [36] Dean, N., Shannon, G.E., DIMACS-Series in discrete mathematica and theoretical computer science, 15(1992), Computational Support for discrete mathematics, DIMACS Workshop. 1992, American Mathematical Society.
37. [37] Lov ́sz, L., Vesztergombi, K., Discrete Mathematics, Lecture Notes. 1999, Yale University, 4–139 http://www.cims.nyu.edu/∼regev/teaching/discrete_math_fall_2005/dmbook.pdf (accessed 06.04.2016).
38. [38] Barrett, C.L., Chen, W.Y.C., Reiyds, C.M., On gardens of eden of elementary cellular automata. International Conference Discrete Models (Combinatories, Computation & Geometry), Paris, 2001, 1–9.
39. [39] H.V. McIntosh, Linear cellular automata via de bruijn diagrams, (1991) 1–49.
40. [40] Fujiwara, H., Obein, M.E.J., Secure and testable scan design using extended de bruijn graphs. Asia South Pacific Design Automation Conf. (ASP-DAC), Taiwan, 2010, 413–418.
41. [41] Sutner, K., De bruijn graphs and linear cellular automata. Complex Systems 5:1 (1991), 19–30.
42. [42] Kari, J., Cryptosystems based on reversible cellular automata. Manuscript, 1992, 1–10 http://users.utu.fi/jkari/CACryptoScanned.pdf (accessed April 2015).
43. [43] Ganguly, N., Sikdar, B.K., Chaudhuri, P.P., Theory of additive cellular automata. Fundamenta Informaticae XXI (2001), 1001–1021.
44. [44] Mitra, A., Kundu, A., Chattopadhyay, M., Chattopadhyay, S., Dynamics computation of equal length cellular automata (ELCA) rules; 5th International Conference Electronics Engineering & Computer Science (IEMCON). India, 2014, 214–220.
45. [45] Langton, C.G., Computation at the age of chaos: phase transitions and emergent computation. Physica D 42 (1990), 12–37.
46. [46] E.W. Weisstein, “Bijection” from mathworld–a wolfram web resource. http://mathworld.wolfram.com/Bijection.html (accessed April 2016).
47. [47] E.W. Weisstein, “Injection” from mathworld–a wolfram web resource. http://mathworld.wolfram.com/Injection.html (accessed April 2016).
48. [48] E.W. Weisstein, “Surjection” from mathworld–a wolfram web resource. http://mathworld.wolfram.com/Surjection.html (accessed April 2016).
49. [49] created byInsall, M., “Lattice Isomorphism” from mathworld–a wolfram web resource. Weisstein, E.W., (eds.), 2016 (accessed April 2016).
50. [50] Ganguly, N., Sikdar, B.K., Deutsch, A., Canright, G., Chaudhuri, P.P., A survey on cellular automata. http://www.cs.unibo.it/bison/publications/CAsurvey.pdf, 2003 (accessed April 2016).
51. [51] http://cims.nyu.edu/∼kiryl/Algebra/Section_3.10–Polynomials_Over_The_Rational_Field.pdf (accessed April 2016).
52. [52] Wang, D.K., Compagner, A., On the use of reducible polynomials as random number generators. Math. Comput. 60:201 (1993), 363–374.
53. [53] Cenzer, D., Remmel, J.B., Sub-computable bounded pseudorandomness, logical foundations of computer science. Lect. Notes Comp. Science 7734 (2013), 104–118.
54. [54] Li, W., Packard, N., The structure of the elementary cellular automata rule space. Complex Systems 4 (1990), 281–297.
55. [55] Bojinov, H., Sanchez, D., Reber, P., Boneh, D., P. Linclon, P., Neuroscience meets cryptography: designing crypto primitives secure against rubber hose attacks. USENIX Security Symposium, Bellevue, WA, 2012, 129–141.
56. [56] http://global.britannica.com/EBchecked/topic/603174/transposition-cipher (accessed July 2015).
57. [57] http://www.math.lsa.umich.edu/∼speyer/417/InjectiveSurjective.pdf (accessed April 2016).
58. [58] Gaborit, P., Ruatta, O., Schrek, J., Zémor, G., RankSign: an efficient signature algorithm based on the rank metric. International Workshop Post-Quantum Cryptography, 2014, 88–107.
59. [59] Randomness of statistical sampling: the runs' test. https://home.ubalt.edu/ntsbarsh/business-stat/otherapplets/Randomness.htm (accessed April 2016).
60. [60] Test for randomness: the runs' test. https://home.ubalt.edu/ntsbarsh/business-stat/opre504.htm#rrunstest (accessed November 2016).