One-time password based on hash chain without shared secret and re-registration

With the extension in computer networks, there has been a drastic change in the disposition of network security. Security has always been a major concern of any organization as it involves mechanisms to ensure reliable access. In the present era of global electronic connectivity where hackers, eavesdroppers, electronic frauds, viruses are growing in number, security has proved to be indispensable. Although numerous solutions have been put forth in literature to guarantee security, they have botched with related traits like efficiency and scalability. Despite the range of security solutions that have been presented by experts, not a single approach has been wholly agreed upon to provide absolute security or standardized upon unanimously. Furthermore, these approaches lack adoptable user implementation. In this paper, various approaches and techniques that were introduced in the past for the purpose of enhancing the authentication and authorization of the user while performing sensitive and confidential transaction are discussed. Each of works performed by the researchers is taken single-handedly for debate followed by analysis. Finally, the open issues in the current domain of study are formulated from the review conducted.

/pdf/contemplation-of-effective-security-measures-in-access-zuzlsbgf8q.pdf

Contemplation of Effective Security Measures in Access Management from Adoptability Perspective

Broadcast authentication is a fundamental security technology in wireless sensor networks (ab. WSNs). As an authentication protocol, the most widely used in WSN, μTESLA protocol, its publication of key is based on a fixed time interval, which may lead to unsatisfactory performance under the unstable network traffic environment. Furthermore, the frequent network communication will cause the delay authentication for some broadcast packets while the infrequent one will increase the overhead of key computation. To solve these problems, this paper improves the traditional μTESLA by determining the publication of broadcast key based on the network data flow rather than the fixed time interval. Meanwhile, aiming at the finite length of hash chain and the problem of exhaustion, a self-renewal hash chain based on Benaloh-Leichter secret sharing scheme (SRHC-BL SSS) is designed, which can prolong the lifetime of network. Moreover, by introducing the queue theory model, we demonstrate that our scheme has much lower key consumption than μTESLA through simulation evaluations. Finally, we analyze and prove the security and efficiency of the proposed self-renewal hash chain, comparing with other typical schemes.

/pdf/an-improved-mtesla-protocol-based-on-queuing-theory-and-5f94kfz3b6.pdf

An Improved μTESLA Protocol Based on Queuing Theory and Benaloh-Leichter SSS in WSNs

With the increasing number of smart mobile devices, applications based on mobile network take an indispensable role in the Internet of Things. Due to the limited computing power and restricted storage capacity of mobile devices, it is very necessary to design a secure and lightweight authentication scheme for mobile devices. As a lightweight cryptographic primitive, the hash chain is widely used in various cryptographic protocols and one-time password systems. However, most of the existing research work focuses on solving its inherent limitations and deficiencies, while ignoring its security issues. We propose a novel construction of hash chain that consists of multiple different hash functions of different output lengths and employ it in a time-based one-time password (TOTP) system for mobile device authentication. The security foundation of our construction is that the order of the hash functions is confidential and the security analysis demonstrates that it is more secure than other constructions. Moreover, we discuss the degeneration of our construction and implement the scheme in a mobile device. The simulation experiments show that the attacker cannot increase the probability of guessing the order by eavesdropping on the invalid passwords.

/pdf/an-authentication-scheme-based-on-novel-construction-of-hash-2bpll062zl.pdf

An Authentication Scheme Based on Novel Construction of Hash Chains for Smart Mobile Devices

Authentication plays a critical role in network security. After reviewing the prior studies, it is found that authentication system focusing on Learning Management System (LMS) based on cloud environment is very few. Majority of the prior security techniques applies conventional cryptographic hash function where enough robustness and resiliency towards various vulnerable attacks on cloud environment is substantially missing. Therefore, this paper presents a novel, simple, and yet cost effective authentication technique that uses the potential characteristics of recently launched keccak protocol by NIST for the first time in securing the accessibility of users in interactive digital library system. Hence, we coined a term S-DILS i.e. secured-Digital Interactive Learning System. The outcome of the system is compared with existing hash protocols to find that S-DILS excels far better in every respect of security.

S-DILS: Framework for Secured Digital Interaction Learning System Using keccak

Self-Updating Hash Chain can be used extensively in many fields, such as one time password(OTP), signatures and authentication etc. In this paper, we propose a new self-updating hash chain based linear partition-combination algorithm (LPCA), which can share data into m parts and any part can’ t leak any information of data s. At a each exchange process, one part of s is transferred. When servers receive k(k≪m parts of s, servers can reconstruct s, the root of a new hash chain is created. Analysis are given to illustrate the Structure Scheme is secure and efficient.

Bin Dong

Papers

A New Self-Updating Hash Chain Structure Scheme