Efficient Constructions for One-way Hash Chains (original) (raw)
Free related PDFsRelated papers
Free PDF
A Novel Hash Chain Construction for Simple and Efficient Authentication
—These years Internet of Things (IoT) has been paid much attention to and the importance of lightweight and efficient authentication protocols has been increasing. In this paper, we propose a novel and flexible hash chain construction, hash chain aggregation (HCA), and a scheme to establish a common key for two users using HCA. Our proposed scheme has the following significant advantages: (1) cryptographic primitives for our scheme are hash functions only and the resultant scheme is efficient, (2) our scheme is based on a totally new hash chain construction (HCA), and (3) what two users generating a common secret key must know is only the identity (ID) of the other. No communication is required except for in the initial setting. That is, our scheme is actually an ID-based authentication protocol.
Free PDF
Free PDF
Free PDF
Free PDF
Free PDF
Free PDF
Free PDF
Free PDF
A cool and practical alternative to traditional hash tables
2006
Recent advances in the theoretical literature have proposed interesting modifications to traditional hash tables. The authors of these papers propose hash tables which a) have a guaranteed constant time for a lookup b) have amortized constant time for an insertion c) require table size only slightly larger than the space for the elements Previous hash table technologies have offered at most two of these three. Moreover, these hash tables do no dynamic memory allocation (except when the tables have to be resized), are easy to code, admit efficient concurrent implementations, and can be tuned (even dynamically). This is enabled by one simple idea: allow elements in the hash table to have multiple potential locations by using multiple hash functions, and allow elements to be relocated among potential locations to make room for new elements. Such relocations can cascade, inducing a search-tree to find an empty slot, and a sequence of relocations to allow the insertion of a new key.
Free PDF
