A hierarchical two-tier one-way hash chain protocol for secure internet transactions

Abstract

One-way hash chains are a popular cryptographic technique used in many security applications. In this paper, we present a two-tier one-way hash chain (TTOHC) protocol to secure cookie-based Internet transactions. The use of cookies as a cheaper alternative to secure Internet sessions is extremely dangerous since session cookies can be easily sniffed out resulting in session hijacking. By utilizing different cryptographic hash functions arranged in two tiers, our hierarchical TTOHC protocol gives significant performance improvement over previously proposed solutions for securing Internet cookies. A detailed Java testbed has been used to evaluate alternative configurations for the hierarchical scheme and investigate the optimal set up of the two tiers. Detailed performance results obtained from this testbed are presented and analyzed.

A Data-origin Authentication Protocol Based on ONOS Cluster

“…This new kind of hash chain can be self-renewing without addition protocols and re-initialization smoothly. Another approach, the Two-tier One-way Hash Chain [8], have gave significant performance improvement over previously proposal. This proposal has a single first-tier chain and multiple second-tier chains.…”

“…Our proposal is based on two-tier self-renewable hash chain introduced by Alabrah et al [8] and Zhang et al [6] which are not meant for SDN. In our proposal, two tiers of hash chain, as shown in Fig.1, are used for different purposes.…”

Preventing session hijacking in collaborative applications with hybrid cache-supported one-way hash chains

“…This relieves some of the computational overhead, but requires additional memory that sometimes is not available especially with low-end devices such as some wireless devices. Another approach suggested in [17] and [18] is to divide the one-way hash chains in a twodimensional format. Compared to the sparse caching approach, dividing the OHC into multiple smaller chains does not provide a similar reduction in the computational overhead.…”

“…Compared to the sparse caching approach, dividing the OHC into multiple smaller chains does not provide a similar reduction in the computational overhead. In this paper, we propose a solution that benefits from the advantages of the sparse caching strategy proposed in [15] and [16], in addition to the efficiency of the twodimensional one-way hash construction [17] and [18]. The hybrid approach is light, efficient and easy to implement as a client side plug-in.…”

“…However, while the solution gives acceptable performance in reducing the computational overhead, cache memory is scarce in many mobile devices and the space for cache in these devices cannot be committed for a long time. Alternately, the authors of [17] and [18] propose a scheme that deploys two-dimensional mini one-way hash chains to significantly reduce the overhead of OHC without deploying cache memory.…”